Page 126 - IT_Bulletin
P. 126
DATA STRUCTURE AND ALGORITHMS
LIST OF EXPERIMENT
S.NO. EXPERIMENT CO LO
1. LO-3
Program to swap values of two variables by CO-1
2. passing pointers.
LO-2
Program to display information (name, roll no,
cgpa etc) of students in a class using structure. LO-3
3. Program to search an item from ‘n’ different CO-2
items using LO-4
i)Linear Search
ii)Binary Search
LO-3
4. Program to sort ‘n’ real numbers using bubble
sort sorting technique.
OR
Program to sort ‘n’ real numbers using
insertion sort sorting technique.
OR
Program to sort ‘n’ students according to their
height.
5. i)Program to insert roll_no/name of 9 students CO-3
into linked list in which first 5 will be linearly
inserted at the end of list, next 3 will be
inserted at the beginning of list and last student
inserted at the middle of list.
ii)Write a program to perform PUSH and POP
operations on Stack.
iii)Program to implement Simple Queue.
6. i)Write a program to Traverse Binary Tree CO-4
using i) In-Order ii) Pre-Order and iii) Post-
Order Traversal Techniques.
ii)Write a program to traverse a Graph using
i) BFS ii) DFS
DATA STRUCTURE AND ALGORITHMS
LIST OF EXPERIMENT
S.NO. EXPERIMENT CO LO
1. LO-3
Program to swap values of two variables by CO-1
2. passing pointers.
LO-2
Program to display information (name, roll no,
cgpa etc) of students in a class using structure. LO-3
3. Program to search an item from ‘n’ different CO-2
items using LO-4
i)Linear Search
ii)Binary Search
LO-3
4. Program to sort ‘n’ real numbers using bubble
sort sorting technique.
OR
Program to sort ‘n’ real numbers using
insertion sort sorting technique.
OR
Program to sort ‘n’ students according to their
height.
5. i)Program to insert roll_no/name of 9 students CO-3
into linked list in which first 5 will be linearly
inserted at the end of list, next 3 will be
inserted at the beginning of list and last student
inserted at the middle of list.
ii)Write a program to perform PUSH and POP
operations on Stack.
iii)Program to implement Simple Queue.
6. i)Write a program to Traverse Binary Tree CO-4
using i) In-Order ii) Pre-Order and iii) Post-
Order Traversal Techniques.
ii)Write a program to traverse a Graph using
i) BFS ii) DFS
DATA STRUCTURE AND ALGORITHMS