0% found this document useful (0 votes)
6 views

204 Data Structures Lab Index

This document is a course material for the Data Structures Lab, part of the Master of Computer Applications program at Andhra University. It includes a comprehensive list of lessons covering various data structure topics such as stacks, queues, trees, and sorting algorithms. The material is prepared by Prof. P. S. Avadhani and coordinated by Dr. G. Samuel Vara Prasad Raju.

Uploaded by

aanandhvenkat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views

204 Data Structures Lab Index

This document is a course material for the Data Structures Lab, part of the Master of Computer Applications program at Andhra University. It includes a comprehensive list of lessons covering various data structure topics such as stacks, queues, trees, and sorting algorithms. The material is prepared by Prof. P. S. Avadhani and coordinated by Dr. G. Samuel Vara Prasad Raju.

Uploaded by

aanandhvenkat
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Master of Computer

Applications
MCA

II SEMESTER

204 – Data Structures Lab

SCHOOL OF DISTANCE EDUCATION


ANDHRA UNIVERSITY
VISAKHAPATNAM - 530 003
All copyrights and privileges reserved by the School of Distance
Education. No part of the publication may be reproduced in any
form without the prior permission of the copyright owner.
Information relating to various courses may be obtained from the
office of the School of Distance Education, Andhra university,
Visakhapatnam - 530 003.

DIRECTOR
SCHOOL OF DISTANCE EDUCATION
ANDHRA UNIVERSITY, VISAKHAPATNAM - 3

SCHOOL OF DISTANCE EDUCATION


ANDHRA UNIVERSITY
VISAKHAPATNAM
Course Material Preparation Team
Name of the Author Practical. Nos.

Prof. P. S. Avadhani 1-30


Dept of Computer Science & Systems Engineering
AU College of Engineering, Visakhapatnam.

Course Co-ordinator & Editor

Dr. G. Samuel Vara Prasad Raju


Asst. Professor of Computer Science
School of Distance Education
Andhra University
Visakhapatnam

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

You might also like