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 |
|---|---|---|---|---|---|---|
| CS502 |
How Much Time Merge Sort Takes For An Array Of Numbers?
|
(N^2)
|
T(N)
|
T( Log N)
|
T(N Log N)
|
B |
| CS502 |
Huffman Algorithm Uses A Greedy Approach To Generate A Postfix Code T That Minimizes The Expected Length B (T) Of The Encoded String
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Huffman Algorithm Uses A Greedy Approach To Generate An Antefix Code T That Minimizes The Expected Length B (T) Of The Encoded String
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Ideally This Model Should Be A Reasonable Abstraction Of A Standard Generic Single-Processor Machine. We Call This Model A __________
|
Ram Memory
|
Rom Memory
|
Random Access Machine Or Ram
|
None
|
C |
| CS502 |
Ideally X (Pivot) Should Have A Rank That Is Neither Too Large Or Too Small
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
If A Graph Has V Vertices And E Edges Then To Obtain A Spanning Tree We Have To Delete
|
V Edges
|
V – E + 5 Edges
|
V + E Edges
|
None Of These
|
D |
| CS502 |
If A Problem Is In Np It Must Also Be In P
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
If A Problem Is Np-Complete It Must Also Be In Np
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
If Algorithm A Has Running Time 7N^2 + 2N + 3 And Algorithm B Has Running Time 2N^2 Then
|
Both Have Same Asymptotic Time Complexity
|
A Is Asymptotically Greater
|
B Is Asymptotically Greater
|
None Of Others
|
A |
| CS502 |
If In A Dfs Forest Of Digraph G = (V E) F[U] = F[V] For An Edge (U V) ? E Then The Edge Is Called
|
Back Edge
|
Forward Edge
|
Cross Edge
|
Tree Edge
|
A |
| CS502 |
If N Is Not Very Large Then Almost Any Algorithm Be Fast
|
May
|
May Be Not
|
Will
|
None
|
B |
| CS502 |
If N Is Odd Then The Median Is Defined To Be Element Of Rank
|
N
|
N-1
|
(N+1)/2
|
N/2
|
C |
| CS502 |
If There Are O (N^2) Entries In Edit Distance Matrix Then The Total Running Time Is ___________
|
O (1)
|
O (N^2)
|
O (N)
|
O (N Log N)
|
B |
| CS502 |
If There Are O(N2) Entries In Edit Distance Matrix Then The Total Running Time Is
|
O(1)
|
O(N^2)
|
O(N)
|
O(N Log N)
|
B |
| CS502 |
If You Find Yourself In Maze The Better Traversal Approach Will Be
|
Bfs
|
Dfs
|
Level Order
|
Bfs And Dfs Both Are Valid
|
B |
| CS502 |
If You Find Yourself In Maze The Better Traversel Approach Will Be
|
Bfs
|
Bfs And Dfs Both Are Valid
|
Level Order
|
Dfs
|
D |
| CS502 |
In A Heap The Parent Has A Key Larger Than Or Equal Both Of Its Children
|
(Max) Heap
|
(Min) Heap
|
Na
|
Na
|
A |
| CS502 |
In Counting Sort Once We Know The Ranks We Simply ___________ Numbers To Their Final Positions In An Output Array
|
Delete
|
Copy
|
Mark
|
Arrange
|
B |
| CS502 |
In Digraph G=(V E) ;G Has Cycle If And Only If
|
The Dfs Forest Has Forward Edge
|
The Dfs Forest Has Back Edge
|
The Dfs Forest Has Both Back And Forward Edge
|
Bfs Forest Has Forward Edge
|
B |
| CS502 |
In Order To Move A Tower Of 6 Rings From One Peg To Another How Many Moves Are Required?
|
7
|
15
|
32
|
63
|
C |