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 | There Are A Number Of Well-Known ___________ O(N^2) Sorting Algorithms | Fast | Slow | Na | Na | B | |
| CS502 | There Are No Formal Rules To The Syntax Of The Pseudo Code | True | False | Na | Na | A | |
| CS502 | There Is One Principal Operation For Maintaining The Heap Property | Heapify Procedure | Heapify Program | Heapify Routine | None | A | |
| CS502 | This Approach Of Solving Geometric Problems By Sweeping A Line Across The Plane Is Called __________ | Plane Sweep | Brute Force | Na | Na | A | |
| CS502 | This Follows From The Fact That Dominance Relation Is ___________ | Symmetric | Transitive | Non-Transitive | None | B | |
| CS502 | This Is Written As “F(N) E O(G(N))” That Is F(N) And G(N) Are Asymptotically Equivalent. This Means That They Have Essentially The Growth Rates For Large N | Different | Same | Na | Na | B | |
| CS502 | Thus The Rank Of An Element Is Its Final Position If The Set Is | Sorted | Unsorted | Unchanged | Same | A | |
| CS502 | Thus The Smallest Key Is In The Root In A___________ ; In The ___________The Largest Is In The Root | Max Heap Min Heap | Min Heap Max Heap | Max Heap Max Heap | Min Heap Min Heap | B | |
| CS502 | Upper Bound F(N) Grows No Faster Asymptotically Than N^2 | True | False | Na | Na | A | |
| CS502 | Using Ascii Standard The String Abacdaacac Will Be Encoded With __________ Bits | 80 | 100 | 160 | 320 | A | |
| CS502 | Using Ascii Standard The String Abacdaacac Will Be Encoded With 100 Bits | True | False | Na | Na | B | |
| CS502 | Using Ascii Standard The String Abacdaacac Will Be Encoded With 160 Bits | True | False | Na | Na | B | |
| CS502 | Using Ascii Standard The String Abacdaacac Will Be Encoded With 32 Bytes | True | False | Na | Na | B | |
| CS502 | Using Ascii Standard The String Abacdaacac Will Be Encoded With 320 Bits | True | False | Na | Na | B | |
| CS502 | Using Ascii Standard The Strings |Abababababab| Will Be Encoded With | 64 | 96 | 128 | 256 | B | |
| CS502 | We Assume That In Ram Machine Each Basic Operation Takes The __________ Constant Time To Execut | Same | Different | Constant | None | A | |
| CS502 | We Do Sorting To ___________ | Keep Elements In Random Positions | Keep The Algorithm Run In Linear Order | Keep The Algorithm Run In (Log N) Order | Keep Elements In Increasing Or Decreasing Order | D | |
| CS502 | We Introduced A Brute-Force Algorithm That Ran In ___________ | O(N) Time | O(N^2) Time | O(Nlogn) Time | O(N^3) Time | B | |
| CS502 | We Store The Tree Nodes In Level-Order Traversal In Heap Sort | True | False | Na | Na | A | |
| CS502 | We Think Of Divide-And-Conquer As Breaking The Problem Into A Small Number Of Bigger Sub-Problems Which Are Then Solved Recursively | True | False | Na | Na | A |