Online Exam Preparation
MCQs Library
Browse subject-wise multiple choice questions, review answers quickly, and start a test from the same section.
Questions
| Code | Question | Option A | Option B | Option C | Option D | Answer |
|---|---|---|---|---|---|---|
| CS301 |
Deleting A Leaf Node In Binary Search Tree Involves Setting Pointer/S Of That Node’S Parent As Null
|
1
|
2
|
3
|
4
|
A |
| CS301 |
Doubly Linked List Always Has One Null Pointer
|
True
|
False
|
B | ||
| CS301 |
Doubly Linked List Always Has One Null Pointer
|
True
|
False
|
B | ||
| CS301 |
Each Entry Which Points To A Null Value In A Singly Linked List Is Known As
|
Node
|
First Node
|
Last Node
|
Head Node
|
C |
| CS301 |
Each Node In A Bst Has Pointers
|
1
|
2
|
3
|
4
|
B |
| CS301 |
Each Node In Doubly Link List Has
|
1 Pointer
|
2 Pointers
|
3 Pointers
|
4 Pointers
|
B |
| CS301 |
Each Node In Doubly Link List Has__________Pointer(S)
|
1
|
2
|
3
|
4
|
B |
| CS301 |
Each Operator In A Postfix Expression Refers To The Previous __________ Operand(S)
|
1
|
2
|
3
|
4
|
B |
| CS301 |
Every Avl Is __________
|
Binary Tree
|
Complete Binary Tree
|
None Of These
|
Binary Search Tree
|
D |
| CS301 |
Following Are The Linear Data Structures
|
Stacks
|
Queues
|
Both A & B
|
None Of The Above
|
C |
| CS301 |
For A Perfect Binary Tree Of Height 4. What Will Be The Sum Of Heights Of Nodes?
|
31
|
30
|
27
|
26
|
A |
| CS301 |
For A Perfect Binary Tree Of Height H Having N Nodes The Sum Of Heights Of Nodes Is
|
N – (H – 1)
|
N – (H + 1)
|
N – 1
|
N – 1 + H
|
B |
| CS301 |
For Compiler A Postfix Expression Is Easier To Evaluate Than Infix Expression?
|
True
|
False
|
A | ||
| CS301 |
For The Inorder Traversal Of Threaded Binary Tree We Introduced A Dummy Node. The Left Pointer Of The Dummy Node Is Pointing To The __________ Node Of The Tree
|
Left Most
|
Root
|
Right Most
|
Any Of The Given Node
|
A |
| CS301 |
Four Statements About Trees Are Below. Three Of Them Are Correct. Which One Is Incorrect?
|
Trees Are Recursively Defined Multi-Dimensional Data Structures Tree
|
The Order Of A Tree Indicates A Maximum Number Of Children Allowed At Each Node Of The
|
A Search Tree Is A Special Type Of Tree Where All Values (I.E. Keys) Are Ordered
|
If Tree1s Size Is Greater Than Tree2s Size Then The Height Of Tree1 Must Also Be Greater Than Tree2s Height
|
D |
| CS301 |
From The Following; Which On Is The Correct Syntax Of An Array Declaration: Array Size Is 5 And It Is Of Float Data Type?
|
Float [5] Name;
|
Name[5] Float;
|
Float Name[5];
|
None Of The Given Options
|
D |
| CS301 |
Here Is An Array Of Ten Integers: 5 3 8 9 1 7 0 2 6 4 The Array After The First Iteration Of The Large Loop In A Selection Sort (Sorting From Smallest To Largest)
|
0 3 8 9 1 7 5 2 6 4
|
2 6 4 0 3 8 9 1 7 5
|
2 6 4 9 1 7 0 3 8 5
|
0 3 8 2 6 4 9 1 7 5
|
A |
| CS301 |
Highest Operators Precedence Is Of The Following Operator
|
Plus
|
Minus
|
Multiply
|
Exponentiation
|
C |
| CS301 |
Huffman Encoding Uses ___________ Tree To Develop Codes Of Varying Lengths For The Letters Used In The Original Message
|
Linked List
|
Stack
|
Queue
|
Binary Tree
|
D |
| CS301 |
I Have Implemented The Queue With A Circular Array. If Data Is A Circular Array Of Capacity Elements And Last
Is An Index Into That Array What Is The Formula For The Index After Last?
|
(Last % 1) + Capacity
|
Last % (1 + Capacity)
|
(Last + 1) % Capacity
|
Last + (1 % Capacity)
|
C |