CS201 MID TERM SOLVED MCQs || PAST PAPERS || GROUP-1 || INTRODUCTION TO PROGRAMMING || VuTech Visit Website For More Solutions www.vutechofficial.blogspot.com …
CS301 MID TERM SOLVED MCQs || PAST PAPERS || GROUP-1 || DATA STRUCTURES ||
VuTech
Visit Website For More Solutions www.vutechofficial.blogspot.com
CS301
Data Structures
Solved Mid Term Past Papers
______________________________
MCQs
______________________________
Group-1
Question No: 1
Which one is the correct function call for the following function of
calculating cube?
a) cube(num)
b) cube(*num)
c) cube(&num)
d) cube(&&num)
Correct Answer:
The correct answer is 'a'.
Question No: 2
In a complete binary tree, for 25000 nodes the depth will be ________
.
a) 14
b) 13
c) 12
d) 11
Correct Answer:
The correct answer is 'b'.
Question No: 3
In level-order traversal for Binary Search Tree, _____ data structure is
used.
a) Queue
b) Stack
c) Tree
d) Heap
Correct Answer:
The correct answer is 'a'.
Visit Website For More Solutions www.vutechofficial.blogspot.com
Question No: 4
If both left and right nodes of a node are NULL then this type of node is
called a ____ node.
a) Leaf
b) Node
c) Both
d) None of these
Correct Answer:
The correct answer is 'a'.
Question No: 5
For searching a particular number in Binary Search Tree (if it is not
present), the maximum number of comparisons will be ________ comparison(s)
at each level.
a) 1
b) 2
c) 3
d) 4
Correct Answer:
The correct answer is 'c'.
Visit Website For More Solutions www.vutechofficial.blogspot.com
Question No: 6
In a complete binary tree the number of nodes at level 5 are ______ .
a) 32
b) 30
c) 23
d) 40
Correct Answer:
The correct answer is 'b'.
Question No: 7
While implementing non-recursive traversal for Binary Search Tree, we need
to implement _______ .
a) Stack
b) Tree
c) Heap
d) Pointer
Correct Answer:
The correct answer is 'a'.
Question No: 8
______ is used for Reference variables in C++.
a) &
b) @
c) #
d) *
Correct Answer:
The correct answer is 'a'.
Visit Website For More Solutions www.vutechofficial.blogspot.com
Question No: 9
Left, right, info, and parent are the operations of _____ data
structure.
a) Tree
b) Heap
c) Stack
d) Pointer
Correct Answer:
The correct answer is 'a'.
Question No: 10
If a function has recursive call as the last statement, it is known as
______ .
a) Local
b) Last
c) Function
d) Tail Recursive
Correct Answer:
The correct answer is 'd'.
Visit Website For More Solutions www.vutechofficial.blogspot.com
We provide Virtual University of Pakistan Study Materials such as Solution of Assignments, GDBs, Mid Term Solved Papers, Final Term Solved Papers, Mid Term Solved MCQs, and Final Term Solved MCQs. We also provide regular Semester Quizzes, Updated Handouts, and Short Questions and Answers. We help you with your research and many other educational-related topics, as far as we know. Furthermore, Share your problem with us and Please feel free to ask any related questions.