AJAY KUMAR GARG ENGINEERING COLLEGE, GHAZIABAD

DEPARTMENT OF INFORMATION TECHNOLOGY

Course: B.Tech. Semester-III Session:2023-24
Branch: IT/CSIT Subject Name/Code: Data Structure using ‘C ‘ Lab/ BCS351
Course Outcomes
At the end of the course, students will be able to:

C205.1 Implement various operations to be performed on arrays

C205.2 Explain and implement the operations on the linked list.

C205.3 Design and implement stacks using array and linked list.

C205.4 Design and implement queue and circular queue using array and linked list.

C205.5 Implement various searching and sorting techniques.

List of Experiments
1. Program to count total number of even, odd and prime numbers using array.
2. Program for Array Insertion, Deletion, and traversal.
3. Program for Merging of two Sorted Arrays.
4. Program for Set Union, Intersection and Difference operations using array.
5. Program for Matrix Addition, Subtraction and Multiplication.
6. Program for insert an element as first node, last node and node at a given position in Single Linked
List and then display the list.
7. Program for delete an element as first node, last node and node at a given position in Single Linked
List and then display the list.
8. Program to count the total number of nodes and reverse the given Single Linked List.
9. Program for insert an element as first node, last node and node at a given position in Circular Linked
List and then display the list.
10. Program for delete an element as first node, last node and node at a given position in Circular Linked
List and then display the list.
11. Program for insert an element as first node, last node and node at a given position in Doubly Linked
List and then display the list.
12. Program for delete an element as first node, last node and node at a given position in Doubly Linked
List and then display the list.
13. Program to perform polynomial addition using Single Linked List.
14. Program for Stack Primitive Operations using Array.
15. Program for Stack Primitive Operations using linked list.
16. Program to convert infix notation to postfix notation using stack.
17. Program to evaluate of postfix expression using stack.
18. Program to check balancing of parenthesis in an expression using stack.
19. Program for Ordinary Queue Primitive Operations using Array.
20. Program for Ordinary Queue Primitive Operations using linked list.
21. Program for Circular Queue Primitive Operations using Array.
22. Program for Linked List implementation of priority queue.
23. Program for Linear Search and Binary Search.
24. Program for implement Linear Probing in Hashing.
25. Program for Bubble sort, Selection Sort and Insertion Sort.
26. Program for Quick Sort.
 27. Program to implement Binary Search Tree and its traversal in preorder, post order and in order using
recursive approach.
28. Program to Search Largest node, smallest node and Count number of nodes in BST.
29. Program to implement Heap Sort using array.
30. Program to implement Graph traversal techniques BFS and DFS.

Additional Experiments:
31. Program for finding factorial of a given number using recursion and without recursion.
32. Program for Towers of Hanoi for n disk (user defined).
33. Program for Merge Sort.

Mr. Puneet Kumar Goyal

Ms. Priti Chaudhary
Mr. Madhup Agarwal Prof. Rahul Sharma
(Subject Faculty) (HOD, IT)