DATA STRUCTURE IN C LANGUAGE
8 likes555 views
This document provides an overview of different data structures. It discusses primitive data structures like integers, floats, characters, and pointers. It also describes non-primitive linear data structures like arrays, stacks, queues, and linked lists. Finally, it covers non-linear data structures of trees and graphs. Linear data structures store elements in a sequence while non-linear structures do not follow a specific sequence. Trees and graphs are commonly used to represent hierarchical and network relationships between data.
![ARRAY
An array is the collection of similar data type or as a set
of finite homogenous element or data item.
It means an array contains one type of data only either
integer or floating number or character.
Syntex:
Example: int a[5]; char name[20];
Data type array_name[size];](https://image.slidesharecdn.com/topic-190331133943/85/DATA-STRUCTURE-IN-C-LANGUAGE-12-320.jpg)
DATA STRUCTURE IN C LANGUAGE
- 1. Presented by : SHUBHAM SINGH BCA FINAL YEAR VIVEK COLLEGE OF EDUCATION, BIJNOR
- 2. DATA STRUCTURE A data structure is a mathematical or logical model of particular organization of data. A data structure is a way of organization of data items , that consider not only the data elements stored but also there relationship to each other.
- 3. Types of data structure Data structure Primitive data structure Integer Float Char pointer Non-primitive data structure Linear data structure Array Stack Queue Linked list Non linear data structure Tree Graph
- 4. Primitive data structure There are basic structure and directly operated upon by the machine . For eg :- integer , float, pointer, character .
- 6. Integer The number without any decimal point is known as integer. They are also known as whole number. They occupies 2 bytes space in computer memory. Example : 12, 15, 45, etc. Syntex : For example : int a=10; int variable_name=constant;
- 7. char The single character is known as integer. They Always written in single inverted comma(‘ ‘). They occupies 1 byte space in computer memory. Example : ‘a’, ‘b’, ‘A’, etc. Syntex : For example: char alpha=‘A’; char variable_name=‘ character’ ;
- 8. float The number with any decimal point is known as float number. They are with the decimal( . ). They occupies 4 bytes space in computer memory. Example : 12.5, 15.78, 45.547, etc. Syntex : For example: float a=25.1; float variable_name = floating constant ;
- 9. Pointer Pointer is the variable that can hold the address of any variable. It is point on the that variable which address it can hold itself. It is declare using the astrict(*) sign. Syntex : For example: int *a; DATATYPE *VARIABLENAME;
- 10. Non- primitive data structure These are derived from primitive data structure . It is divided into two parts:- 1) Linear data structure 2) Non-linear data structure
- 11. Linear data structure In this type of data structure all the elements are stored in a particular sequence. It is also called sequential data structure. Linear data structure are of four types :- 1) Array 2) Stack 3) Queue 4) Link list
- 12. ARRAY An array is the collection of similar data type or as a set of finite homogenous element or data item. It means an array contains one type of data only either integer or floating number or character. Syntex: Example: int a[5]; char name[20]; Data type array_name[size];
- 13. STACK A stack is a linear data structure. A stack is also called ordered collection of element like array. It works on the concept of “LAST IN FIRST OUT”(LIFO) with two operations can be perform i.e. insertion and deletion. Inserting of element into stack is called PUSH . Deletion of element from stack is called POP.
- 14. 10(T) 20(T) 10 30(T) 20 10 40(T) 30 20 10 50(T) 40 30 20 10 50(T) 40 30 20 10 40(T) 30 20 10 30(T) 20 10 20(T) 10 10(T) INSERTION OR PUSH DELETION OR POP Empty stack Empty stack
- 15. QUEUE • A queue is a linear list of element in which deletion can take place only at the one end called FRONT, and insertion can take place only at the other end called REAR. • It works on the “FIRST IN FIRST OUT”(FIFO). • Since the first element in a queue will be the first element out of the queue. • In other word the order in which element enter a queue in the same order which they need.
- 16. FRONT REAR 10 F 20 30 40 R 10 F 20 30 R 10 F 20 R 10 F, R 40 F, R 30 F 40 R 20 F 30 40 R 10 F 20 30 40 R INSERTION DELETION
- 17. LINKED LIST A linked list or a one way list is a linear collection of data element called nodes. Each node is divided into two parts, the first part contain the information of the element and the second part called the linked fields or next pointer field contain the next node in the list. INFO NEXT NODE
- 18. EXAMPLE: BBA 2 BCA 9 MCA X 5 NO. INFO NEXT 1 2 BCA 9 3 4 5 BBA 2 6 7 8 9 MCA
- 19. NON LINEAR DATASTRUCTURE In this type of data structure all the elements are not stored in a particular sequence. In non linear data structure we have two types- 1) Tree 2) Graph
- 20. TREE • Tree is a non primitive and non linear data structure in which items are arranged in a sorted sequence. • This data structure is used to represent a hierarchical relationship adjusting among several data items. • A tree is a finite set of data element or nodes such that there is a special item known as ‘root’ of the tree. • A graphical representation of tree is given as-
- 21. A ED B C ROOT
- 22. GRAPH A graph may be represented as a collection of vertices and edges. Mathematically we can define a graph G as a collection of two sets which are referred as the vertex set and the edge set. Where V(G) is a finite end non empty set of vertices and E(G) represent the finite set of edges. G=V(G) U E(G)