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 |
We Will Say That The Worst-Case Running Time Is T(N^2). This Is Called __________
|
The Asymptotic Growth Rate Of The Function
|
Itteration Growth Rate Of The Function
|
Recursive Growth Rate Of The Function
|
None
|
A |
| CS502 |
We Write Out The Loops As Summations And Then Solve The Summations
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
What Algorithm Technique Is Used In The Implementation Of Kruskal Solution For The Mst?
|
Greedy Technique
|
Divide And Conquer Technique
|
Dynamic Programming Technique
|
The Algorithm Combines More Than One Of The Above Techniques
|
A |
| CS502 |
What General Property Of The List Indicates That The Graph Has An Isolated Vertex?
|
There Is Null Pointer At The End Of List
|
The Isolated Vertex Is Not Handled In List
|
Only One Value Is Entered In The List
|
There Is At Least One Null List
|
B |
| CS502 |
What Is Generally True Of Adjacency List And Adjacency Matrix Representations Of Graphs?
|
Lists Require Less Space Than Matrices But Take Longer To Find The Weight Of An Edge (V1 V2)
|
Lists Require Less Space Than Matrices And They Are Faster To Find The Weight Of An Edge (V1 V2)
|
Lists Require More Space Than Matrices And They Take Longer To Find The Weight Of An Edge (V1 V2)
|
Lists Require More Space Than Matrices But Are Faster To Find The Weight Of An Edge (V1 V2)
|
B |
| CS502 |
What Is The Solution To The Recurrence T(N) = T(N/2)+N
|
O(Logn)
|
O(N)
|
O(Nlogn)
|
O(N^2)
|
A |
| CS502 |
What Is The Time Complexity To Extract A Vertex From The Priority Queue In Prim’S Algorithm?
|
Log (V)
|
V.V
|
E.E
|
Log €
|
A |
| CS502 |
What Is The Total Time To Heapify?
|
?(Log N)
|
?(N Log N)
|
?(N2 Log N)
|
?(Log2 N)
|
A |
| CS502 |
What Type Of Instructions Random Access Machine (Ram) Can Execute?
|
Algebraic And Logic
|
Geometric And Arithmetic
|
Arithmetic And Logic
|
Parallel And Recursive
|
C |
| CS502 |
What Type Of Instructions Random Access Machine Can Execute?
|
Geometric And Arithmetic
|
Algebraic And Logic
|
Arithmetic And Logic
|
Parallel And Recursive
|
C |
| CS502 |
What Will Be The Total Number Of Max Comparisons If We Run Brute-Force Maxima Algorithm With N Elements?
|
N^2
|
N^N/2
|
N
|
N^8
|
A |
| CS502 |
When N Is Even For Median There Are Two Choices: __________
|
N/2
|
(N + 1)/2
|
N/2 And (N + 1)/2
|
None
|
C |
| CS502 |
When N Is Large N^2 Term Will Be Much Larger Than The N Term And Will Dominate The Running Time
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
When We Call Heapify Then At Each Level The Comparison Performed Takes Time
|
It Will Take O(1)
|
Time Will Vary According To The Nature Of Input Data
|
It Can Not Be Predicted
|
It Will Take O(Log N)
|
A |
| CS502 |
Which Is True Statement
|
Breadth First Search Is Shortest Path Algorithm That Works On Un-Weighted Graphs
|
Depth First Search Is Shortest Path Algorithm That Works On Un-Weighted Graphs
|
Both Of Above Are True
|
None Of Above Are True
|
C |
| CS502 |
Which Is True Statement In The Following
|
Kruskal Algorithm Is Multiple Source Technique For Finding Mst
|
Kruskal’S Algorithm Is Used To Find Minimum Spanning Tree Of A Graph Time Complexity Of This Algorithm Is O(Ev)
|
Both Of Above
|
Kruskals Algorithm (Choose Best Non-Cycle Edge) Is Better Than Prims (Choose Best Tree Edge) When The Graph Has Relatively Few Edges
|
D |
| CS502 |
Which May Be A Stable Sort?
|
Merger
|
Insertion
|
Both Above
|
None Of The Above
|
C |
| CS502 |
Which May Be Stable Sort
|
Bubble Sort
|
Insertion Sort
|
Both Of Above
|
None Of These
|
C |
| CS502 |
Which Of The Following Arrays Represent Descending (Max) Heaps? I. [10 7 7 2 4 6] Ii. [10 7 6 2 4 7] Iii. [10 6 7 2 4 6] Iv. [6 6 7 2 4 10]
|
Only Ii
|
Only Iv
|
Both Ii And Iv
|
Both I And Iii
|
A |
| CS502 |
Which Of The Following Sorting Algorithms Is Stable? (I) Merge Sort (Ii) Quick Sort (Iii) Heap Sort (Iv) Counting Sort
|
Only I
|
Only Ii
|
Both I And Ii
|
Both Iii And Iv
|
A |