A
LAB FILE
ON
DATA STRUCTURE USING C
(COURSE CODE: CSIT-124)
Submitted By: Submitted To:
Name: Ms. Twinkle Tiwari
Enrollment No. Assistant Professor
Class & Section: CSE Department
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
AMITY SCHOOL OF ENGINEERING AND TECHNOLOGY
AMITY UNIVERSITY UTTAR PRADESH, NOIDA
SESSION: ODD SEM. (2024-25)
INDEX
Student Name: Enrollment No.
SR. NO. EXPERIMENT NAME DATE PAGE NO. SIGNATURE
1 Program on traversing & searching an
element in the array.
2 Write a program to insert a new element in the
given unsorted array at kth position.
3 Write a program to delete an element from
given sorted array.
4 Write a program to merge two given sorted
arrays.
5 Write a program to implement Stack using
array. Also show overflow and underflow in
respective push and pop operations.
6 Write a program to convert infix to postfix
expression.
7 Write a program to implement Queue using
array, which shows insertion and deletion
operations.
8 Write a program to implement Circular Queue
using array, which shows insertion and
deletion operations.
9 Write a program to implement Linear Linked
List, showing all the operations, like creation,
display, insertion, deletion and searching.
10 Write a program to count the number of times
an item is present in a linked list.
11 Write a program to increment the data part of
every node present in a linked list by 10.
Display the data both before incriminationand
after incrimination.
12 Write a program to implement Doubly Linked
List, showing all the operations, like creation,
display, insertion, deletion and searching.
Faculty Signature
(Ms. Twinkle Tiwari)
INDEX
Student Name: Enrollment No.
SR. NO. EXPERIMENT NAME DATE PAGE NO. SIGNATURE
13 Write a program to implement Stack, using
Linked List. Implement Push, Pop and display
operations.
14 Write a program to implement Queue, using
Linked List. Implement insertion, deletion
and display operations.
15 Write a program to create a Binary Search
Tree and display its contents using recursive
preorder, postorder and inorder traversal.
16 Write a program to implement deletion of a
node in binary search tree.
17 Write a program to implement Binary tree and
display the contents using non-recursive
preorder, postorder and inorder traversal
techniques.
18 Write a program to sort the given array using
Bubble Sort. Write a program to sort the given
array using Selection Sort.
19 Write a program to sort the given array using
Insertion Sort. Write a program to sort the
given array using Quick Sort.
20 Write a program to sort the given array using
Merge Sort.
21 Write a program to sort the given array using
Heap Sort.
22 Write a program of Graph traversal - Depth
first search.
23 Write a program of Graph traversal - Breadth
first search.
Faculty Signature
(Ms. Twinkle Tiwari)
