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 |
A Node Cannot Be Deleted When The Node To Be Deleted Has Both Left And Right Subtrees
|
True
|
False
|
B | ||
| CS301 |
A Queue Is A Data Structure Where Elements Are
|
Inserted At The Front And Removed From The Back
|
Inserted And Removed From The Top
|
Inserted At The Back And Removed From The Front
|
Inserted And Removed From Both Ends
|
A |
| CS301 |
A Queue Is A----- Data Structure Whereas A Stack Is A -----Data Structure
|
Fifo Lifo
|
Lifo Fifo
|
None Of These
|
Both Of These
|
A |
| CS301 |
A Queue Where The De-Queue Operation Depends Not On Fifo Is Called A Priority Queue
|
True
|
False
|
A | ||
| CS301 |
A Simple Sorting Algorithm Like Selection Sort Or Bubble Sort Has A Worst-Case Of
|
O(1) Time Because All Lists Take The Same Amount Of Time To Sort
|
O(N) Time Because It Has To Perform N Swaps To Order The List
|
O(N2) Time Because Sorting 1 Element Takes O(N) Time - After 1 Pass Through The List Either Of These Algorithms Can Guarantee That 1 Element Is Sorted
|
O(N3) Time Because The Worst Case Has Really Random Input Which Takes Longer To Sort
|
C |
| CS301 |
A Solution Is Said To Be Efficient If It Solves The Problem Within Its Resource Constraints I.E. Hardware And Time
|
True
|
False
|
A | ||
| CS301 |
A Subscript Of An Array May Be An Integer Or An Integer Expression
|
True
|
False
|
A | ||
| CS301 |
A Threaded Binary Tree Is A Binary Tree In Which Every Node That Does Not Have A Right Child Has A Thread (In Actual Sense A Link) To Its __________ Successor
|
Inorder
|
Levelorder
|
Preorder
|
Postorder
|
A |
| CS301 |
A Tree Is An Avl Tree If
|
Any One Node Fulfills The Avl Condition
|
At Least Half Of The Nodes Fulfill The Avl Condition
|
All The Nodes Fulfill The Avl Condition
|
None Of The Given Options
|
C |
| CS301 |
Addition Of New Items In Stack Make The Pointer ------------ By 2
|
Increment Bits
|
Increment Bytes
|
Decrement Bits
|
Decrement Bytes
|
D |
| CS301 |
After Creation Of An Array
|
Size Can Be Increase But Can Not Be Decreased
|
Size Can Be Decreased But Can Not Be Increased
|
Size Can Neither Be Increased Nor Be Decreased
|
Size Can Be Increased And Can Also Be Decreased
|
C |
| CS301 |
An Array Is A Group Of Consecutive Related Memory Locations
|
True
|
False
|
A | ||
| CS301 |
An Array Is A Group Of Consecutive Related Memory Locations
|
True
|
False
|
A | ||
| CS301 |
An Expression Tree Will Always Be A
|
Complete Binary Tree
|
Binary Search Tree
|
Heap Avl Tree
|
Non Of Then
|
B |
| CS301 |
Avl Tree Is
|
Non Linear Data Structure Click Here For Detail
|
Linear Data Structure
|
Hybrid Data Structure (Mixture Of Linear And Non Linear)
|
None Of The Given Options
|
A |
| CS301 |
Below Is A Binary Search Tree. If We Delete The Value 50 Using The Algorithm We Discussed What Value Will Be In The Root Of The Remaining Tree?
|
50
|
60
|
70
|
80
|
D |
| CS301 |
Binary Search Is An Algorithm Of Searching Used With The Data
|
Sorted
|
Unsorted
|
Heterogeneous
|
Random
|
A |
| CS301 |
Bst Is A Structure
|
Linear
|
Non Linear
|
Circular
|
None Of Above
|
B |
| CS301 |
By Using __________We Avoid The Recursive Method Of Traversing A Tree Which Makes Use Of Stacks And Consumes A Lot Of Memory And Time
|
Binary Tree Only
|
Threaded Binary Tree
|
Heap Data Structure
|
Huffman Encoding
|
B |
| CS301 |
Class Foo
{
Public:
Void X(Foo F);
Void Y(Const Foo F);
Void Z(Foo F) Const;
Which Of The Three Member Functions Can Alter The Private Member Variables Of The Foo Object That Activates The Function?
|
Only X Can Alter The Private Member Variables Of The Object That Activates The Function
|
Only Y Can Alter The Private Member Variables Of The Object That Activates The Function
|
Only Z Can Alter The Private Member Variables Of The Object That Activates The Function
|
Two Of The Functions Can Alter The Private Member Variables Of The Object That Activates The Function
|
D |