Data Structures Lab Internal and External programs Questions

[+] Post Title :

Data Structures Lab Internal and External programs Questions

[+] Date : Sunday, 20 October 2013
[+] Author : Prudhvi raj
[+] Type : assignments

There will be Lab internal exam during your lab sessions
The following are the programs for your lab internal exam

1.stack implementation
 2.queue implementation
3.infix to postfix using stack
 4.circular queue
 5.polynomial addition using arrays
 6.single linked list implementation
 7.double linked list implementation
 8.stack using linked list
9.queue using linked list
10.polynomial addition using linked list
 11.implementation of complete binary tree
12.implementation of Heap tree
13.Heap sort 14.Binary search tree implementation
15.Tree traversals

 The following are the programs for your LAB EXTERNAL EXAM … You should write the following programs in your records and observations … Make sure templates are used in records, where ever necessary …

1.stack implementation
 2.queue implementation
3.infix to postfix using stack
 4.circular queue
 5.polynomial addition using arrays
 6.single linked list implementation
 7.double linked list implementation
 8.stack using linked list
 9.queue using linked list
 10.polynomial addition using linked list
11.implementation of complete binary tree
12.implementation of Heap tree
13.Heap sort
 14.Binary search tree implementation
15.Tree traversals
 16.DFS
 17.BFS
 18.Insertion sort
19.Merge sort
 20.Quick sort
 21.Hashing