1.What are the various operations on stack?Explain.
2.Write the functions to perform the following operations on a singly linked list.
i. Adding node at between any two nodes
ii. Deleting a node from any where.
iii. Adding node at beginning and end
iv. Deleting a first and last node.
3.i)Explain about any two applications of stack in detail with suitable example.
ii)Write the functions to perform the insert and delete operations on queue.
4.i)Give two sorted lists L1 and L2.Write a procedure to compute L1U L2 using the basic list operations.
ii)Write a program to print out the elements of a singly linked list.
5.i)Write an algorithm /program to convert infix expression to post fix expression using stack.
ii)What is meant by priority queue?
6.Explain in detail Queue data structure.
7.Explain in detail Linear Linked List.
8.Explain in detail Circularly linked list.
9.i)List the advantages of circular queue ?
ii)How to represent the queue using array?
No comments:
Post a Comment