Since I can't generate the PDF file directly right now, here’s what you can do manually using
the text below:
1. Copy the full text below.
2. Paste it into Microsoft Word, Google Docs, or any text editor.
3. Export or Save As PDF from the editor.
CSE(DS) II MID EXAM OBJECTIVE SET A – WITH ANSWERS
SV COLLEGE OF ENGINEERING
I B.Tech II Semester II Internal (Objective) Examinations April-2025
Branch: CSE | Set-A | Subject: Data Structures | Code: CS23APC201
CHOOSE THE CORRECT ANSWER (15 × ½ = 7½ Marks)
1. Stack obeys following rule
a) LIFO
b) Both a & c
c) FILO
d) FIFO
Answer: a) LIFO
2. Queue obeys following rule
a) FIFO
b) Both a & c
c) LILO
d) LIFO
Answer: a) FIFO
3. Which among the following are graphs?
a) Spanning tree
b) All
c) Tree
d) AVL Tree
Answer: b) All
4. Reverse Polish notation is also called
a) Infix
b) Postfix
c) Prefix
d) None
Answer: b) Postfix
5. Degree of an AVL Tree is?
a) Can’t say
b) 2
c) 3
d) n
Answer: b) 2
6. Evaluate “6 + 2 % 3 + 2 ^ 1 ^ 2”
a) 8
b) 10
c) 7
d) 3
Answer: c) 7
7. BFS Traversal uses which Data Structure?
a) Stack
b) None
c) Tree
d) Hash Table
Answer: b) None
8. DFS Traversal uses which Data Structure?
a) Queue
b) Stack
c) Tree
d) Hash Table
Answer: b) Stack
9. Number of spanning trees possible with complete graph (K3)?
a) 0
b) 3
c) (No option shown)
d) 4
Answer: b) 3
10.Recursive functions indirectly use _______ data structure.
a) Array
b) Stack
c) Queue
d) Tree
Answer: b) Stack
11.Evaluate “2^2^2*2^2”
a) 72
b) 64
c) 32
d) 132
Answer: b) 64
12.All AVL Trees are
a) Binary Trees
b) All
c) BST
d) Graphs
Answer: b) All
13.Number of edges connected to a node in a directed graph?
a) In-degree
b) Both a & c
c) Out-degree
d) Degree
Answer: b) Both a & c
14.How many maximum number of nodes are present in a binary tree of height =
3?
a) 8
b) 7
c) 6
d) Can’t say
Answer: a) 8
15.Which rotation is performed if a new node is inserted in the Left subtree of a
Right subtree of the “pivot” node?
a) LL
b) LR
c) RL
d) None
Answer: c) RL
FILL IN THE BLANKS (5 × ½ = 2½ Marks)
16.____________ number of binary trees are possible with “3” number of nodes.
Answer: 5
17.The process of mapping keys to values is called
___________________________.
Answer: Hashing
18.Write Order of In-order traversal
________________________________________.
Answer: Left -> Root -> Right
19._________________________ heap tree is constructed for arranging elements
in ascending order.
Answer: Min Heap
20.Is every spanning tree a graph? (True or False) __________________________.
Answer: True
Let me know if you’d like this text file exported directly instead, which you can also turn into a
PDF easily.
