Data Structures and Algorithms Lab Using C

Course code LC-CSE-213G

Category Professional Core Course
Course tle Data Structures and Algorithms Lab Using C
Credi
Scheme and L T P
ts Semester-3
Credits
0 0 4 2
Branches (B. Tech.) Computer Science and Engineering
Class work 25 Marks
Exam 25 Marks
Total 50 Marks
Dura on of Exam 03 Hours

Data Structures Lab List of prac cal exercises, to be implemented using object-oriented
approach in C++ Language.
1. Write a menu driven program that implements following opera ons (using separate
func ons) on a linear array:
• Insert a new element at end as well as at a given posi on
• Delete an element from a given whose value is given or whose posi on is given
• To nd the loca on of a given element
• To display the elements of the linear array
2. Write a menu driven program that maintains a linear linked list whose elements are
stored in on ascending order and implements the following opera ons (using separate
func ons):
• Insert a new element
• Delete an exis ng element
• Search an element
• Display all the elements
3. Write a program to demonstrate the use of stack (implemented using linear array) in
conver ng arithme c expression from in x nota on to pos ix nota on.
4. Program to demonstrate the use of stack (implemented using linear linked lists) in
evalua ng arithme c expression in pos ix nota on.
5. Program to demonstra on the implementa on of various opera ons on a linear queue
represented using a linear array.
6. Program to demonstra on the implementa on of various opera ons on a circular
queue represented using a linear array.
7. Program to demonstra on the implementa on of various opera ons on a queue
represented using a linear linked list (linked queue).
8. Program to illustrate the implementa on of di erent opera ons on a binary search
tree.
9. Program to illustrate the traversal of graph using breadth- rst search
fi
ti
ti
ti
ti
ti
ti
ti
ti
ti
ti
ti
ti
ti
ti
ti
tf
fi
ti
ti
ti
ff
ti
ti
ti
fi
tf
ti
ti
ti
ti
ti
ti
ti
ti
10. Program to illustrate the traversal of graph using depth- rst search.
11. Program to sort an array of integers in ascending order using bubble sort.
12. Program to sort an array of integers in ascending order using selec on sort.
13. Program to sort an array of integers in ascending order using inser on sort.
14. Program to sort an array of integers in ascending order using radix sort.
15. Program to sort an array of integers in ascending order using merge sort.
16. Program to sort an array of integers in ascending order using quick sort.
17. Program to sort an array of integers in ascending order using heap sort.
18. Program to sort an array of integers in ascending order using shell sort.
19. Program to demonstrate the use of linear search to search a given element in an array.
20. Program to demonstrate the use of binary search to search a given element in a sorted
array in ascending order.

fi
ti
ti