| 1.Accept an infix expression, convert it in to postfix form
and evaluate it.
2. Implement Circular queue as array and find the size of queue.
3. Polynomial manipulation using linked list: Addition, Multiplication
and Evaluation.
4.Merge two sorted CDL lists into one list without creating
new node.
5. Invert the LSL list.
6. Implement generalized linked list and find the length of
list.
7. Implement CSL list and perform following
operations: insert front and insert at specific location.
8. Create BST and perform following operations:
Add/Delete nodes, Search, Copy, Mirror Image, Sort in descending
order, Display, Recursive Traversals and Non-recursive inorder
traversal using stack.
9. On BST perform following operations: Count
the leaf nodes & total nodes, find the depth/height of tree
and Level order traversal using linear queue.
10.Implement threaded binary tree.
11. Generate Huffman tree..
12.Implement different sorting methods to sort
the elements in array (A) Bubble sort (B) Quick sort
13. Perform binary search on set of n numbers.
14. Implement Priority Queue using link list.
15. Implement DEQUE. After each operation display
the value of FRONT and REAR.
16.Accept infix and generate expression tree from it and perform
traversals.
17. Write a recursive program to print Fibonacci
series up to n terms 0, 1, 1, 2, 3, 5, 8.......n
18. Check whether given number or string is palindrome.
19. Generate Pascal triangle.
20. Accept n strings and sort reverse of them in descending
order.
21.Accept two strings on command line and concatenate reverse
of two.
22.Accept a paragraph from user and count no.
of vowels, consonants, digits, blank spaces, lines and special
characters.
23.Print recursive sum of digits of given no.
using function sum_ of_ digit (int n) where n is an +ve integer.
|