Course

Lab Cycle

• Write a program to demonstrate linear search and perform the
• Write a program to demonstrate
• Write a program to demonstrate
• Write a program to demonstrate structures and functions with
• Write a program to illustrate a 1D
• Write a program to illustrate a 2D
• Write an algorithm to perform binary search and perform the comparison of linear and binary
• Write an interactive program to perform sorting algorithms – Bubble sort, Insertion sort, Selection Sort, and its
• Write an interactive program to illustrate insertion and deletion operations on a singly linked
• Write an interactive program to illustrate insertion and deletion operations on a circular linked list.
• Write an interactive program to illustrate insertion and deletion operations on a doubly linked
• Write a program to illustrate stack
• Write a program to perform infix to postfix
• Write a program to perform postfix
• Write a program to perform Merge
• Write a program to perform Quick sort.
• Write a program to operate on a
• Write a program to perform operations on a circular
• Write a program to represent the graph using an adjacency
• Write a program to represent the graph using an adjacency
• Write an interactive program to perform binary tree traversal – Pre-order, In-order and Post-order.

Course Objective(s)

• To gain knowledge about the fundamental concepts of algorithms, flowcharts, and performance analysis of the
• To comprehensively understand different types of data structures used for problem-solving.

Course Outcomes

CO-PO Mapping

Textbooks:

1. Horowitz & Sahni, Fundamental Data Structure, Galgotia Book Source, 1983.
2. Tannenbaum, Data Structure Using C, Pearson Education, 2003.

References:

• Classic Data Structures by D. Samanta, Second Edition.