GOVERNMENT ENGINEERING COLLEGE, PATAN
COMPUTER & SCIENCE DEPARTMENT
DATA STRUCTURE (2130702)
PRACTICAL LIST-2015
1. Introduction
to pointer. Call by Value and Call by reference.
2. Write
a program for stack that performs following operations using array.
(a) PUSH
(b) POP (c) PEEP (d) CHANGE
3. Write
a program to solve Tower of Hanoi Problem using recursion.
4. Write
a program to convert infix notation to postfix notation using stack.
5. Write
a program to implement QUEUE using array that performs following operations (a)
INSERT (b) DELETE
6. Write
a program to implement Circular Queue using array.
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) Delete a first node of the
linked list.
(d) Delete a node before specified
position.
8. Write
a program to implement stack using linked list.
9. Write
a program to implement operations on the doubly linked list.
10. Write a program to implement Quick Sort.
11. Write
a program to implement Merge Sort.
12. Write
a program to implement Bubble Sort.
13.
Write a program to implement Binary Search.
No comments:
Post a Comment