types of data structure

-

Types of data structure.



1.       Primitive data structure.
In this data structure we can represent data with the help of basic data type/fundamental data type.
Eg:- int, float, char, double etc.

2.       Non-primitive data structure.
In this data structure we can represent data with the help of user define data type such as array, structure, union, class etc.
 Eg:-
        Struct student
       {
         Int rollnum;
         Char name[20];
       };
This data type can be classified into two parts.
Ø  Linear data structure.
Ø  Non-linear data structure.

Linear data structure.
In this data structure we represent data in linear mode/sequential mode.
Eg:- array, stack, queue, linked list etc.
This data type can be classified into two parts.
a.       Homogeneous data structure.
b.       Non-homogeneous data structure.
Homogeneous data structure.
It is a collection of same type of element.
Eg:- array.
      Non-homogeneous data structure.
It is a collection of  different type of element.
Eg:- structure, union, class.

Non-linear data structure.
In this data structure we can represent data in random order.
Eg:- tree, graph.


if you like my post plz subscribe my blog for next topic.

Comments

Post a Comment

Popular posts from this blog

python pattern programming

-
Image
PYTHON PATTERN PROGRAMMING Python nested loop: Python allow programmer to use nested loops.Nested loop means when one loop is define into another loop is known as nested loop,in which one is called inner loop and another is called outer loop.In which when outer loop's condition is true than inner loop will be execute. we use the concept of nested loop in pattern programming etc. syntax: while (condition):      while (condition):         statement x     statement y   Some examples of nested loop. Nested loop program. Q. write  a program to print following pattern. P P Y P Y T P Y T H P Y T H O P Y T H O N str = "PYTHON" for  i  in   range ( 0 , 6 ):      print ()      for  j  in   range ( 0 ,i+ 1 ):      ...
Read more

Stack

-
Image
  What is Stack? Stack is a linear data structure which ids used to store in LIFO order (LAST IN FIRST OUT) In this data structure insertion and deletion are performed only one position called TOP. its main objective to evaluate mathematical expression in different notation as prefix, postfix and infix. These are called polish notation. It is a big application of stack .It is also used in different algorithm as Tower of Hanoi, traversal of tree and recursive algorithm. Operation on stack PUSH-operation:- to insert element in stack. POP-operation:- to delete element in stack. Overflow:- full stack. Underflow:- empty stack. Representation of stack using array. In this representation we use one array variable which hold the value of stack and other variable is top that hold the index value. If stack is full/overflow then top must be insilized with (size-1). A stack is called underflow if top is assigned with -1 . in this case we can store limited element ...
Read more

What is function?What is function in python?

-
Image
Function in python What is function? What is function in python? Function is the most important tool in procedural programming language.A function can be defined as it is a block of statement which is used to perform any particular operation according to requirement.A function is a  block of organized and reusable program and code that perform a specific and as well as definite task.The main objective to create a function is to reduce the complexity of a program, in this case a program can be divided in to multiple parts according to requirement that part is called function or module. We can create user friendly program with the help of function in this case user can create separate function for each module  module according to requirement. It provide extensibility , it means program can be enhanced module wise in feature. it also provide reusable of program, it means a function can coll more than one times There are two types of function one predefined fu...
Read more