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 | Iteration Powerful Technique For Solving Recurrences | Is A Not A | Might Be | Is A Very | None | C | |
| 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 | 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 | 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 | 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 | Lower Bound F(N) = 8N2 + 2N - 3 Grows Asymptotically At Least As Fast As N^2 | True | False | Na | Na | A | |
| CS502 | Maximum Number Of Vertices In A Directed Graph May Be |V2| | True | False | Na | Na | A | |
| CS502 | Medians Are Useful As A Measures Of The __________ Of A Set | Mode | Average | Probability | Central Tendency | D | |
| CS502 | Memorization Is? | To Store Previous Results For Future Use | To Avoid This Unnecessary Repetitions By Writing Down The Results Of Recursive Calls And Looking Them Up Again If We Need Them Later | To Make The Process Accurate | None Of The Above | B | |
| CS502 | Merge Of Two Lists Of Size M/2 To A List Of Size M Takes T(M) Time Which We Will Just Write As M | True | False | Na | Na | A | |
| CS502 | Merge Sort Is Stable Sort But Not An In-Place Algorithm | True | False | Na | Na | A | |
| CS502 | Merge Sort Is Stable Sort But Not An In-Place Algorithm | True | False | Na | Na | A | |
| CS502 | Merge Sort Requires Extra Array Storage | True | False | Na | Na | A | |
| CS502 | Mergesort Is A Stable Algorithm But Not An In-Place Algorithm | True | False | Na | Na | A | |
| CS502 | Merge-Sort( Array A Int P Int R) 1 If (P < R) 2 Then 3 Q ? (P + R)/2 4 Merge-Sort(A P Q) // Sort A[P..Q] 5 Merge-Sort(A Q + 1 R) // Sort A[Q + 1..R] 6 Merge(A P Q R) // Merge The Two Pieces | True | False | Nan | Na | A | |
| CS502 | More Generally A Is An Array Of Objects And We Sort Them Based On One Of The Attributes - The Key Value | True | False | Na | Na | A | |
| CS502 | Naturally Evolving Architecture Occurred When An Organization Had A Approach To Handling The Whole Process Of Hardware And Software Architecture? | Good | Relaxed | Not Relaxed | None | B | |
| CS502 | Need To Synchronize Data Upon Updation Is Called? | Data Limitation | Data Manipulation | Data Coherence | Data Replication | C | |
| CS502 | Node Of A B- Tree Is Stored In Memory Block And Traversing A B-Tree Involves Page Faults? | O (N^2) | O (N) | O (N Log N) | O (Log N) | D | |
| CS502 | Non-Optimal Or Greedy Algorithm For Money Change Takes__________ | O(K) | O(Kn) | O(2K) | O(N) | A |