SRM University 2007 B.Tech Computer Science and Engineering BANMK - Question Paper

5. discuss Towers of Hanoi issue and provide complete algorithm.
6. provide algorithm for insert and delete operations in Queue.
7. Consider a deque maintained by a circular array with N memory cells.
a. Suppose an element is added to the dequeue how is left and right changed?
b. Suppose an element is deleted. How left or right is is changed.
c. If the element is added on the left , then left is reduced by 1(mod N).on the other hand if the element is added on the right then right is reduced.
8. Write algorithm for insert and delete an element from a priority queue.
9. What is circular queue? discuss circular queue implementation.
10. discuss the record structure for employee details. Draw the hierarchical structure. Which of the items are elementary items?



UNIT – III
PART - A
1. Define linked list.
2. Define node and pointer.
3. Differentiate null pointer and begin pointer.
4. Explain the Representation of Linked list in memory.
5. List out the advantages of linked list.
6. Differentiate overflow and underflow.
7. What is the use of available list.
8. Write about garbage collection.
9. What are the different methods of insertion in linked list.
10. Write about the complexity of deletion operation in linked list.
11. Write short notes on Header Linked list.
12. Write about the structure of Circular linked list.
13. Explain the representation of polynomials using linked list.
14. Draw the structure of Double linked list and discuss it.
15. Compare single linked list , Double linked list, Circular linked list.
16. write short notes on 2 – way Header lists.
17. List out the different operations an linked list.


UNIT – III
PART - B
1. discuss the procedure of a linked list with an example.
2. Write an algorithm for search an element in linked list.
3. Discuss the subsequent
a. Memory Allocation
b. Garbage Collection
c. Overflow and Underflow
4. Write a procedure for traversing a linked list and print its contents.
5. Explain the procedure of inserting a node at the beginning of a list with an example.
6. Write a procedure for inserting after a provided node.
7. Write a procedure for inserting into a sorted linked list.
8. Explain the procedure of Deleting the node subsequent a provided a node.
9. Discuss deleting the node with a provided ITEM of info.
10. Write an algorithm to obtain the location LOC of the node where ITEM 1st appears in LIST or Sets LOC = NULL

Earning:   Approval pending.