|
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
|
The Analysis Of Selection Algorithm Shows The Total Running Time Is Indeed __________In N
|
Arithmetic
|
Geometric
|
Linear
|
Orthogonal
|
C
|
|
CS502
|
Which Statement Is True?
|
If A Dynamic-Programming Problem Satisfies The Optimal-Substructure Property Then A Locally Optimal Solution Is Globally Optimal
|
If A Greedy Choice Property Satisfies The Optimal-Substructure Property Then A Locally Optimal Solution Is Globally Optimal
|
Both Of Above
|
None Of Above
|
B
|
|
CS502
|
Analyzig Algorithms In Terms Of The Amount Of Computational Resources That The Algorithm Requires. These Resources Include Mostly __________
|
Running Time
|
Memory
|
Running Time And Memory
|
None
|
C
|
|
CS502
|
The Input To The Data Warehouse Can Come From Oltp Or Transactional Systems Or Other Third Party Databases
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
We Introduced A Brute-Force Algorithm That Ran In ___________
|
O(N) Time
|
O(N^2) Time
|
O(Nlogn) Time
|
O(N^3) Time
|
B
|
|
CS502
|
Gives Total View Of An Organization?
|
Oltp
|
Olap
|
Data Warehousing
|
Database
|
C
|
|
CS502
|
Using Ascii Standard The String Abacdaacac Will Be Encoded With __________ Bits
|
80
|
100
|
160
|
320
|
A
|
|
CS502
|
The Sieve Technique Works In __________ As Follows
|
Phases
|
Numbers
|
Integers
|
Routines
|
A
|
|
CS502
|
If A Problem Is Np-Complete It Must Also Be In Np
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Consider The Following Code: For(J=1; J<N;J++) For(K=1; K<15;K++) For(L=5; L<N; L++) { Do_Something_Constant(); } What Is The Order Of Execution For This Code
|
O(N)
|
O(N^3)
|
O(N2 Log N)
|
O(N^2)
|
A
|
|
CS502
|
One Of The Clever Aspects Of __________ Is That They Can Be Stored In Arrays Without Using Any Pointers
|
Lists
|
Bst Trees
|
Heaps
|
None
|
C
|
|
CS502
|
We Store The Tree Nodes In Level-Order Traversal In Heap Sort
|
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
|
Assume That A[1..I - 1] Have Already Been Sorted. Insert A[I] Into Its Proper Position In This Sub Array. Create This Position By Shifting All Larger Elements To The Right.It Is Called ___________
|
Bubble Sort
|
Selection Sort
|
Merge Sort
|
None
|
D
|
|
CS502
|
Access To Nodes Involves Simple Arithmetic Operations:
Shown In Below
Left(I) : Returns 2I Index Of Left Child Of Node I.
Right(I) : Returns 2I + 1 The Right Child.
Parent(I) : Returns Bi/2C The Parent Of I.
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
The Root Is At Position 1 Of The Array
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
In Stable Sorting Algorithm
|
If Duplicate Elements Remain In The Same Relative Position After Sorting
|
One Array Is Used
|
More Than One Arrays Are Required
|
Duplicating Elements Not Handled
|
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
|
The Running Time Of Quick Sort Depends Heavily On The Selection Of
|
No Of Inputs
|
Arrangement Of Elements In Array
|
Size O Elements
|
Pivot Element
|
D
|