|
Data Structures Lab |
| 1a | Stack program | |
| 1b | Evaluation of postfix |
|
| 2 | Conversion to Postfix |
|
| 3 | Conversion to Prefix | |
| 4a | Ordinary Queue |
|
| 4b | Priority Queue |
|
| 5 | Circular Queue |
|
| 6 | Singly linked list of Jobs |
|
| 7 | Dequeue |
|
| 8 | Ordered lists |
|
| 9 | Addition of long integers |
|
| 10 | Doubly linked list |
|
| 11 | Priority Queue using Binary search tree |
|
| 12 | Binary search tree |
|
| 13 | Expression tree |
|
| 14 | Sparse matrix |
|
| 15a | Quick sort |
|
| 15b | Towers of Hanoi |
|
The entire collection at one click
Compiling :(under linux/unix)
$ cc <file-name>
$ ./a.out