Chapter 3
Data Structures and Operations
1. What is “queue" in data structure?
2. List the different operations on data structures
[Link] an algorithm to insert new item into a queue
4. Write an algorithm to add a new element in a stack .
[Link] a procedure to implement transversal operation in a linked list
6. What is the advantage of circular queue over linear queue ?
7. What is data structures? How are they classified?
8. Linked lists usually do not have the problem of overflow. Discuss.
9. Illustrate linked list with suitable diagram
10. Explain about operations performed on stack data structure
11. Write an algorithm to perform insertion operation in a queue
12. Match the following :
[Link] static and dynamic data structure. Give an example for each.
14. Write an algorithm to perform pop operation in a stack.