DS - LAB PROGRAMS (NEP II sem)

 Data Structure - LAB PROGRAMS (NEP II sem)

Course Title: Data Structures Lab Course code: 21BSDSC2P

Total Contact Hours: 42 Course Credits: 02

Formative Assessment Marks: 25 Duration of SEE/Exam: 03 Hours

Summative Assessment Marks: 25

Programming Lab : Click on Program to see Source Code & Output

Part A:

1. Write a C Program to find GCD using recursive function

2. Write a C Program to display Pascal Triangle using binomial function

3. Write a C Program to generate n Fibonacci numbers using recursive function.

4. Write a C Program to implement Towers of Hanoi.

5. Write a C Program to implement dynamic array, find smallest and largest element of the

array.

6. Write a C Program to create two files to store even and odd numbers.

7. Write a C Program to create a file to store student records.

8. Write a C Program to read the names of cities and arrange them alphabetically.

9. Write a C Program to sort the given list using selection sort technique.

10. Write a C Program to sort the given list using bubble sort technique.

Part B:

1. Write a C Program to sort the given list using insertion sort technique.

2. Write a C Program to sort the given list using quick sort technique.

3. Write a C Program to sort the given list using merge sort technique.

4. Write a C Program to search an element using linear search technique.

5. Write a C Program to search an element using recursive binary search technique.

6. Write a C Program to implement Stack.

7. Write a C Program to convert an infix expression to postfix.

8. Write a C Program to implement simple queue.

9. Write a C Program to implement linear linked list.

10. Write a C Program to display traversal of a tree.