|
CS502
|
For The Sieve Technique We Take Time
|
T(Nk)
|
T(N / 3) 4
|
N^2
|
N/3
|
A
|
|
CS502
|
___________ Is The Average Running Time Over All Inputs Of Size N. Let P(I) Denote The Probability Of Seeing This Input. The Average-Case Time Is The Weighted Sum Of Running Times With Weights
|
Worst-Case Time
|
Average-Case Time
|
Constant-Case Time
|
None
|
B
|
|
CS502
|
Central Tendency Of A Set Is Useful When The Distribution Of Values Is __________
|
Skewed
|
Not Skewed
|
Highly Skewed
|
Straight
|
C
|
|
CS502
|
The Greedy Part Of The Huffman Encoding Algorithm Is To First Find Two Nodes With Larger Frequency
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Abu Ja’Far Mohammad Ibn Musa Al-Khowarizmi Was Born In The Eighth Century At Khwarizm (Kheva) In__________
|
Iraq
|
Iran
|
Uzbekistan
|
Turkey
|
C
|
|
CS502
|
This Follows From The Fact That Dominance Relation Is ___________
|
Symmetric
|
Transitive
|
Non-Transitive
|
None
|
B
|
|
CS502
|
Al-Khwarizmi’S Work Was Written In A Book Titled Al Kitab Almukhatasar Fi Hisab Al-Jabr Wa’L-Muqabalah (The Compendious Book On Calculation By Completion And Balancing)__________
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
For The Sieve Technique We Solve The Problem
|
Recursively
|
Mathematically
|
Accurately
|
Precisely
|
A
|
|
CS502
|
In Sorting We Are Given An Array A[1..N] Of N Numbers We Are To Reorder These Elements Into Increasing (Or Decreasing) Order
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Let Us Say We Have An Algorithm That Carries Out N^2 Operations For An Input Of Size N. Let Us Say That A Computer Takes 1 Microsecond (1/1000000 Second) To Carry Out One Operation. How Long Does The Algorithm Run For An Input Of Size 3000?
|
90 Seconds
|
9 Seconds
|
0.9 Seconds
|
0.09 Seconds
|
B
|
|
CS502
|
Which Sorting Algorithm Is Faster
|
O (N Log N)
|
O N^2
|
O (N+K)
|
O N^3
|
C
|
|
CS502
|
Using Ascii Standard The Strings |Abababababab| Will Be Encoded With
|
64
|
96
|
128
|
256
|
B
|
|
CS502
|
Sorting Is One Of The Few Problems Where Provable __________ Bonds Exits On How Fast We Can Sort
|
Lower
|
Upper
|
Average
|
Log N
|
A
|
|
CS502
|
Divide-And-Conquer As Breaking The Problem Into A Small Number Of
|
Smaller Sub Problems
|
Pivot
|
Sieve
|
Selection
|
A
|
|
CS502
|
The Rank Of An Element Is Its Final Position If The Set Is Sorted__________
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
What Is The Time Complexity To Extract A Vertex From The Priority Queue In Prim’S Algorithm?
|
Log (V)
|
V.V
|
E.E
|
Log €
|
A
|
|
CS502
|
When N Is Large N^2 Term Will Be Much Larger Than The N Term And Will Dominate The Running Time
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Using Ascii Standard The String Abacdaacac Will Be Encoded With 320 Bits
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Depth First Search Is Shortest Path Algorithm That Works On Un-Weighted Graphs
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
In Quick Sort We Don’T Have The Control Over The Sizes Of Recursive Calls
|
True
|
False
|
Less Information To Decide
|
Either True Or False
|
A
|