|
LIST OF
DS-PROGRAMS 1.
Write a program of
maintaining student records having their personal data and the library records
and the transaction records maintaining the issued & returned books with
their issuing & return dates, using structure and array? 2.
Write a function of eradicating
all the characters from str1 present in str2? 3.
Write a program of
representing a singly linked list through pointers? 4.
Write a recursive
function of creation of singly linked list using structure and dynamic memory
allocation? 5.
Write a recursive
function of inserting the value in singly linked list before the location
specified by the user? 6.
Write a recursive
function of inserting the value in singly linked list after the location
specified by the user? 7.
Write a recursive
function of deleting the value in singly linked list before the location
specified by the user? 8.
Write a recursive
function of deleting the value in singly linked list after the location
specified by the user? 9.
Write a recursive
function of creation of circular linked list using structure and dynamic memory
allocation? 10.
Write a recursive
function of inserting the value in circular linked list before the location
specified by the user? 11.
Write a recursive
function of inserting the value in circular linked list after the location
specified by the user? 12.
Write a recursive function
of deletion the value in circular linked list before the location specified by
the user? Or you can also present the concept of deletion through Josephus
problem. 13.
Write a recursive
function of deleting the value in circular linked list after the location
specified by the user? 14.
Write a recursive
function of creating a doubly-linked list using structure, pointer and dynamic
memory allocation? 15.
Write a recursive
function of inserting a specified value anywhere in doubly linked list. 16.
Write a recursive
function of deleting a specified value from the doubly linked list. 17.
Write a recursive
function of adding two polynomials through linked list. 18.
Write a recursive
function of factorial. 19.
Write a recursive
function Fibonacci series. 20.
Write a recursive
function of finding the total number of occurrences in the user entered digits
in array. 21.
Write a recursive
function of calculating the exponential power of a number. 22.
Write a recursive
function of sum of squares. 23.
Write a recursive
function to solve the problem of 24.
Write a tree-recursive
function of finding maximum Fibonacci number. 25.
Write a function of pushing
the value in stack through static memory allocation. 26.
Write a function of popping
the value from stack through static memory allocation. 27.
Write a function of
pushing the value in stack through dynamic memory allocation. 28.
Write a function of
popping the value from stack through dynamic memory allocation. 29.
Write a function of
reversing the string through stack. 30.
Write a function of
converting infix notation into post-fix notation. 31.
Write a function of
evaluating the post-fix notation. 32.
Write a function of adding
of values in queue through static memory allocation. 33.
Write a function of
deleting the values from queue through static memory allocation. 34.
Write a function of
adding of values in queue through dynamic memory allocation. 35.
Write a function of
deleting the values from queue through dynamic memory allocation. 36.
Write a function of
creating a circular queue through static memory allocation. 37.
Write a function of
creating de-queue through static memory allocation through static memory
allocation/dynamic memory allocation. 38.
Write a function of
presenting the concept of priority queue. [like e.g.: You can simulate the
situation of assigning the priority: I, II & III categories to the entered numbers
into 3 predefined queues automatically according to your specified condition and
display first queue then second queue and at last the third queue showing
priority one by one.] 39.
Write a recursive
function of creating a binary search tree. 40.
Write a recursive
function of traversing a binary tree in Post-order. 41.
Write a recursive
function of traversing a binary tree in Pre-order. 42.
Write a recursive
function of traversing a binary tree in In-order. 43.
Write a function of
sorting an unsorted array through selection sort. 44.
Write a function of sorting
an unsorted array through Bubble sort. 45.
Write a function of sorting
an unsorted array through Insertion sort. 46.
Write a recursive
function of (divide and conquer algorithm) Quick sort. 47.
Write a recursive
function of (divide and conquer algorithm) 2 way merger sort (Merging of two
ordered files). 48.
Write a function of
searching a specified value in array through sequential search. 49.
Write a function of
searching a specified value in array through binary search (The array should be
in some specific order [ascending/descending] otherwise first sort it). 50.
Write a function of
representing the solution for the problem of sparse matrix through triples. |