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 |
Which One Of The Following Is True About Iteration?
|
Iteration Extensively Uses Stack Memory
|
Threaded Binary Trees Use The Concept Of Iteration
|
Iterative Function Calls Consumes A Lot Of Memory
|
Recursion Is More Efficient Than Iteration
|
A |
| CS301 |
Which One Of The Following Is True About Recursion?
|
Recursion Extensively Uses Stack Memory
|
Threaded Binary Trees Use The Concept Of Recursion
|
Recursive Function Calls Consume A Lot Of Memory
|
Iteration Is More Efficient Than Iteration
|
A |
| CS301 |
Which One Of The Following Operations Returns Top Value Of The Stack?
|
Push
|
Pop
|
Top
|
First
|
C |
| CS301 |
Which One Of The Following Operators Has Higher Priority Than All Of Others?
|
Multiplication Operator
|
Minus Operator
|
Plus Operator
|
Exponentiation Operator
|
A |
| CS301 |
Which One Of The Following Statement Is Not Correct
|
In Linked List The Elements Are Necessarily To Be Contiguous
|
In Linked List The Elements May Locate At Far Positions In The Memory
|
In Linked List Each Element Also Has The Address Of The Element Next To It
|
In An Array The Elements Are Contiguous
|
B |
| CS301 |
Which One Of The Following Statements Is Correct?
|
Array Size Is Fixed Once It Is Created
|
?Link List Size Is Fixed Once It Is Created
|
Binary Search Tree Size Is?Fixed Once It Is Created
|
Avl Tree Size Is Fixed Once It Is Created
|
A |
| CS301 |
Which One Of The Following Statements Is Not Correct?
|
Array Size Can Be Changed After Its Creation
|
Link List Size Can Be Changed After Its Creation
|
Binary Search Tree Size Can Be Changed After Its Creation
|
Avl Tree Size Can Be Changed After Its Creation
|
A |
| CS301 |
Which Property Of Equivalence Relation Is Satisfied If We Say: Ahmad R(Is Related To) Ahmad
|
Reflexivity
|
Symmetry
|
Transitivity
|
All Of The Above
|
B |
| CS301 |
Which Statement Of The Following Statements Is Incorrect?
|
Lists Can Be Implemented By Using Arrays Or Linked Lists
|
A List Is A Sequence Of One Or More Data Items
|
Stack Is A Special Kind Of List In Which All Insertions And Deletions Take Place At One End
|
Stacks Are Easier To Implement Than Lists
|
D |
| CS301 |
Which Traversal Gives A Decreasing Order Of Elements In A Heap Where The Max Element Is Stored At The Top?
|
Post-Order
|
Level-Order
|
Inorder
|
None Of The Given Options
|
D |
| CS301 |
While Building Huffman Encoding Tree The New Node That Is The Result Of Joining Two Nodes Has The Frequency
|
Equal To The Small Frequency
|
Equal To The Greater
|
Equal To The Sum Of The Two Frequencies
|
Equal To The Difference Of The Two Frequencies
|
C |
| CS301 |
While Joining Nodes In The Building Of Huffman Encoding Tree If There Are More Nodes With Same Frequency We Choose The Nodes
|
Randomly
|
That Occur First In The Text Message
|
That Are Lexically Smaller Among Others
|
That Are Lexically Greater Among Others
|
A |