Data Structure
Endsem Question bank
Unit No 3
Theory
1) Explain stack operation PUSH & POP
2) Write C function for PUSH and POP
3) Compare Stack and Queue
4) What are the conditions for queue empty and queue full when queue implemented using array
5) Types of Queue? Explain any one in Detail
6) Write short note on Circular queue
7) Explain any one application of queue
8) Difference between linear and circular Queue
9) Write C insert Function to implement queue using array
Examples
Prepare following type examples over unit 3
1) Identify given expression and convert it in remaining two forms
2) Convert following expression from infix to postfix
3) Convert following expression from postfix to infix
4) Evaluate the following Postfix or Infix Expression
Unit No 4
Theory
1) Compare array and linked List
Or
1) Write Limitations of Array over Linked List
2) What is singly linked list? State limitations of singly linked list
3) Write short note on Doubly linked list
4) Write structure for Doubly Linked List
5) Explain Traversal operation in singly linked list
6) Write C Function for inserting a node at given location into singly linked list
7) Write C function to Delete Node from singly linked list
8) Write a short note on circular linked list
10) Write short note on Doubly linked list
11) Write a node structure and algorithm to create the list
12) Explain insert operation in doubly linked list
13) Compare SLL & DLL
14) Write C function for Stack PUSH and POP using Linked List
15) Write short note on application of queue explain with example
Or
15) Example
Represent given polynomial using linked list
Perform polynomial addition and represent the result polynomial using linked list
Unit No. 5
Theory
1) Define
Tree
Root
Siblings
Subtree
or
Left subtree
Right subtree
Level of Node
Depth of Treee
Degree of Node
Path
Parent
Height of Tree
2) What is Binry Tree
3) Explain with Suitable example how a binary tree can be represented using array
Or
3) Explain representation method of binary tree in memory
4) Explain with Suitable example how a binary tree can be represented using Linked List
5) What are types of tree? Explain with Suitable figures
6) Explain popular methods of binary tree traversal
7) Write a recursive C function for preorder traversal of binary search tree
8) Write a recursive C function for inorder traversal of binary search tree
9) Write a recursive C function for postorder traversal of binary search tree
10)Write a psedocode to search an element in binary search tree using arrays
Or
10) Explain following operation in BST: Searching a value in BST
11) Write a C function to insert node in BST
12) Explain the different cases to delete an element from BST
Example
Construct Binary Search Tress for the following
Write inorder,preorder and postorder traversals for the following BST
Unit No 6
Theory
1) Define Graph
2) Discuss Types of Graph
3) Define the term path
4) What do you mean by in-degree and out-degree vertex in a graph
5) Define Spanning tree
6) What is minimum Spanning tree of a graph
7) Explain with Suitable example the technique to represent a graph
Or
7) What do you mean by adjacency Matrix
Or
7) What do you mean by adjacency list
8) Explain graph traversal methods using suitable example
9) Write an algorithm for DFS traversal of graph
Or
9) Explain with suitable example DFS traversal of a graph
10) Write an algorithm for BFS traversal of graph
Or
10) Explain with suitable example BFS traversal of a graph
11) Compare BFS and DFS
12) What is minimum Spanning Tree
13) Explain with suitable example Prim’s algorithm
14) Explain Kruskal’s Algorithm with example
15) Explain Dijkstra’s algorithm with example
Example
Draw adjacency list and adjacency matrix for the following graph
Show the working of non recursive DFS algorithm on the following graph
Show the working of non recursive DFS algorithm on the following graph
Write DFS and BFS for the given in figure. Starting with the vertex1
Construct minimum spanning tree using prim’s algorithm for given graph
Construct minimum spanning tree using Kruskal’s algorithm for given graph
Find shortest path using Dijkstra’s algorithm for given graph
