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 | Class Is A User Defined__________ | Data Type | Memory Reference | Value | None Of The Given Options | A | |
| CS301 | Compiler Uses Which One Of The Following In Function Calls | Stack | Queue | Binary Search Tree | Avl Tree | A | |
| CS301 | Compiler Uses Which One Of The Following To Evaluate A Mathematical Equation | Binary Tree | Binary Search Tree | Parse Tree | Avl Tree | C | |
| CS301 | Consider A Binary Tree Represented By The Following Array: A B C D E F G H I J K L Is It A Strictly Binary Tree? | Yes | No | B | |||
| CS301 | Consider A Binary Tree Represented By The Following Array: A B C D E F G I Is It A Strictly Binary Tree ? | True | False | B | |||
| CS301 | Consider A Max Heap Represented By The Following Array; 40 30 20 10 15 16 17 18 4 After Inserting A Nodes With Value 35.Which Of Following Is The Updated Max Heap? | 40 30 20 10 15 16 17 8 4 35 | 40 30 20 10 35 16 17 8 4 15 | 40 35 20 10 30 16 17 8 4 15 | 40 35 20 10 15 16 17 18 4 30 | A | |
| CS301 | Consider A Min Heap Represented By The Following Array: 10 30 20 70 40 50 80 60 After Inserting A Node With Value 31.Which Of The Following Is The Updated Min Heap? | 10 30 20 31 40 50 80 60 70 | 10 30 20 70 40 50 80 60 31 | 10 31 20 30 40 50 80 60 31 | 31 10 30 20 70 40 50 80 60 | A | |
| CS301 | Consider A Min Heap Represented By The Following Array: 11 22 33 44 55 After Inserting A Node With Value 66.Which Of The Following Is The Updated Min Heap? | 11 22 33 44 55 66 | 11 22 33 44 66 55 | 11 22 33 66 44 55 | 11 22 66 33 44 55 | A | |
| CS301 | Consider A Min Heap Represented By The Following Array: 3 4 6 7 5 10 After Inserting A Node With Value 1.Which Of The Following Is The Updated Min Heap? | 3 4 6 7 5 10 1 | 3 4 6 7 5 1 10 | 3 4 1 5 7 10 6 | 1 4 3 7 5 10 6 | D | |
| CS301 | Consider A Min Heap Represented By The Following Array: 3 4 6 7 5 After Calling The Function Deletemin().Which Of The Following Is The Updated Min Heap? | 4 6 7 5 | 6 7 5 4 | 4 5 6 7 | 4 6 5 7 | C | |
| CS301 | Consider Te Following Array 23 15 5 12 40 10 7 After The First Pass Of A Particular Algorithm The Array Looks Like 15 5 12 23 10 7 40 Name The Algorithm Used | Heap Sort | Selection Sort | Insertion Sort | Bubble Sort | D | |
| CS301 | Consider The Following Binary Search Tree (Bst) If Node A In The Bst Is Deleted Which Two Nodes Are The Candidates To Take Its Place? | J And I | H And E | D And E | L And M | D | |
| CS301 | Consider The Following Function: Void Test_A(Int N) {Cout << N << " "; If (N>0) Test_A(N-2); } What Is Printed By The Call Test_A(4)? | 4 2 | 0 2 4 | 0 2 | 2 4 | A | |
| CS301 | Consider The Following Infix Expression. 5 + 6/2 If One Converts The Above Expression Into Postfix What Would Be The Resultant Expression? | 56/ + 2 | 5 6 2 / + | 5 6 / 2 + | /62 + 5 | B | |
| CS301 | Consider The Following Infix Expression: X – Y * A + B / C Which Of The Following Is A Correct Equivalent Expression(S) For The Above? | X Y -A * B +C / | X *Y A - B C / + | X Y A * - B C / + | X Y A * - B/ + C | C | |
| CS301 | Consider The Following Postfix Expression S And The Initial Values Of The Variables. S = A B - C + D E F - + ^ Assume That A=3 B=2 C=1 D=1 E=2 F=3 What Would Be The Final Output Of The Stack? | -1 | 1 | 0 | 2 | B | |
| CS301 | Consider The Following Sequence Of Push Operations In A Stack: Stack.Push(’7’); Stack.Push(’8’); Stack.Push(’9’); Stack.Push(’10’); Stack.Push(’11’); Stack.Push(’12’); | 7 8 9 10 11 12 | 9 8 11 10 7 12 | 9 10 8 11 12 7 | 9 10 8 12 7 11 | A | |
| CS301 | Consider The Following Tree. How Many Of The Nodes Have At Least One Sibling? | 8 | 7 | 6 | 5 | C | |
| CS301 | Consider The Function X As Under Int X (Int& Value) { Return Value; } Now A And B Are Integers In A Calling Function. Which One Of The Following Is A Valid Call To The Above Function X | A = X (B) ; | A = X (&B) ; | A = X (*B) ; | None Of The Given Options | B | |
| CS301 | Declare A Stack Of Characters While ( There Are More Characters In The Word To Read ){Read A Character; Push The Character On The Stack;} While ( The Stack Is Not Empty ){Pop A Character Off The Stack; Write The Character To The Screen;} Input "Apples"? | Selpa | Selppa | Apples | Aaappppplleess | B |