|
CS502
|
If There Are O (N^2) Entries In Edit Distance Matrix Then The Total Running Time Is ___________
|
O (1)
|
O (N^2)
|
O (N)
|
O (N Log N)
|
B
|
|
CS502
|
In The Analysis Of Selection Algorithm We Make A Number Of Passes In Fact It Could Be As Many As
|
T(N)
|
T(N / 2)
|
Log N
|
N / 2 + N / 4
|
C
|
|
CS502
|
Which Statement Is True (I) The Running Time Of Bellman-Ford Algorithm Is T (Ve) (Ii) Both Dijkstra’S Algorithm And Bellman-Ford Are Based On Performing Repeated Relaxations (Iii) The 0-1 Knapsack Problem Is Hard To Solve
|
Only I
|
Only Iii
|
Both I And Iii
|
All Of These
|
D
|
|
CS502
|
Counting Sort Has Time Complexity
|
O(N)
|
O(N+K)
|
O(K)
|
O(Nlogn)
|
A
|
|
CS502
|
Mergesort Is A Stable Algorithm But Not An In-Place Algorithm
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
We Write Out The Loops As Summations And Then Solve The Summations
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
There Are No Formal Rules To The Syntax Of The Pseudo Code
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
An ___________ Is Thus A Sequence Of Computational Steps That
Transform The Input Into Output
|
Data Structure
|
Data Process
|
Algorithm
|
Program
|
C
|
|
CS502
|
Merge Sort Is Stable Sort But Not An In-Place Algorithm
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
We Assume That In Ram Machine Each Basic Operation Takes The __________ Constant Time To Execut
|
Same
|
Different
|
Constant
|
None
|
A
|
|
CS502
|
Kruskals Algorithm (Choose Best Non-Cycle Edge) Is Better Than Prims (Choose Best Tree Edge) When The Graph Has Relatively Few Edges
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
If There Are O(N2) Entries In Edit Distance Matrix Then The Total Running Time Is
|
O(1)
|
O(N^2)
|
O(N)
|
O(N Log N)
|
B
|
|
CS502
|
In Which Order We Can Sort?
|
Increasing Order Only
|
Decreasing Order Only
|
Increasing Order Or Decreasing Order
|
Both At The Same Time
|
C
|
|
CS502
|
Using Ascii Standard The String Abacdaacac Will Be Encoded With 100 Bits
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Merge Sort Is Stable Sort But Not An In-Place Algorithm
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
The Difference Between Prim S Algorithm And Dijkstra S Algorithm Is That Dijkstra S Algorithm Uses A Same Key
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Analysis Of Selection Sort Ends Up With
|
T(N)
|
T(1/1+N)
|
T(N/2)
|
T((N/2) +N)
|
A
|
|
CS502
|
Np-Complete Problem Are Those For Which Algorithms Are Known But No One Knows For Sure Whether Efficient Solutions Might Exist
|
Efficient
|
No Efficient
|
Ordinary
|
None
|
B
|
|
CS502
|
The Sieve Technique Is A Special Case Where The Number Of Sub Problems Is Just
|
1
|
5
|
Few
|
Many
|
A
|
|
CS502
|
A Ram Is An Idealized Machine With ___________ Random-Access Memory
|
256Mb
|
512Mb
|
An Infinitely Large
|
100Gb
|
C
|