IT5412: Advanced Data Structures Laboratory Syllabus for IT 4th Sem 2019 Regulation Anna University

Advanced Data Structures Laboratory detailed syllabus for Information Technology (IT) for 2019 regulation curriculum has been taken from the Anna Universities official website and presented for the IT students. For course code, course name, number of credits for a course and other scheme related information, do visit full semester subjects post given below.

For Information Technology 4th Sem scheme and its subjects, do visit IT 4th Sem 2019 regulation scheme. The detailed syllabus of advanced data structures laboratory is as follows.

Course Objective:

• To understand the concepts of Object Oriented Programming.
• To use standard template library in the implementation of standard data structures.
• To learn advanced data structures using Object Oriented Programming (OOP) language.
• To explore graph structures and traversals using OOP concepts.
• To understand various graph algorithms using OOP concepts.

List of Experiments:

Implement the following exercises using C++:

1. Implementation of an Application (such as Library Management System) using Classes, Objects, Constructors, Destructors and String Handling.
2. Implementation of Programs using Function Overloading and Operator Overloading.
3. Implementation of an Application such as Student Information System using Inheritance, Virtual Functions and Abstract Classes.
4. Implementation of Programs using Function Templates and Class Templates.
5. Implementation of Stack, Queue and List Data Structures using STL Concepts.
6. Implementation of AVL tree using Templates.
7. Implementation of Splay Tree using Templates.
8. Implementation of a Heap tree using Templates.
9. Implementation of Graphs and Sorting of vertices using Topological Sort.
10. Implementation of Graph Traversals Algorithms: Breadth-First Search, Depth-First Search.
11. Implementation of Shortest Path Algorithms: Dijkstra”s algorithm, Bellman-Ford algorithm, Floyd-Warshall algorithm.
12. Implementation of Minimum Spanning Tree: Kruskal”s and Prim”s algorithm.

Course Outcome:

On completion of the course, the students will be able to:

1. Implement the basic and advanced concepts of object-oriented programming.
2. Solve the given problem using object oriented concepts.
3. Implement basic and advanced data structures through ADTs using OOP.
4. Analyze and apply the graph data structures for a real world problem.
5. Design and develop real time applications by applying suitable data structures and associated operations.
6. Design and develop efficient algorithms with data representations on their own based on the requirements.

For detailed syllabus of all other subjects of Information Technology, 2019 regulation curriculum do visit IT 4th Sem subject syllabuses for 2019 regulation.

For all Information Technology results, visit Anna University IT all semester results direct link.