Syllabus CS1204 – DATA STRUCTURES LABORATORY

ANNA UNIVERSITY TIRUCHIRAPPALLI
Tiruchirappalli - 620 024 Regulations 2007
Syllabus B.TECH. INFORMATION TECHNOLOGY SEMSETER III
CS1204 – DATA STRUCTURES LABORATORY

Implement the following exercises using C
1. Array Implementation of List ADT
2. Linked List Implementation of List ADT
3. Cursor Implementation of List ADT
4. Array Implementation of Stack ADT
5. Linked List Implementation of Stack ADT
6. The following three exercises are to be done by implementing the following source files
(a) Program for ‘Balanced Paranthesis’
(b) Array Implementation of Stack ADT
(c) Linked List Implementation of Stack ADT
(d) Program for ‘Evaluating Postfix Expressions’
An appropriate header file for the Stack ADT should be included in (a) and (d)
I. Implement the application for checking ‘Balanced Paranthesis’ using array
implementation of Stack ADT (by implementing files (a) and (b) given above)
II. Implement the application for checking ‘Balanced Paranthesis’ using linked list
implementation of Stack ADT (by using file (a) from experiment 1 and implementing
file (c))
III. Implement the application for ‘Evaluating Postfix Expressions’ using array and linked
list implementations of Stack ADT (by implementing file (d) and using file (b) - and
then by using files (d) and (c))
7. Queue ADT
8. Search Tree ADT – Binary Search Tree
9. Heap Sort
10. Quick Sort
Total: 45

FEEL USEFUL PLEASE GIVE +1