Subject:Data Structure 1.: Define Dynamic Memory Allocation & State Its Importance
Subject:Data Structure 1.: Define Dynamic Memory Allocation & State Its Importance
Chapter 1
Chapter 2
1. Define queue and state its types.
2. Give any two applications of stack.
3. Explain construction of circular queue with example
4. Write a program to implement stack.
5. Explain any 2 applications of stack
6. Write an C program to implement queue.
7. Give any two applications of queue.
8. Demonstrate the memory representation of Stack using array with the
help of a diagram.
9. Write a ‘C’ program to insert an element into the queue and delete element
from the queue.
10. Explain any four primitive operations on stack.
11. Compare stack and queue.
12. Explain Queue as an ADT.
Chapter 3
1. Define singly linked list
2. State the operations performed on linked list
3. Write an algorithm to search a particular node in the given linked list.
4. Write a short note on GLL(Generalized Linked List)
5. Explain Circular linked list with example.
6. Compare Linear linked list and Circular linked List(any 2 points)
7. Define the term of linked list.i)Node ii)Next
8. Write a short note on applications of linked list.
9. Explain insertion of new node at start and end of singly linked list.
10. Define dynamic memory allocation & state its importance.
Chapter 4
1. Define the following terms w.r.t. tree I)In-degree ii)Out-degree
2. Describe given two types of graph : Directed and Undirected
3. Solve the given: Traverse the following tree by in-order, pre-order & post-order
methods.
4. Solve: Construct the minimum spanning tree (MST) for the given graph using
Kruskal’s Algorithm-
5. Solve: Using Dijkstra’s Algorithm, find the shortest distance from source vertex
‘S’ to remaining vertices in the following graph-
6. Explain tree with any 4 terminology and construct BST with following
numbers:20,3,7,96,85,41,6,3,74.
7. Compare tree and graph.
8. Describe any two types of tree from the following:General tree,Binary
tree,Binary search tree
9. Solve and evaluate the following arithmetic expression P written in
postfix notation.P:4,2,^,3,*,3,-,8,4,/,+
10. Write an algorithm to traverse the tree inorder and postorder with
example.
11. Solve:Construct the minimum spanning tree (MST) for the given graph
using Prim’s Algorithm
12.Give the adjacency matrix and adjacency list representation of given graph.