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 | |
|---|---|---|---|---|---|---|---|
| CS301 | I Have Implemented The Queue With A Linked List Keeping Track Of A Front Pointer And A Rear Pointer. Which Of These Pointers Will Change During An Insertion Into An Empty Queue? | Neither Changes | Only Front Pointer Changes | Only Rear Pointer Changes | Both Change | B | |
| CS301 | If A Binary Tree Has N + 1 External Nodes Then | It Has N Internal Nodes | It Has N-1 Internal Nodes | It Has N/2 Internal Nodes | It Has N+2 Internal Nodes | A | |
| CS301 | If A Complete Binary Tree Has Height H Then Its No. Of Nodes Will Be | Log (H) | 2^(H+1)- 1 | Log (H) - 1 | 2^H - 1 | B | |
| CS301 | If A Complete Binary Tree Has Height H Then Its No. Of Nodes Will Be | Log (H) | 2^(H+1) - 1 | Log (H) - 1 | 2^H - 1 | B | |
| CS301 | If A Complete Binary Tree Has N Number Of Nodes Then Its Height Will Be | Log2 (N+1) -1 | 2N | Log2 (N) - 1 | 2N - 1 | A | |
| CS301 | If A Max Heap Is Implemented Using A Partially Filled Array Called Data And The Array Contains N Elements (N > 0) Where Is The Entry With The Greatest Value? | Data[0] | Data[N-1] | Data[N] | Data[2*N+1] | A | |
| CS301 | If A Tree Has 50 Nodes Then The Total Edges/Links In The Tree Will Be | 55 | 51 | 50 | 49 N-1= 49 | D | |
| CS301 | If Both Pointers Of The Node In A Binary Tree Are Null Then It Will Be A/An | Inner Node | Leaf Node | Root Node | None Of The Given Options | B | |
| CS301 | If Numbers 5 222 4 48 Are Inserted In A Queue Which One Will Be Removed First? | 48 | 4 | 222 | 5 | D | |
| CS301 | If One Pointer Of The Node In A Binary Tree Is Null Then It Will Be A/An | External Node | Root Node | Inner Node | Leaf Node | A | |
| CS301 | If The Bottom Level Of A Binary Tree Is Not Completely Filled Depicts That The Tree Is Not A | Expression Tree | Threaded Binary Tree | Complete Binary Tree | Perfectly Complete Binary Tree | C | |
| CS301 | If There Are 23 External Nodes In A Binary Tree Then What Will Be The No. Of Internal Nodes In This Binary Tree? | 21 | 22 | 23 | 24 | B | |
| CS301 | If There Are 56 Internal Nodes In A Binary Tree Then How Many External Nodes This Binary Tree Will Have? | 54 | 55 | 56 | 57 | D | |
| CS301 | If There Are N Elements In An Array Then The Number Of Maximum Steps Needed To Find An Element Using Binary Search Is | N | N^2 | Nlog2N | Log2N | D | |
| CS301 | If There Are N External Nodes In A Binary Tree Then What Will Be The No. Of Internal Nodes In This Binary Tree? | N -1 | N +1 | N+2 | N | A | |
| CS301 | If There Are N External Nodes Is A Binary Tree Then What Will Be The No. Of The Internal Nodes In This Binary Tree? | N-1 | N | N+1 | N+2 | C | |
| CS301 | If There Are N Internal Nodes In A Binary Tree Then What Will Be The No. Of External Nodes In This Binary Tree? | N -1 | N +1 | N+2 | N | B | |
| CS301 | If We Have 1000 Sets Each Containing A Single Different Person. Which Of The Following Relation Will Be True On Each Set | Reflexive | Symmetric | Transitive | Associative | A | |
| CS301 | If We Have 1000 Sets Each Containing A Single Different Person. Which Of The Following Relation Will Be True On Each Set: | Reflexive | Symmetric | Transitive | Associative | A | |
| CS301 | If We Want To Find Median Of 50 Elements Then After Applying Buildheap Method How Many Times Deletemin Method Will Be Called ? | 5 | 25 | 35 | 50 | B |