Data Structures Lab Experiments VR-23 2025-26

Data Structures Lab Experiments

Exercise 1: Array Manipulation

1. Write a program to reverse an array.
2. C Programs to implement the Searching Techniques – Linear & Binary Search
3. C Programs to implement Sorting Techniques – Bubble, Selection and Insertion Sort

Download Exercise 1

Exercise 2: Linked List Implementation

1. Implement a singly linked list and perform insertion and deletion operations.
2. Develop a program to reverse a linked list iteratively and recursively.
3. Solve problems involving linked list traversal and manipulation.

Download Exercise 2

Exercise 3: Linked List Applications

1. Create a program to detect and remove duplicates from a linked list.
2. Implement a linked list to represent polynomials and perform addition.
3. Implement a double-ended queue (deque) with essential operations.

Download Exercise 3

Exercise 4: Double Linked List Implementation

1. Implement a doubly linked list and perform various operations to understand its properties and applications.
2. Implement a circular linked list and perform insertion, deletion, and traversal.

Download Exercise 4

Exercise 5: Stack Operations

1. Implement a stack using arrays and linked lists.
2. Write a program to evaluate a postfix expression using a stack.
3. Implement a program to check for balanced parentheses using a stack.

Download Exercise 5

Exercise 6: Queue Operations

1. Implement a queue using arrays and linked lists.
2. Develop a program to simulate a simple printer queue system.
3. Solve problems involving circular queues.

Download Exercise 6

Exercise 7: Stack and Queue Applications

1. Use a stack to evaluate an infix expression and convert it to postfix.
2. Create a program to determine whether a given string is a palindrome or not.
3. Implement a stack or queue to perform comparison and check for symmetry

Download Exercise 7

Exercise 8: Binary Search Tree

1. Implementing a BST using Linked List.
2. Traversing of BST.

Download Exercise 8

Exercise 9: Hashing

1. Implement a hash table with collision resolution techniques.
2. Write a program to implement a simple cache using hashing.

Download Exercise 9

Exercise 10: Graphs

1. Write a program to implement a graph using BFS
2. Write a program to implement a graph using DFS

Download Exercise 10

Textbooks

1. Data Structures and algorithm analysis in C, Mark Allen Weiss, Pearson, 2nd Edition.
2. Fundamentals of data structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, Silicon Press, 2008

Reference Books

1. Algorithms and Data Structures: The Basic Toolbox by Kurt Mehlhorn and Peter Sanders
2. C Data Structures and Algorithms by Alfred V. Aho, Jeffrey D. Ullman, and John E. Hopcroft
3. Problem Solving with Algorithms and Data Structures by Brad Miller and David Ranum
4. Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
5. Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms by Robert Sedgewick

Responsive colorful lab syllabus page

Share This:

Facebook

Twitter

Google Plus

Pinterest

Linkedin