|
CS502
|
The Merge Sort Algorithm Works By __________
|
Divide: Split A Down The Middle Into Two Subsequences Each Of Size Roughly N/2
|
Conquer: Sort Each Subsequence By Calling Merge Sort Recursively On Each
|
Combine: Merge The Two Sorted Subsequences Into A Single Sorted List
|
All Of The Above
|
D
|
|
CS502
|
This Approach Of Solving Geometric Problems By Sweeping A Line Across The Plane Is Called __________
|
Plane Sweep
|
Brute Force
|
Na
|
Na
|
A
|
|
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
|
The Reason For Introducing Sieve Technique Algorithm Is That It Illustrates A Very Important Special Case Of
|
Divide-And-Conquer
|
Decrease And Conquer
|
Greedy Nature
|
2-Dimension Maxima
|
A
|
|
CS502
|
Relational Databases Allow You To Navigate The Data In Direction That Is Appropriate Using The Primary Foreign Key Structure?
|
Forward
|
One
|
Backward
|
Any
|
D
|
|
CS502
|
Upper Bound F(N) Grows No Faster Asymptotically Than N^2
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
The Greedy Part Of The Huffman Encoding Algorithm Is To First Find Two Nodes With Character Frequency
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Continuation/Counting Sort Is Suitable To Sort The Elements In Range 1 To K
|
K Is Large
|
K Is Not Known
|
K May Be Small Or Large
|
K Is Small
|
D
|
|
CS502
|
What Is The Total Time To Heapify?
|
?(Log N)
|
?(N Log N)
|
?(N2 Log N)
|
?(Log2 N)
|
A
|
|
CS502
|
An In Place Sorting Algorithm Is One That Uses Arrays For Storage
|
Two Dimensional Arrays
|
More Than One Array
|
No Additional Array
|
None Of The Above
|
C
|
|
CS502
|
A Dense Undirected Graph Is
|
A Graph In Which E = O(V^2)
|
A Graph In Which E = O(V)
|
A Graph In Which E = O(Log V)
|
All Items Above May Be Used To Characterize A Dense Undirected Graph
|
A
|
|
CS502
|
Shortest Path Problems Can Be Solved Efficiently By Modeling The Road Map As A Graph
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
There Is One Principal Operation For Maintaining The Heap Property
|
Heapify Procedure
|
Heapify Program
|
Heapify Routine
|
None
|
A
|
|
CS502
|
One Of The Clever Aspects Of Heaps Is That They Can Be Stored In Arrays Without Using Any ___________
|
Pointers
|
Constants
|
Variables
|
Functions
|
A
|
|
CS502
|
Merge-Sort( Array A Int P Int R)
1 If (P < R)
2 Then
3 Q ? (P + R)/2
4 Merge-Sort(A P Q) // Sort A[P..Q]
5 Merge-Sort(A Q + 1 R) // Sort A[Q + 1..R]
6 Merge(A P Q R) // Merge The Two Pieces
|
True
|
False
|
Nan
|
Na
|
A
|
|
CS502
|
A Point P Is Said To Dominated By Point Q If P.X = Q.X And P.Y = Q.Y
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
In Sieve Technique We Do Not Know Which Item Is Of Interest
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Consider The Following Algorithm: Factorial (N){ If (N=1) Return 1 Else Return (N * Factorial(N-1)) { Recurrence For The Following Algorithm Is:
|
T(N) = T(N-1) +1
|
T(N) = Nt(N-1) +1
|
T(N)= T(N-1) +N
|
T(N)=T(N(N-1)) +1
|
D
|
|
CS502
|
Which May Be Stable Sort
|
Bubble Sort
|
Insertion Sort
|
Both Of Above
|
None Of These
|
C
|
|
CS502
|
If N Is Odd Then The Median Is Defined To Be Element Of Rank
|
N
|
N-1
|
(N+1)/2
|
N/2
|
C
|