|
CS502
|
Which Of The Shortest Path Algorithms Would Be Most Appropriate For Finding Paths In The Graph With Negative Edge Weights And Cycles? I.Dijkstra’S Algorithm Ii. Bellman-Ford Algorithm Iii. Floyd Warshall Algorithm
|
Only I
|
Only Ii
|
Only Iii
|
Both Ii & Iii
|
D
|
|
CS502
|
A Point P In 2-Dimensional Space Be Given By Its Integer Coordinates P = (P.X P.Y)
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Sorting Takes Time
|
O(N)
|
O(N^2)
|
O(N Log N)
|
None
|
C
|
|
CS502
|
Bellman-Ford Allows Negative Weights Edges And Negative Cost Cycles
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Compilers Operating Systems Databases Artificial Intelligence Computer Graphics And Vision Etc. Use Algorithm
|
True
|
False
|
Na
|
Na
|
T
|
|
CS502
|
For The Heap Sort Access To Nodes Involves Simple __________ Operations
|
Arithmetic
|
Binary
|
Algebraic
|
Logarithmic
|
A
|
|
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
|
You Have An Adjacency List For G What Is The Time Complexity To Compute Graph Transpose G^T ?
|
(V+E)
|
(V E)
|
(V)
|
(V^2)
|
A
|
|
CS502
|
Continuing Sort Has Time Complexity Of ?
|
O(N)
|
O(N+K)
|
O(Nlogn)
|
O(K)
|
A
|
|
CS502
|
A Very Important Special Case Of Divide-And-Conquer Which I Call The Sieve Technique
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Dynamic Programming Uses A Top-Down Approach
|
True
|
False
|
Na
|
Na
|
B
|
|
CS502
|
Knapsack Problem Is Called A “0-1” Problem Because
|
Each Item Must Be Entirely Accepted Or Rejected
|
One Item Must Be Entirely Accepted Or Rejected
|
Zero Item Must Be Entirely Accepted Or Rejected
|
None Of These
|
A
|
|
CS502
|
For The Heap Sort We Store The Tree Nodes In
|
Level-Order Traversal
|
In-Order Traversal
|
Pre-Order Traversal
|
Post-Order Traversal
|
A
|
|
CS502
|
Define The Of An Element To Be One Plus The Number Of Elements That Are Smaller
|
Rank
|
Degree
|
Na
|
Na
|
A
|
|
CS502
|
When N Is Even For Median There Are Two Choices: __________
|
N/2
|
(N + 1)/2
|
N/2 And (N + 1)/2
|
None
|
C
|
|
CS502
|
You Have An Adjacency List For G What Is The Time Complexity To Compute Graph Transpose G^T.?
|
(V+E)
|
? (V E)
|
? (V)
|
? (V^2)
|
A
|
|
CS502
|
Dijkstra’S Algorithm Is Operates By Maintaining A Subset Of Vertices
|
True
|
False
|
Na
|
Na
|
A
|
|
CS502
|
Which Is True Statement
|
Breadth First Search Is Shortest Path Algorithm That Works On Un-Weighted Graphs
|
Depth First Search Is Shortest Path Algorithm That Works On Un-Weighted Graphs
|
Both Of Above Are True
|
None Of Above Are True
|
C
|
|
CS502
|
Which Of The Following Arrays Represent Descending (Max) Heaps? I. [10 7 7 2 4 6] Ii. [10 7 6 2 4 7] Iii. [10 6 7 2 4 6] Iv. [6 6 7 2 4 10]
|
Only Ii
|
Only Iv
|
Both Ii And Iv
|
Both I And Iii
|
A
|
|
CS502
|
If You Find Yourself In Maze The Better Traversal Approach Will Be
|
Bfs
|
Dfs
|
Level Order
|
Bfs And Dfs Both Are Valid
|
B
|