R 23 SV COLLEGE OF ENGINEERING Marks Obtained

(AUTONOMOUS)
Karakambadi Road, Tirupati - 517507
I B. Tech II Semester II Internal (Objective) Examinations April-2025
Branch: CSE Set-A
Subject: Data Structures Code: CS23APC201
Time : 20 Minutes

Max. Marks : 10 Marks

Signature of the invigilator Signature of the Student

I. CHOOSE THE CORRECT ANSWER 15 × ½= 7½ M

1. Stack obeys following rule [ ]

a) LIFO b) Both a&c c) FILO d) FIFO

2.
Queue obeys following rule [ ]

a) FIFO b) Both a&c c) LILO d) LIFO

3.
Which among the following are graphs? [ ]

a) spanning tree b) All c) tree d) AVL Tree

4.
Reverse polish notation is also called [ ]

a) Infix b) Postfix c) prefix d) None

5.
Degree of an AVL Tree is? [ ]

a) Cant say b) 2 c) 3 d) n

6.
Evaluate “6+2%3+2^1^2” [ ]

a) 8 b) 10 c) 7 d) 3

Page 1 of 3
7.
BFS Traversal uses Which Data structure? [ ]

Hash
a) stack b) None c) Tree d)
table

8.
DFS Traversal uses Which Data structure? [ ]

Hash
a) Queue b) Stack c) Tree d)
table

9.
Number of spanning trees possible with complete graph(K3)? [ ]

a) 0 b) 3 c) d) 4

10.
Recursive functions indirectly use _______ data structure. [ ]

a) Array b) Stack c) Queue d) Tree

11. Evaluate “2^2^2*2^2” [ ]

a) 72 b) 64 c) 32 d) 132

12. All AVL Trees are [ ]

a) Binary Trees b) All c) BST d) Graphs

13. Number of edges connected to a node in a directedGraph ? [ ]

a) In-degree b) both a&c c) Out-degr d) degree

14. How maximum number of nodes are present in a binary tree of height = 3 . [ ]

a) 8 b) 7 c) 6 d) can't say

15. Which Rotation is performed if a new node is inserted in the Left subtree of a Right subtree [ ]

of “pivot” node ?

a)LL b)LR c)RL d) None

II. FILL IN THE BLANKS: 5 × ½= 2½

16. ____________number of binary trees are possible with “3” number of nodes.

17. The process of Mapping keys to values is called___________________________.

18. Write Order of In-order traversal__________________________________________________.

19. _________________________heap tree is constructed for arranging elements in ascending order.

20. Is every spanning tree a graph?(True or False) __________________________.

Page 3 of 3