Monday, 11 March 2013

Practical Programs: DS

DATA STRUCTURE: PRACTICAL 

Below stated programs are to be performed as PRACITCAL PROGRAMS and later to be attached in JOURNALS.



1) Write a program in C to addition two polynomials using linked list.

2) Write a program in C to implement a doubly linked list. [Menu Driven]
            a)      Insert
            b)      Delete
            c)      Display
            d)     Quit

3) Write a program in C to implement a binary search tree. [Menu Driven]
            a)      Traverse a binary search tree using Inorder.
            b)      Traverse a binary search tree using Preorder.
            c)      Traverse a binary search tree using Postorder.

4) Write a program in C to implement a binary search tree. [Menu Driven]
            a)  Count total number of nodes
            b)  Prepare mirror image of a tree

5)   Write a program in C to implement a Bubble sort.

6) Write a program in C to implement a  Quick sort algorithm recursively.

7) Write a program in C to implement a  Merge sort algorithm.


8) Write a program in C to implement a  Insertion sort algorithm.

9) Write a program  in C to implement  DFS on a graph through an adjacency matrix.

10) Write a program  in C to implement BFS on a graph through an adjacency matrix


No comments:

Post a Comment

Please write Your Name with your Comments.