Ds list of experiments ce
- 1. ALPHA COLLEGE OF ENGINEERING & TECHNOLOGY LIST OF EXPERIMENTS SUBJECT NAME: DS SUB CODE: 2130702 SR. NO. TITLE . a) Introduction to pointers. Call by Value and Call by reference. b) Introduction to Dynamic Memory Allocation. DMA functions malloc(), calloc(), free() etc. 2. Implement a program for stack that performs following operations using array. (a) PUSH (b) POP (c) PEEP (d) CHANGE (e) DISPLAY 3. Implement a program to convert infix notation to postfix notation using stack. 4. A) Write a program to implement QUEUE using arrays that performs following operations (a) INSERT (b) 1DELETE (c) DISPLAY B) Write a program to implement Circular Queue using arrays that performs following operations. (a) INSERT (b) DELETE (c) DISPLAY 5. 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 ascending order.(according to info. Field) (d) Delete a first node of the linked list. (e) Delete a node before specified position. (f) Delete a node after specified position. 6. Write a program to implement stack and queue using linked list. 7. 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. 8. Write a program which create binary search tree. Implement tree traversing methods.
- 2. 9. Write a program to implement following searching methods a) Linear Search. b) Binary Search. 10. Write a program to implement following sorting methods a) Bubble Sort b) Merge Sort c) Queue Sort