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 | In Particular “Large Enough” Means That The Number Of Items Is At Least Some Fixed Constant Fraction Of N (E.G. N/2 N/3) | True | False | Na | Na | A | |
| CS502 | In Particular Is It Possible To Solve The Selections Problem In O(N) Time? | No | Yes | Yes. However The Solution Is Far From Obvious | Na | C | |
| CS502 | In Prim’S Algorithm The Additional Information Maintained By The Algorithm Is The Length Of The Shortest Edge From Vertex V To Points Already In The Tree | True | False | Na | Na | B | |
| CS502 | In Quick Sort Constants Hidden In T(N Log N) Are | Large | Medium | Small | Not Known | C | |
| 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 | |
| CS502 | In Sieve Technique We Do Not Know Which Item Is Of Interest | True | False | Na | Na | 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 | In Stable Sorting Algorithm | If Duplicate Elements Remain In The Same Relative Position After Sorting | One Array Is Used | More Than One Arrays Are Required | Duplicating Elements Not Handled | A | |
| CS502 | In The Analysis Of Selection Algorithm We Eliminate A Constant Fraction Of The Array With Each Phase; We Get The Convergent ___________ Series In The Analysis | Linear | Arithmetic | Geometric | Exponent | D | |
| CS502 | In The Analysis Of Selection Algorithm We Make A Number Of Passes In Fact It Could Be As Many As | T(N) | T(N / 2) | Log N | N / 2 + N / 4 | C | |
| CS502 | In The Clique Cover Problem For Two Vertices To Be In The Same Group They Must Be Adjacent To Each Other | True | False | Na | Na | A | |
| CS502 | In The Clique Cover Problem For Two Vertices To Be In The Same Group They Must Be Apart From Each Other | True | False | Na | Na | B | |
| CS502 | In The Clique Cover Problem For Two Vertices To Be In The Same Group They Must Be__________Each Other | Apart From | Far From | Near To | Adjacent To | D | |
| CS502 | In The Worst Case Time ___________ Run In O(N2) | Bubble Sort | Selection Sort | Insertion Sort | All Of The Above | D | |
| CS502 | In Which Order We Can Sort? | Increasing Order Only | Decreasing Order Only | Increasing Order Or Decreasing Order | Both At The Same Time | C | |
| CS502 | Is An Application Of Information & Data | Intelligence | Education | Knowledge | Power | C | |
| CS502 | Is It Possible To Sort Without Making Comparisons? | True | False | Na | Na | A | |
| CS502 | It Is Called Heapify. (In Other Books It Is Sometimes Called Sifting Down.) | True | False | Na | Na | A | |
| CS502 | It Is Possible To Sort Without Making Comparisons | True | False | Na | An | A | |
| CS502 | It Requires More Complicated Data Structures Prims Algorithm For A Minimum Spanning Tree Is Better Than Kruskals When The Graph Has A Large Number Of Vertices | True | False | Na | Na | A |