1. How to represent the polynomial using linked list ? Write a C program to add two polynomials using linked list.
2. Discuss doubly linked list. Write an algorithm to insert a node after a given node in singly linked list.
3. Write an algorithm for converting infix expression into postfix expression. Trace your algorithm for infix expression Q into its equivalent postfix expression P, Q: A + ( B * C – ( D / E ^ F) * G ) * H
4. What is circular Queue? Write a C code to insert an element in circular queue?
5. What is Hashing? Explain division method to compute the hash function and also explain the collision resolution strategies used in hashing.
6. Write an algorithm for Heap Sort. Use Heap sort algorithm, sort the following sequence: 18, 25, 45, 34, 36, 51, 43, and 24.