AKTU Data Structure Lab (BCS351) Syllabus PDF – B.Tech 2nd Year

List of Experiments

1. Implementing Sorting Techniques: Bubble Sort, Insertion Sort, Selection Sort, Shell , Sort, Radix Sort, Quick sort
2. Implementing Searching and Hashing Techniques: Linear search, Binary search, Methods for Hashing: Modulo Division, Digit Extraction, Fold shift, Fold Boundary, Linear Probe for Collision Resolution. Direct and Subtraction hashing
3. Implementing Stacks: Array implementation, Linked List implementation, Evaluation of postfix expression and balancing of parenthesis, Conversion of infix notation to postfix notation
4. Implementing Queue: Linked List implementation of ordinary queue, Array implementation of circular queue, Linked List implementation of priority queue, Double ended queue
5. Implementing Linked List: Singly Linked Lists, Circular Linked List, Doubly Linked Lists: Insert, Display, Delete, Search, Count, Reverse (SLL), Polynomial, Addition, Comparative study of arrays and linked list
6. Implementing Trees: Binary search tree: Create, Recursive traversal: preorder, post order, in order, Search Largest, Node, Smallest Node, Count number of nodes, Heap: Min Heap, Max Heap: reheap Up, reheap Down, Delete, Expression Tree, Heapsort
7. Implementing Graphs: Represent a graph using the Adjacency Matrix, BFS, Find the minimum spanning tree (using any method Kruskal’s Algorithm or Prim’s Algorithm) Self Learning Topics: Shortest Path Algorithm