|
CS502
|
There Are A Number Of Well-Known ___________ O(N^2) Sorting Algorithms
|
Fast
|
Slow
|
Na
|
Na
|
B
|
|
CS502
|
In Particular “Large Enough” Means That The Number Of Items Is At Least Some Fixed Constant Fraction Of N (E.G. N/2 N/3)
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
A Heap Is A Left-Complete Binary Tree That Conforms To The ___________
|
Increasing Order Only
|
Decreasing Order Only
|
Heap Order
|
(Log N) Order
|
C
|
|
CS502
|
Brute-Force Algorithm Is Defined As It Is A Very General Problemsolving
Technique That Consists Of Systematically Enumerating All Possible Candidates For The Solution And Checking Whether Each Candidate Satisfies The Problems Statement
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
It Is Possible To Sort Without Making Comparisons
|
True
|
False
|
Na
|
An
|
A
|
|
CS502
|
An Optimization Problem Is One In Which You Want To Find
|
Not A Solution
|
An Algorithm
|
Good Solution
|
The Best Solution
|
D
|
|
CS502
|
Which Sorting Algorithn Is Faster
|
O(N^2)
|
O(Nlogn)
|
O(N+K)
|
O(N^3)
|
B
|
|
CS502
|
The Huffman Codes Provide A Method Of Encoding Data Inefficiently When Coded Using Ascii Standard
|
True
|
False
|
Na
|
Na
|
B
|
|
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
|
Back Edge Is ___________
|
(U V) Where V Is An Ancestor Of U In The Tree
|
(U V) Where U Is An Ancestor Of V In The Tree
|
(U V) Where V Is Predecessor Of U In The Tree
|
None Of The Given
|
A
|
|
CS502
|
Suppose The Amount Of Data Recorded In An Organization Is Doubled Every Year This Is Called?
|
Linear
|
Quadratic
|
Exponential
|
Logarithmic
|
C
|
|
CS502
|
Suppose We Have Two Problems A And B .Problem A Is Polynomial-Time Reducible And Problem B Is Np-Complete. If We Reduce Problem A Into B Then Problem A Becomes Npcomplete
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
In The Analysis Of Selection Algorithm We Eliminate A Constant Fraction Of The Array With Each Phase; We Get The Convergent ___________ Series In The Analysis
|
Linear
|
Arithmetic
|
Geometric
|
Exponent
|
D
|
|
CS502
|
Although It Requires More Complicated Data Structures Prims Algorithm For A Minimum Spanning Tree Is Better Than Kruskals When The Graph Has A Large Number Of Vertices
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Continuation 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
|
Which Sorting Algorithm Is Faster ?
|
O (N Log N)
|
O N^2
|
O (N+K)
|
O N^3
|
C
|
|
CS502
|
If N Is Not Very Large Then Almost Any Algorithm Be Fast
|
May
|
May Be Not
|
Will
|
None
|
B
|
|
CS502
|
In The Clique Cover Problem For Two Vertices To Be In The Same Group They Must Be Apart From Each Other
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Ideally X (Pivot) Should Have A Rank That Is Neither Too Large Or Too Small
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Although It Requires More Complicated Data Structures Prims Algorithm For A Minimum Spanning Tree Is Better Than Kruskals When The Graph Has A Large Number Of Vertices
|
True
|
False
|
Na
|
Na
|
A
|