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 |
Dynamic Programming Algorithms Need To Store The Results Of Intermediate Subproblems
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Dynamic Programming Algorithms Need To Store The Results Of Intermediate Sub-Problems
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Dynamic Programming Uses A Top-Down Approach
|
True
|
False
|
Na
|
Na
|
B |
| CS502 |
Edge (U V) Is A Forward Edge If
|
U Is A Proper Descendant Of V In The Tree
|
V Is A Proper Descendant Of U In The Tree
|
Both Of These
|
None Of These
|
B |
| CS502 |
Floor And Ceilings __________ A Pain To Deal With
|
Are Not
|
Are
|
Sometime
|
None
|
B |
| CS502 |
Floyd-Warshall Algorithm Is A Dynamic Programming Algorithm; The Genius Of The Algorithm Is In The Clever Recursive Formulation Of The Shortest Path Problem
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
For Chain Matrix Multiplication We Can Not Use Divide And Conquer Approach Because
|
We Do Not Know The Optimum K
|
We Use Divide And Conquer For Sorting Only
|
We Can Easily Perform It In Linear Time
|
Size Of Data Is Not Given
|
A |
| CS502 |
For N = 1 000 000 If Plane-Sweep Takes 1 Second The Bruteforce Will Take About
|
14 Hours
|
14 Minutes
|
14 Second
|
None
|
A |
| CS502 |
For The Heap Sort Access To Nodes Involves Simple __________ Operations
|
Arithmetic
|
Binary
|
Algebraic
|
Logarithmic
|
A |
| CS502 |
For The Heap Sort We Store The Tree Nodes In
|
Level-Order Traversal
|
In-Order Traversal
|
Pre-Order Traversal
|
Post-Order Traversal
|
A |
| CS502 |
For The Sieve Technique We Solve The Problem
|
Recursively
|
Mathematically
|
Accurately
|
Precisely
|
A |
| CS502 |
For The Sieve Technique We Take Time
|
T(Nk)
|
T(N / 3) 4
|
N^2
|
N/3
|
A |
| CS502 |
Forward Edge Is ___________
|
(U V) Where U Is A Proper Descendent Of V In The Tree
|
(U V) Where V Is A Proper Descendant Of U In The Tree
|
(U V) Where V Is A Proper Ancestor Of U In The Tree
|
None Of The Given
|
B |
| CS502 |
Function Is Given Like 4N^4+ 5N^3+N What Is The Run Time Of This
|
Theata(N^4)
|
Theata(N^3)
|
Theata(4N^4+ 5N^3)
|
Theata(4N^4+ 5N^3)
|
A |
| CS502 |
Given A Finite Sequence Of Values A1 A2 . . . An Their Sum A1 + A2 + . . . + An Is Expressed In Summation Notation As Sigma (I=1 --> N)Ai
|
True
|
False
|
Na
|
Na
|
A |
| CS502 |
Given A Set A Of N Distinct Numbers And An Integer K 1 = K = N Output The Element Of A Of Rank K.This Problem Is Of Type
|
Merge Sort
|
Selection Sort
|
Maximal
|
None
|
B |
| CS502 |
Given A Set Of N Points P = {P1 P2 . . . Pn} In 2-Space A Point Is Said To Be ___________ If It Is Not Dominated By Any Other Point In P
|
Maximal
|
Mininal
|
Average
|
None
|
A |
| CS502 |
Gives Total View Of An Organization?
|
Oltp
|
Olap
|
Data Warehousing
|
Database
|
C |
| CS502 |
Heaps Can Be Stored In Arrays Without Using Any Pointers; This Is Due To The __________ Nature Of The Binary Tree
|
Left-Complete
|
Right-Complete
|
Tree Nodes
|
Tree Leaves
|
A |
| CS502 |
How Many Elements Do We Eliminate In Each Time For The Analysis Of Selection Algorithm?
|
N / 2 Elements
|
(N / 2) + N Elements
|
N / 4 Elements
|
N Elements
|
D |