Data Structure practicals

Pratical-1: Introduction to pointers. Call by Value and Call by reference.

 

Pratical-2: Introduction to Dynamic Memory Allocation. DMA functions malloc(), calloc(), free(.

 

Pratical-3: Implement a program for stack that performs following operations using array. (a) PUSH (b) POP (c) PEEP (d) CHANGE (e) DISPLAY

 

Pratical-4: Implement a program to convert infix notation to postfix notation using stack.

 

 Pratical-5. Write a program to implement QUEUE using arrays that performs following operations (a)INSERT (b) DELETE (c) DISPLAY.

 

 Pratical-6. Write a program to implement Circular Queue using arrays that performs following operations. (a) INSERT (b) DELETE (c) DISPLAY.

 

Pratical-7: 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 (d) Delete a first node of the linked list. (e) Delete a node before specified position. (f) Delete a node after specified position.

 

Pratical-8. Write a program to implement stack using linked list.

 

Pratical-9: Write a program to implement queue using linked list.

 

Pratical-10. 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.

 

Pratical-11. Write a program to implement following operations on the circular linked list. (a) Insert a node at the end of the linked list. (b) Insert a node before specified position. (c) Delete a first node of the linked list. (d) Delete a node after specified position.

 

Pratical-12: Write program to implement Bubble Sort.

 

Pratical-13: Write a program to implement Binary Search.