Data Structures Through C Lab for III Semester DCME

 Data Structures Through C Lab for III Semester DCME

Syllabus

1 Develop a  ̳C‘ program to create and implement a SINGLY LINKED LIST. Write functions to insert, delete, and display elements of the list.

Create and Display                         Insert                                     Delete

2. Develop a  ̳C‘ program to create and implement a SINGLY CIRCULAR LINKED LIST.

3. Develop a  ̳C‘ program to create and implement a STACK using arrays.

4. Develop a  ̳C‘ program to create and implement a STACK using linked lists.

5. Develop a  ̳C‘ program to create and implement a QUEUE using arrays.

6. Develop a  ̳C‘ program to create and implement a QUEUE using linked lists.

7. Develop a  ̳C‘ program to create and implement a CIRCULAR QUEUE using arrays.

8. Develop a  ̳C‘ program to create a BINARY TREE. Write functions to perform the various traversals on the tree.

9. Develop a  ̳C‘ program to create a BINARY SEARCH TREE. Write functions to perform the various traversals on the tree.

10. Develop a  ̳C‘ program to create and implement SELECTION SORTING.

11. Develop a  ̳C‘ program to create and implement INSERTION SORTING.

12. Develop a  ̳C‘ program to create and implement BUBBLE SORTING.

13. Develop a  ̳C‘ program to create and implement MERGE SORTING on two sorted list.

14. Develop a  ̳C‘ program to create and implement LINEAR SEARCHING.

15. Develop a  ̳C‘ program to create and implement BINARY SEARCHING