|
CS502
|
More Generally A Is An Array Of Objects And We Sort Them Based
On One Of The Attributes - The Key Value
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
We Do Sorting To ___________
|
Keep Elements In Random Positions
|
Keep The Algorithm Run In Linear Order
|
Keep The Algorithm Run In (Log N) Order
|
Keep Elements In Increasing Or Decreasing Order
|
D
|
|
CS502
|
We Think Of Divide-And-Conquer As Breaking The Problem Into A Small Number Of Bigger Sub-Problems Which Are Then Solved Recursively
|
True
|
False
|
Na
|
Na
|
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
|
|
CS502
|
Plane-Sweep Algorithm The Inner While-Loop Execute More Than N Times Over The Entire Course Of The Algorithm
|
Can
|
Cannot
|
Na
|
Na
|
B
|
|
CS502
|
Quick Sort Is Based On Divide And Conquer Paradigm; We Divide The Problem On Base Of Pivot Element And
|
There Is Explicit Combine Process As Well To Conquer The Solutin
|
No Work Is Needed To Combine The Sub-Arrays The Array Is Already Sorted
|
Merging The Subarrays
|
None Of Above
|
A
|
|
CS502
|
Lower Bound F(N) = 8N2 + 2N - 3 Grows Asymptotically At Least As Fast As N^2
|
True
|
False
|
Na
|
Na
|
A
|
|
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
|
The Main Elements To A Divide-And-Conquer Solution Are
|
Divide: The Problem Into A Small Number Of Pieces
|
Conquer: Solve Each Piece By Applying Divide And Conquer To It Recursively
|
Combine: The Pieces Together Into A Global Solution
|
All Of The Above
|
D
|
|
CS502
|
- What Is The Total Time To Heapify?
|
O(Log N)
|
O(N Log N)
|
O(N^2 Log N)
|
O(Log^2N)
|
A
|
|
CS502
|
Quick Sort Is ___________
|
Stable & In Place
|
Not Stable But In Place
|
Stable But Not In Place
|
Some Time Stable & Some Times In Place
|
C
|
|
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
|
The Difference Between Prim’S Algorithm And Dijkstra’S Algorithm Is That Dijkstra’S Algorithm Uses A Different Key
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Iteration Powerful Technique For Solving Recurrences
|
Is A Not A
|
Might Be
|
Is A Very
|
None
|
C
|
|
CS502
|
It Is Called Heapify. (In Other Books It Is Sometimes Called Sifting Down.)
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Thus The Rank Of An Element Is Its Final Position If The Set Is
|
Sorted
|
Unsorted
|
Unchanged
|
Same
|
A
|
|
CS502
|
Need To Synchronize Data Upon Updation Is Called?
|
Data Limitation
|
Data Manipulation
|
Data Coherence
|
Data Replication
|
C
|
|
CS502
|
Due To Left Complete Nature Of Binary Tree The Heap Can Be Stored In
|
Arrays
|
Structures
|
Link List
|
Stack
|
A
|
|
CS502
|
The Knapsack Problem Belongs To The Domain Of __________ Problems
|
Optimization
|
Np Complete
|
Linear Solution
|
Sorting
|
A
|
|
CS502
|
A Point P Is Not Said To Be Dominated By Point Q If Q.X = P.X And Q.Y = P.Y
|
True
|
False
|
Na
|
Na
|
A
|