R24- Syllabus of ECE-GVPW(A) w.e.f.
2024-25
DATA STRUCTURES LAB
II Year B. Tech. I semester
[Common to CSE, CSE (AI&ML), IT, ECE]
L T P C
Course Code: 24CT11RC14 0 0 3 1.5
Course Outcomes: At the end of the Course, the student shall be able to
CO1: Apply different Searching and Sorting Techniques using arrays. (L3)
CO2: Experiment with different linear data structure concepts using stacks and Queues. (L3)
CO3: Develop linear data structure models using various Linked lists. (L3)
CO4: Build Binary Search Tree & AVL tree and examine their traversals. (L3)
CO5: Apply DFS and BFS graph traversal techniques. (L3)
Implement the following programs with either C/C++/JAVA/Python
Module-1: Searching
1. Write a program that use non recursive functions to perform linear search for a Key value in a given
list.
2. Write a program that use non recursive functions to perform Binary search for a Key value in a given
list.
Module-2: Sorting
1. Write a program that implement Bubble sort, to sort a given list of integers in ascending order.
2. Write a program that implement Selection sort, to sort a given list of integers in ascending order.
3. Write a program that implement Insertion sort, to sort a given list of integers in ascending order.
Module-3: Efficient Sorting
1. Write a program that implement Quick sort, to sort a given list of integers in ascending order.
Module-4: Stack & Queue
1. Write a program that implement stack (its operations) using arrays.
2. Write a program that implement Queue (its operations) using arrays.
Module-5: Singly Linked List
1. Write a program that uses functions to create and perform operations on singly linked list.
Module-6: Double Linked List
1. Write a program that uses functions to create and perform operations on double linked list.
Page 12 of 43
R24- Syllabus of ECE-GVPW(A) w.e.f.2024-25
Module-7: Circular Linked List
1. Write a program that uses functions to create and perform operations on circular linked list.
Module-8: Binary Search Trees
1. Write a program to Create a Binary Search Tree and Perform insertion and deletion operations.
Module 9: AVL tree
1. Write a program to Build an AVL tree and perform insertions.
Module-10: Graphs
1. Write a program to implement Depth First Search
2. Write a program to implement Breadth First Search
Case Study: Select any five practical applications mentioned below
Note: A report has to be submitted by every student at the end of the semester that includes requirements,
design, coding, and output with testing results of a real example.
1. Demonstrate to convert an infix expression into a postfix expression and evaluate to find the result.
2. Demonstrate to convert an infix expression into a prefix expression
3. Demonstrate a queue using Linked List and Stack.
4. Demonstrate a sparse matrix using array and linked list
5. Create a skip list, to insert these following keys in the empty skip list.
a. 6 with level 1.
b. 29 with level 1.
c. 22 with level 4.
d. 9 with level 3.
e. 17 with level 1.
f. 4 with level 2.
Implement all basic operations of skip list and demonstrate with examples. Skip list structure is shown
below for reference.
Page 13 of 43
R24- Syllabus of ECE-GVPW(A) w.e.f.2024-25
6. Given an array representation of min Heap, convert it to max Heap and then apply Heapsort concept
to display the data in decreasing order.
Input: arr[ ] = {3, 5, 9, 6, 8, 20, 10, 12, 18, 9}
7. Make use of Radix sort algorithm to sort an array by individual digits, starting with the least significant
digit.
8. Model a linked list data structure to add two polynomials.
9. Design a system to manage employee records {empID, empname, dept, salary}, and implement
efficient basic operations based on employee ID.
10. Construct an expression tree i.e. a binary tree in which each internal node corresponds to the operator
and each leaf node corresponds to the operand.
For example: expression tree for 3 + ((5+9)*2) would be: Demonstrate with required operations to
convert this above expression into corresponding prefix, and postfix expressions and evaluate the result
of the expression.
11. Demonstrate topological sorting for a Directed Acyclic Graph (DAG) is a linear ordering of vertices
such that for every directed edge u-v, vertex u comes before v in the increasing order a vertex with no.
of incoming edges.
12. Given a directed graph, check whether the graph contains a cycle or not. Your function should return
true if the given graph contains at least one cycle, else return false. For example, the following graph
contains two cycles 0->1->2->3->0 and 2->4->2. Demonstrate with required operations to display the
results in the form of true and the cyclic path if any. Make use of BFA concept to solve this problem.
Page 14 of 43
R24- Syllabus of ECE-GVPW(A) w.e.f.2024-25
13. Find the frequency of each character in a string using Hashing Data Structure
Page 15 of 43
