Data Structure

-

       Data Structure



Data Structure :
                                
Data Structure is the way of organising representing & processing the data stored as a single unit in memory. For example, a record in a film can have several fields of different data types and entire record may be required to be processed in one unit. In such a case Data Structures can be beneficial  as Data Structure let us combine data of different data types and process them together.
 
   So we can say "A data structure is a named group of data of different data types which can be processed as a single unit" .
        We can also say that the logical or mathematical model which defines a particular organisation of data is known as data structure.The study of such data structure involves the following steps -

 1.Logical or mathematical description of the data structure.

2. Implementation of the data structure in the computer memory.














Classification of Data Structures :

Data structures are very important in a computer system, as these not only allow the user to combine various data types in a group but also allow processing of the group as a single unit thereby making things much simpler and easier . The data can be classified into following two types -
   

1. Simple Data Structures : These 

                                                          Data structures are normally built from primitive data types like Integers,reals, characters,and boolean. Following data structures can be termed as simple data structures -
 
1. Array and
2. Structure

2. Compound Data Structures : 

                                Simple data structures can be combined in various ways to form more complex Structures called compound data structures. Compound data structures are classified into following two types -

1. Linear Data Structures : 

                                                        These data structures are single level data structures. A data structure is said to be linear when it's elements form a sequence. Following are the examples of linear data structures -

(a) Stack
(b) Queue
(c)Linked List

2. Non-Linear Data Structure : 

                            These are multilevel data structures. Examples of non-linear data structure is Tree and Graph .




              Another way of classifying data structure is as follows-

1. Homogeneous and Non-homogeneous : 

     Homogeneous data structure all element are of same type in non- homogeneous Data Structure all elements may or may not be of the same type .

2. Static and Dynamic : 

   Static data structures are those whose size and associated memory location are fixed at the time of compilation. Dynamic data structures are those whose size may decrease or increase while program execution of program.


        



Thank You...                

Comments

Post a Comment

Hello Friends,

Popular posts from this blog

Array Declaration

-
Image
Array Declaration Declaration is an important process for a variable so that the compiler will know what kind of variable , containing which type of value and of what size is required by the user .         Therefore , an array is also declared as other variables. In declaration we provides the name and the size of array. Syntax of array declaration is as follows : -            Int - N  [a]; Int : Type of Data N : Name of Variable [a] : Size of Length Type of Data or data type defines the type or category of element's can be stored in the arrays . Like - int type only store number's, Name (n) specifies the name of array or variable. [a] Size or Length specifies the capacity of storing elements. Like [10] means it can only store 10 elements. For example -                  int N [10]. In the above example, the name of array is N and it can accept only 10 integer (number) type of el...
Read more

Data Structure and C

-
Image
  Data Structure and C A C programmer can think of the C language as defining a new machine with  its own capabilities , data types and types and operations . the user can state a problem solution in terms of the more useful C constructers. Thus , problem can be solved more easily because a larger set of tools is available in C. The study of data structure therefore involves two complementary goals. The first goal is to identify  and develop useful mathematical entities and operations and to determine what classes of problems  can be solved by using these entities and operations  The second goal is to determine representation for those abstract entities and to implement the abstract operations on these concrete  representation . The first of these goals views a high-level data types as a tool that can be used to solve other problems and the second views the implementation of such a data type as a problem to be solved using already existing data types . In d...
Read more

Description of Various Data Structures

-
Image
Description Of Various Data Structures : 1. Arrays :            An array can be defined as a set of finite numbe r of homogeneous elements  or data items. It means an array can contain one type only, either all Integers, all floating-point numbers or all characters. Declaration of arrays is as follows :-                          int a[10]; Where int specifies the data types or type of elements array stores. "a" is the name of arry and the number specified inside the square brackets is the number of elements an array can store. This is also called size or length of array. Following are some of the points to be remembered about arrays - 1. The individual elements of an array can be accessed by specifying name of the array , followed by index or subscript (which is an integer number specifying the location of element in the array) inside square brackets.      For example to ac...
Read more