CS101
532
CS201
225
CS301
232
CS302
174
CS304
192
CS401
224
CS402
258
CS403
228
CS408
113
CS411
121
CS502
249
CS504
268
CS601
679
CS604
381
CS605
261
CS607
184
CS609
230
CS610
300
CS614
100
CS703
65
| Code | Question | Option A | Option B | Option C | Option D | Answer | |
|---|---|---|---|---|---|---|---|
| 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 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 | Which Sorting Algorithm Is Faster | O (N Log N) | O N^2 | O (N+K) | O N^3 | C | |
| CS502 | Which Sorting Algorithm Is Faster ? | O (N Log N) | O N^2 | O (N+K) | O N^3 | C | |
| CS502 | Which Sorting Algorithn Is Faster | O(N^2) | O(Nlogn) | O(N+K) | O(N^3) | B | |
| 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 | Which Statement Is True? | If A Dynamic-Programming Problem Satisfies The Optimal-Substructure Property Then A Locally Optimal Solution Is Globally Optimal | If A Greedy Choice Property Satisfies The Optimal-Substructure Property Then A Locally Optimal Solution Is Globally Optimal | Both Of Above | None Of Above | B | |
| 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 | 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 |