+ All Categories
Home > Engineering > data structure

data structure

Date post: 13-Jul-2015
Category:
Upload: prince-gupta
View: 36 times
Download: 0 times
Share this document with a friend
Popular Tags:
12
LAXMIPATI INSTITUTE OF SCIENCE AND TECHNOLOGY LIST BHOPAL (M.P) DATA STRUCTURE PRESENTED BY- GROUP NO .4 NAME- 1.ROHIT KUMAR RAI 2. VISHAL DEV JHA
Transcript

LAXMIPATI INSTITUTE OF SCIENCE AND TECHNOLOGY

LIST BHOPAL (M.P)

DATA STRUCTURE

PRESENTED BY-

GROUP NO .4

NAME- 1.ROHIT KUMAR RAI

2. VISHAL DEV JHA

DATA STRUCTURE

What is data structure?

Data may be organized in many different ways.The logical are mathematical model of a particular organization of data is known as DATA STRUCTURE.

In other words, a data structure is a way of organization all data items the consider not only the elements stored but also their relationship to each other.

Some of data structure are arrays, linked lists, stacks, queve and trees.

DEFINE DATA STRUCTURE

1.Linear data structure – In the linear data structure

processing of data item is done in linear fashion. It

means that data can be processed one by one

sequenclly.

Linear data structure are- (a).Array (b).Linked list

(c).Stack and queus.

2.Non linear data structure- A data structure in which

insertion and deletion cannot be done in a linear

fashion is known as non linear data structure.

Non linear data structure include the following- (a).Tree

(b).Graph

CLASSIFICATION OF DATA STRUCTURE

DATA STRUTURE ARE NORMELLY DIVIDED INTO TWO BROAD

CATEGORIES-

(1).Primitive data structure

(2).Non-primitive data structure

DATA STRUCTURE

PRIMITIVE DATA

STRUCTURE

NON-PRIMITIVE DATA

STRUCTURE

HOW DATA IS PROCESSED ON DATA STRUCTURE ?

The following four operations play a major role in data

processing on data structure-

(1).Traversing

(2). Searching

(3). Inserting

(4). Deleting

A HASH TABLE IN DATA STRUCTURE

A hash table

PRIMITIVE DATA STRUCTURE

These are basic structure and are directly

operated upon by the machine instruction.

These have different representation on

different computers.

(1) Integer

(2) Float

(3) Charecter

(4) Pointer.

NON-PRIMITIVE DATA STRUCTURE

These are more sophisticated data structure,

which are derived from the primitive data

structure.

These have differents types of non-primitive

data structure-

(1) Arrays

(2) Lists

(3) Files

ARRAYS

An array is defined as a set of finite number of

homogeneous element s or data items.

Some common operations associated with arrays

are-

(a) Creation of an array

(b) Traversing an array

(c) Insertion of new element

(d) Deletion of new element

(e) Modification of an element

(f) Merging of arrays.

LIST

A list (linear link list) can be defined as a collection of variable number of data items.

Some common operations associated with linear linked lists are-

(a) Creation

(b) Insertion

(c) Deletion

(d) Traversing

(e) Searching

(f) Concatenation

(g) display

TYPES OF LIST

There are two types of list-

(1) Linear list

(2) Non-linear list

(1)Types of linear list (2)Types of non-linear

list

(a)Graph (a)Stacks

(b)Queues (b)trees


Recommended