‭INDEX‬

‭ .‬
S ‭Topic‬ ‭ ate of‬
D ‭ eacher’s‬
T
‭no‬ ‭submission‬ ‭signature‬
‭7.‬ ‭Write a menu driven program to create a‬ ‭01/04/2024‬
‭polynomial in two variables and add,‬
‭differentiate,‬
‭and integrate the polynomials and display them.‬

‭8.‬ ‭Write a program to reverse a string using stack.‬ ‭01/04/2024‬

‭9.‬ ‭Write a program to convert decimal number to‬ ‭01/04/2024‬

‭binary, hexadecimal, octal, as per user’s‬
‭choice using stack ADT.‬

‭10.‬ ‭ rite a program (using stack) to‬

W ‭01/04/2024‬
‭a. convert an Infix Expression into Postfix and‬
‭Postfix Evaluation‬
‭b. convert an infix Expression into Prefix and‬
‭Prefix Evaluation‬

‭11.‬ ‭Write a program for matching parenthesis using‬ ‭01/04/2024‬

‭stack.‬

‭12.‬ ‭Write a Program to implement multiple stacks in‬ ‭01/04/2024‬

‭a single array‬

‭13.‬ ‭Write a Program to implement queue using‬ ‭01/04/2024‬

‭arrays and linked list.‬

‭14.‬ ‭Write a program to reverse elements in a queue‬ ‭01/04/2024‬

‭15.‬ ‭Write a Program to implement circular queue‬ ‭01/04/2024‬

‭using arrays and circular link list.‬

‭16.‬ ‭Implement Stack using queue.‬ ‭01/04/2024‬

‭17.‬ ‭Implement Linear Queue, Circular Queue ADT‬ ‭01/04/2024‬

‭using stack and linked list.‬
‭18.‬ ‭Write a Program for the creation of binary search‬ ‭01/04/2024‬
‭tree and perform following tasks: insertion‬
‭& deletion, pre-order, post-order & in-order‬
‭traversals, computing height of tree, counting‬
‭number of leaf node, counting number of‬
‭non-leaf nodes, counting total number of nodes‬
‭of‬
‭a binary tree, finding minimum and maximum‬
‭element.‬

‭19.‬ ‭Write a non-recursive code to perform in-order‬ ‭01/04/2024‬

‭traversal of a binary tree.‬

‭20.‬ ‭Write a program to perform BFS (level order )‬ ‭01/04/2024‬

‭traversal in a Binary tree.‬

‭21.‬ ‭Write a Program for implementation of B-tree‬ ‭01/04/2024‬

‭(insertion & deletion)‬

‭22.‬ ‭Write a Program for implementation of multi-way‬ ‭01/04/2024‬

‭tree in c‬

‭23.‬ ‭Write a Program for implementation of AVL tree‬ ‭01/04/2024‬

‭24.‬ ‭Write a Program to implement following sort‬ ‭01/04/2024‬

‭procedure using arrays‬
‭a. Merge sort‬
‭b. Selection sort‬
‭c. Insertion sort‬
‭d. Quick sort‬
‭e. Heap sort‬

‭25.‬ ‭25. Write a program to implement Adjacency‬ ‭01/04/2024‬

‭Matrix and adjacency list representation of‬
‭graph.‬