S.NO
|
NAME OF THE EXPERIMENT
|
||
1
|
Write a 'C' program that uses_functions to perform the following:
|
||
2
|
Write a 'C' program that uses functions to perform the following:
|
||
a) Create a doubly_linked_list of integers.
|
|||
b) Delete a given integer from the above doubly_linked_list.
|
|||
3
|
Write a 'C' program that uses stack operations to convert a given
infix expression into its postfix
Equivalent, Implement the stack using an array. |
||
4 |
Click Here to Download for Infix to Postfix
Write 'C' programs to implement a double_ended_queue ADT using |
||
5 |
Write a 'C' program that uses functions to perform the following:
|
||
a) Create a binary search tree of characters.
|
|||
b) Traverse the above Binary_search tree recursively in
Postorder.
Click Here to Download Above Program |
|||
6 |
Write a 'C' program that uses functions to perform the following:
|
||
a) Create a binary_search tree of integers.
|
|||
b) Traverse the above Binary_search tree non-recursively in
inorder
Click Here to Download Above Program |
|||
7
|
Write 'C' programs for implementing the following sorting methods to arrange a list_of_integers in Ascending order : |
||
b) Merge_sort
|
|||
8
|
Write 'C' programs for implementing the following sorting methods to arrange a list_of_integers in ascending order: |
||
a) Quick_sort
|
|||
9 |
Write a 'C' program to perform the following operation: |
||
10 |
Write a 'C' program to implement all the functions_of_a_dictionary
(ADT) using 'hashing'.
|
||
11 |
Write a 'C' program_for_ implementing Knuth-Morris_Pratt_pattern_matching algorithm.
|
||
12 |
Write 'C' programs for implementing the following graph_traversal_algorithms:
|
||
a)Depth_first_traversal
|
|||
b)Breadth_first_traversal
|
R13 Data Structures Lab Manual
Share to other apps