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 | - What Is The Total Time To Heapify? | O(Log N) | O(N Log N) | O(N^2 Log N) | O(Log^2N) | A | |
| CS502 | __________ Is A Graphical Representation Of An Algorithm | Segma Notation | Thita Notation | Flowchart | Asymptotic Notation | C | |
| CS502 | __________ Modeling Technique Is More Appropriate For Data Warehousing | Dimensional | Physical | Entity Relationship | None | A | |
| CS502 | __________ Of The Courses In The Computer Science Program Deal With Efficient Algorithms And Data Structures | Many | Some | Only One | None | A | |
| CS502 | ___________ Is The Average Running Time Over All Inputs Of Size N. Let P(I) Denote The Probability Of Seeing This Input. The Average-Case Time Is The Weighted Sum Of Running Times With Weights | Worst-Case Time | Average-Case Time | Constant-Case Time | None | B | |
| CS502 | A __________ Is A Left-Complete Binary Tree That Conforms To The Heap Order | Bst | Avl Tree | Perfect Tree | Heap | D | |
| CS502 | A Dense Undirected Graph Is | A Graph In Which E = O(V^2) | A Graph In Which E = O(V) | A Graph In Which E = O(Log V) | All Items Above May Be Used To Characterize A Dense Undirected Graph | A | |
| CS502 | A Heap Is A Left-Complete Binary Tree That Conforms To The ___________ | Increasing Order Only | Decreasing Order Only | Heap Order | (Log N) Order | C | |
| CS502 | A P × Q Matrix A Can Be Multiplied With A Q × R Matrix B. The Result Will Be A P × R Matrix C. There Are (P . R) Total Entries In C And Each Takes ___________ To Compute | O (Q) (P= 84) | O (1) | O (N^2) | O (N^3) | A | |
| CS502 | A P X Q Matrix A Can Be Multiplied With A Q X R Matrix B. The Result Will Be A P X R Matrix C. There Are (P . R) Total Entries In C And Each Takes ___________ To Compute | O (Q) | O (1) | O (N^2) | O (N^3) | A | |
| 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 | A Point P Is Not Said To Be Dominated By Point Q If Q.X = P.X And Q.Y = P.Y | True | False | Na | Na | A | |
| CS502 | A Point P Is Said To Dominated By Point Q If P.X = Q.X And P.Y = Q.Y | True | False | Na | Na | A | |
| CS502 | A Ram Is An Idealized Machine With ___________ Random-Access Memory | 256Mb | 512Mb | An Infinitely Large | 100Gb | C | |
| CS502 | A Ram Is An Idealized Machine With__________ | An Infinitely Large Random-Access Memory | With Instructions Are Executed One-By-One (There Is No Parallelism) | Single Processor Machine | All | D | |
| CS502 | A Very Important Special Case Of Divide-And-Conquer Which I Call The Sieve Technique | True | False | Na | Na | A | |
| CS502 | Abu Ja’Far Mohammad Ibn Musa Al-Khowarizmi Was Born In The Eighth Century At Khwarizm (Kheva) In__________ | Iraq | Iran | Uzbekistan | Turkey | C | |
| CS502 | Access To Nodes Involves Simple Arithmetic Operations: Shown In Below Left(I) : Returns 2I Index Of Left Child Of Node I. Right(I) : Returns 2I + 1 The Right Child. Parent(I) : Returns Bi/2C The Parent Of I. | True | False | Na | Na | 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 | 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 |