### Data Structure(DS) Practical Solution

#### LIST OF PRACTICALS

 Sr. Practical Title Answer 1 Introduction to pointers. Call by Value and Call by reference. Solution 2 Introduction to Dynamic Memory Allocation. DMA functions malloc(), calloc(),free() etc. Solution 3 Implement a program for stack that performs following operations using array. (a) PUSH (b) POP (c) PEEP (d) CHANGE (e) DISPLAY Solution 4 Implement a program to convert infix notation to postfix notation using stack. Solution 5 Write a program to implement Queue using arrays that performs following operations. (a) INSERT (b) DELETE (c) DISPLAY Solution 6 Write a program to implement Circular Queue using arrays that performs following operations. (a) INSERT(b) DELETE(c) DISPLAY Solution 7 Write an program for insert routine in input restricted dequeues. Solution 8 Write a menu driven program to implement following operations on the singly linked list. (a) Insert a node at the front of the linked list. (b) Insert a node at the end of the linked list. (c) Insert a node such that linked list is in asending order. (d) Delete a First node of the linked list. (e) Delete a node before specified position. (f) Delete a node after specified position. Solution 9 Write a program to implement following operations on the doubly linked list. (a) Insert a node at the front of the linked list. (b) Insert a node at the end of the linked list. (c) Delete a last node of the linked list. (d) Delete a node before specified position. Solution 10 Write a program to concatenate two doubly linked lists. Solution 11 Implement recursive and non-recursive tree traversing methods in-order, preorder and post-order traversal. Solution 12 Write a program to implement Queue Sort Solution 13 Write a program to implement Merge Sort Solution 14 Write a program to implement Bubble Sort Solution 15 Write a program to implement Binary Search. Solution