Classified as simple and compound. Compound (mixture) data structure is further classified as linear and non linear. A data structure is said to be linear if its elements form a sequence(it needs contiguous memory location) otherwise it is called a non-linear data structure needs random memory)<\/p>\n
The examples of Linear data structures are stack, queue and linked list.
\n![\"Plus](\"https:\/\/www.aplustopper.com\/wp-content\/uploads\/2019\/06\/Plus-Two-Computer-Science-Notes-Chapter-3-Data-Structures-and-Operations-1.png\")
<\/p>\n
We know that memory is classified into two primary and secondary. Just like that data structures are classified as static and dynamic. Static data structure is associated with primary memory. The needed memory is allocated before the execution of the program and it is fixed through out the execution. Array is an example for this. In Dynamic data structure, memory is allocated during execution. Linked list is an example for this.<\/p>\n
Operations on data structures<\/span><\/p>\n Stack<\/span><\/p>\n A stack is a linear structure in which items can be added or removed only at one end called top. Add an item into the stack is called push and deleting an item from the stack is called pop.<\/p>\n The data structure that follows LIFO principle is known as stack. Example. CD pack, idly utensils, etc. Implementation of stack In a stack the values can be added or removed by at the top end only.Stack can be implemented using array. Initially the value of\u2018top\u2019is set to-1 to denote the stack is empty. Whenever a value is added to a stack top\u2019 is incremented by 1. The index of first element is 0 and the last Is N-1.<\/p>\n Operations on stack<\/span><\/p>\n a) Push operation: It is the process of inserting (adding) a new data item into the stack. If the stack is full and we try to add a new item into the stack makes the stack over flow.<\/p>\n b) Pop operation: It is the process of deleting (removing) a data item from the stack. If the stack is empty and we try to delete an item from the stack makes the stack underflow.<\/p>\n Queue<\/span><\/p>\n The working principle of a Queue is First In First Out(FIFO) manner. A new data item is added at the rear and removed from the front of a Queue. Examples Queue in a Cinema theater, poling station etc. Implementation of Queue A new data item is added at the rear and removed from the front of a Queue.Queue can be implemented using array. Initially the value of front and rearisset to -1 to denote the queue is empty. Whenever a value is added to a queue the rear is incremented by 1. Similarly on each deletion the value of front will be incremented by, until it crosses the value of rear.<\/p>\n Operation on Queue<\/span><\/p>\n a) Insertion operation: It is the process of adding a new item into a queue at the rear end. If the queue is full and we try to add a new item into thequeue makes the queue overflow.<\/p>\n b) Deletion operation: It is the process of deleting (removing) a data item from the queue from the front. If the queu is empty and we try to delete an item from the queue makes the queue underflow.<\/p>\n Circular queue<\/span><\/p>\n As the name implies logically the shape of the circular queue is a shape of a circle. The linear queue has some limitations such as some occasions the capacity of the linear queue cannot be used fully. The limitation of linear queue can overcome by circular queue. Circular queue is a queue in which the two end points are connected<\/p>\n Linked List<\/span><\/p>\n Stack and queue are implemented by array and has the fixed storage capacity. That is these implementation are static. But linked list follows the dynamic data structure method. It grows and shrinks as and when the new items are added and removed respectively. Not only that an array requires contiguous memory but linked list not require contiguous memory rather it uses scattered memory and they linked by pointers. So an element in a linked list consists of data and an address it is called node. Here address is the link.<\/p>\n Linked list is a collection of nodes. The first node contains the data and address of next node. The second node contains the data and the address of next node and so on. The last node contains the last data and a null pointer.<\/p>\n Implementation of linked list Example The special pointer start that points to the first node is created by as follows node \u2018start;<\/p>\n Operations on linked list<\/span><\/p>\n a) Creation of linked list: Linked list can be implemented by self referential structure. b) Traversing a linked list: Traversing is the process of reading all elements in a data structure. c) Insertion in a linked list Insertion is the process of adding new node to a data structure. d) Deletion from a linked list Kerala Plus Two Computer Science Notes Chapter 3 Data Structures and Operations It is a particular way of organizing similar or dissimilar logically related data items into a single unit. Classification of data structures Classified as simple and compound. Compound (mixture) data structure is further classified as linear and non linear. A data structure is […]<\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_genesis_hide_title":false,"_genesis_hide_breadcrumbs":false,"_genesis_hide_singular_image":false,"_genesis_hide_footer_widgets":false,"_genesis_custom_body_class":"","_genesis_custom_post_class":"","_genesis_layout":"","footnotes":""},"categories":[42728],"tags":[],"yoast_head":"\n\n
\nA node consists of data and address of the next node. The address is a pointer. To implement this self referential structure is used since structure consist s of different types of data.<\/p>\n
\nstruct node<\/p>\n{\r\nint data; \r\nnode *link;\r\n};<\/pre>\n
\nStep 1 : Create a node and obtain its address.
\nStep 2 : Store data and NULL in the node.
\nStep 3 : If it is the first node, store its address in Start.
\nStep 4 : If it is not the first node, store its address in the link part of the node.
\nStep 5 :’ Repeat the steps 1 to 4.<\/p>\n
\nStep 1 : Get the address of the first node and store it in the variable Temp.
\nStep 2 : Using the address jn Temp, get and store the data in Val.
\nStep 3 : The address of the next node store it in Temp.
\nStep 4: If the address of Temp is not null go to step 2, otherwise stop.<\/p>\n
\nStep 1: Create a node and store its address in Temp.
\nStep 2 : Store the data and link part of this new node using Temp.
\nStep 3 : Get the address of the previous node (POS-1) and next node(POS+1) inthe pointers PreNode and PostNode respectively.
\nStep 4 : Copy the contents of Temp into the link part of node at position (POS-1). .
\nStep5 : Copy the contents of PostNode into the link part of new node that is pointed to by Temp.<\/p>\n
\nIt is the removal of a node from the data structure.
\nStep 1 : Get the address of the previous node (POS-1) and next node(POS+1) in the pointers PreNode and PostNode respectively.
\nStep 2 : Copy the contents of PostNode into the link part of node at position (POS-1).
\nStep 3: Free the node at position POS.<\/p>\nPlus Two Computer Science Notes<\/a><\/h4>\n","protected":false},"excerpt":{"rendered":"