|
CS502
|
Ancient Roman Politicians Followed An Important Principle Of Good Algorithm Design Known As Divide And Conquer Strategy
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Which Of The Following Statement(S) Is/Are Correct? (A) O(N Log N + N2) = O(N2) (B) O(N Log N + N2) = O(N2 Log 2N) © O(C N2) = O(N2) Where C Is A Constant (D) O(C N2) = O© Where C Is A Constant € O© = O(1) Where C Is A Constant
|
Only (A) & (E)
|
Both (C) And (E)
|
All Of These
|
Non Of These
|
A
|
|
CS502
|
Which May Be A Stable Sort?
|
Merger
|
Insertion
|
Both Above
|
None Of The Above
|
C
|
|
CS502
|
Cross Edge Is ___________
|
(U V) Where U Is Ancestor Of V And V Is Not Descendent Of U
|
(U V) Where V Is A Proper Descendant Of U In The Tree
|
(U V) Where U And V Are Not Ancestor Or Descendent Of One Another
|
(U V)Where U And V Are Either Ancerstor Or Descendent Of Each Other
|
C
|
|
CS502
|
We Will Say That The Worst-Case Running Time Is T(N^2). This Is Called __________
|
The Asymptotic Growth Rate Of The Function
|
Itteration Growth Rate Of The Function
|
Recursive Growth Rate Of The Function
|
None
|
A
|
|
CS502
|
In Order To Move A Tower Of 6 Rings From One Peg To Another How Many Moves Are Required?
|
7
|
15
|
32
|
63
|
C
|
|
CS502
|
Dijkestra S Single Source Shortest Path Algorithm Works If All Edges Weights Are Nonnegative And There Are No Negative Cost Cycles
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
The Appropriate Big Thita Classification Of The Given Function. F(N) = 4N2 + 97N + 1000 Is
|
?(N)
|
O(2^N)
|
O(N^2)
|
O(N^2Logn)
|
C
|
|
CS502
|
The Huffman Algorithm Finds A (N) __________ Solution
|
Optimal
|
Non-Optimal
|
Exponential
|
Polynomial
|
A
|
|
CS502
|
What Will Be The Total Number Of Max Comparisons If We Run Brute-Force Maxima Algorithm With N Elements?
|
N^2
|
N^N/2
|
N
|
N^8
|
A
|
|
CS502
|
Like A Program An Algorithm Is A Mathematical Entity Which Is Not Independent Of A Specific Programming Language Machine Or Compiler
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Shortest Path Problems Can Be Solved Efficiently By Modeling The Road Map As A Graph
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
If You Find Yourself In Maze The Better Traversel Approach Will Be
|
Bfs
|
Bfs And Dfs Both Are Valid
|
Level Order
|
Dfs
|
D
|
|
CS502
|
A Ram Is An Idealized Machine With__________
|
An Infinitely Large Random-Access Memory
|
With Instructions Are Executed One-By-One
(There Is No Parallelism)
|
Single Processor Machine
|
All
|
D
|
|
CS502
|
The Minimum Is Of Rank And The Maximum Is Of Rank .
|
0 1
|
0 N
|
1 N
|
None
|
C
|
|
CS502
|
After Partitioning Array In Quick Sort Pivot Is Placed In A Position Such That
|
Values Smaller Than Pivot Are On Left And Larger Than Pivot Are On Right
|
Values Larger Than Pivot Are On Left And Smaller Than Pivot Are On Right
|
Pivot Is The First Element Of Array
|
Pivot Is The Last Element Of Array
|
A
|
|
CS502
|
In The Worst Case Time ___________ Run In O(N2)
|
Bubble Sort
|
Selection Sort
|
Insertion Sort
|
All Of The Above
|
D
|
|
CS502
|
The Term “Coloring” Came Form The Original Application Which Was In Architectural Design
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
In A Heap The Parent Has A Key Larger Than Or Equal Both Of Its Children
|
(Max) Heap
|
(Min) Heap
|
Na
|
Na
|
A
|
|
CS502
|
Suppose That A Graph G = (V E) Is Implemented Using Adjacency Lists. What Is The Complexity Of A Breadth-First Traversal Of G?
|
O(|V |^2)
|
O(|V | |E|)
|
O(|V |^2|E|)
|
O(|V | + |E|)
|
B
|