Q1: What is an array? What are limitations of arrays? Give an example to show the usefulness of arrays.
Q2: Differentiate between primitive data structure and non- primitive data structure.
Q3: How is the queue different from the stack? What is a circular queue? How do you represent it?
Q4: Give the data structure to implement two stacks in same array. Write functions to implement PUSH operation on both the stacks.
Q5: How can you find shortest path between nodes in a graph by Dijkstra's algorithm? Explain by suitable diagram and algorithm
Case Study
Write a program to implement a stack which contains the address of the pointers for allocation of memory. Do the pop operation on stack and free the popped pointers.