Data Structures and Algorithms -II LAB Table of Contents 1. Assignment : 1. Binary Search Tree and Traversals 1.1 Static Representation of Binary Tree 1.2 Dynamic Representation of Binary Tree 1.3 Binary Tree Traversals (Static) 1.4 Creating User Defined Library in C 1.5. Create BST Library ( Set A a) SPPU) 1.6 Counting Nodes in BST Set A b) SPPU 1.7 Copy and Compare BST Set B (a) SPPU 1.8 Sum odd and even number in BST Set C (a) SPPU 2. Assignment 2. Binary Tree Applications. 2.1 Counting Nodes By Level in BST. ( Set A a) SPPU 2.2 Heapsort Algorithm in C. ( Set B a)) SPPU 3. Assignment 3. Graph as Adjacency Matrix. 3.1 Adjacency matrix representation of Graph. (Set A a.) SPPU. 3.2 Program to Print degree of Graph. (Set A b) SPPU. 3.3 Adjacency Matrix BFS traversal. Set B (a) SPPU. 3.4 Adjacency Matrix DFS traversal. Set B (b) SPPU. 4. Assignment 4. Adjacency List representation of graph. 4.1 Adjacency List representation of Graph ( Set A a) SPPU. 4.2 Program to count degrees of Graph ( Set A b) SPPU 4.3 Adjacency List BFS traversal ( Set B (a) SPPU 4.4 Adjacency List DFS traversal ( Set B (b) SPPU 5. Assignment 5. Graph Applications.-I 5.1 Topological Sorting (Set A a.) SPPU. 5.2 Prim's Algorithm fro Spanning Tree 5.3 Kruskal's Algorithm for Spanning Tree 6. Graph Applications.-II 6.1 Dijkstra's Algorithm for Shortest Path Problem. 6.2. Floyd-Warshall's Algorithm for Shorted Path Problem. Practical Exam Slips with solutions.
