204 Data Structures Lab Index
204 Data Structures Lab Index
Applications
MCA
II SEMESTER
DIRECTOR
SCHOOL OF DISTANCE EDUCATION
ANDHRA UNIVERSITY, VISAKHAPATNAM - 3
iii
CONTENTS
Lesson No NAME OF THE LESSON Page No.
1. Introduction 1
2. Stacks 5
3. Evaluation of Postfix Expression 19
4. Conversion of Infix to Postfix 25
5. Conversion of Postfix to Prefix and Infix Notations 35
6. Queues 43
7. Circular Queues 53
8. Priority Queues 59
9. Doubly Ended Queues (DEQUEUES) 61
10. Linked Lists 69
11. Doubly Linked Lists 85
12. Circularly Linked Lists 93
13. Recursion 99
14. Trees 105
15. Binary Trees 111
16. Tree Traversals 117
17. Binary Search Trees 125
18. Sequential Search 139
19. Binary Search 141
20. Interpolation Search 145
21. Representation of Graphs and their Traversals 151
22. Warshall’s Algorithm 159
23. Minimum Spanning Trees and Prim’s Algorithm 163
24. Bubble Sort 171
25. Quick Sort 175
26. Sorting Random Numbers Using Quick Sort 179
27. Merge Sort 183
28. Heap Sort 189
29. Application of Data Structures - Text Editor 201
30. Application of Data Structures - Magic Squares 205