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 | Compilers Operating Systems Databases Artificial Intelligence Computer Graphics And Vision Etc. Use Algorithm | True | False | Na | Na | T | |
| CS502 | Consider The Following Algorithm: Factorial (N){ If (N=1) Return 1 Else Return (N * Factorial(N-1)) { Recurrence For The Following Algorithm Is: | T(N) = T(N-1) +1 | T(N) = Nt(N-1) +1 | T(N)= T(N-1) +N | T(N)=T(N(N-1)) +1 | D | |
| CS502 | Consider The Following Algorithm: Factorial (N){ If (N=1) Return 1 Else Return (N * Factorial(N-1)) } Recurrence For The Following Algorithm Is: | T(N) = T(N-1) +1 | T(N) = Nt(N-1) +1 | T(N)= T(N-1) +N | T(N)=T(N(N-1)) +1 | D | |
| CS502 | Consider The Following Code: For(J=1; J<N;J++) For(K=1; K<15;K++) For(L=5; L<N; L++) { Do_Something_Constant(); } What Is The Order Of Execution For This Code | O(N) | O(N^3) | O(N2 Log N) | O(N^2) | A | |
| CS502 | Continuation Sort Is Suitable To Sort The Elements In Range 1 To K | K Is Large | K Is Not Known | K May Be Small Or Large | K Is Small | D | |
| CS502 | Continuation/Counting Sort Is Suitable To Sort The Elements In Range 1 To K | K Is Large | K Is Not Known | K May Be Small Or Large | K Is Small | D | |
| CS502 | Continuing Sort Has Time Complexity Of ? | O(N) | O(N+K) | O(Nlogn) | O(K) | A | |
| CS502 | Counting Sort Has Time Complexity | O(N) | O(N+K) | O(K) | O(Nlogn) | A | |
| CS502 | Cross Edge Is ___________ | (U V) Where U Is Ancestor Of V And V Is Not Descendent Of U | (U V) Where V Is A Proper Descendant Of U In The Tree | (U V) Where U And V Are Not Ancestor Or Descendent Of One Another | (U V)Where U And V Are Either Ancerstor Or Descendent Of Each Other | C | |
| CS502 | Define The Of An Element To Be One Plus The Number Of Elements That Are Smaller | Rank | Degree | Na | Na | A | |
| CS502 | Define The Of An Element To Be One Plus The Number Of Elements That Are Smaller | Degree | Rank | Frequency | Weight | B | |
| CS502 | Depth First Search Is Shortest Path Algorithm That Works On Un-Weighted Graphs | True | False | Na | Na | B | |
| CS502 | Dijkestra S Single Source Shortest Path Algorithm Works If All Edges Weights Are Negative And There Are No Negative Cost Cycles | True | False | Na | Na | A | |
| CS502 | Dijkestra S Single Source Shortest Path Algorithm Works If All Edges Weights Are Nonnegative And There Are No Negative Cost Cycles | True | False | Na | Na | A | |
| CS502 | Dijkestra’S Single Source Shortest Path Algorithm Works If All Edges Weights Are Nonnegative And There Are Negative Cost Cycles | True | False | Na | Na | B | |
| CS502 | Dijkestra’S Single Source Shortest Path Algorithm Works If All Edges Weights Are Non-Negative And There Are Negative Cost Cycles | True | False | Na | Na | B | |
| CS502 | Dijkstra’S Algorithm Is Operates By Maintaining A Subset Of Vertices | True | False | Na | Na | A | |
| CS502 | Divide-And-Conquer As Breaking The Problem Into A Small Number Of | Smaller Sub Problems | Pivot | Sieve | Selection | A | |
| CS502 | Divide-And-Conquer Is As Breaking The Problem Into A Small Number Of | Smaller Sub Problems | Pivot | Sieve | Solutions | A | |
| CS502 | Due To Left Complete Nature Of Binary Tree The Heap Can Be Stored In | Arrays | Structures | Link List | Stack | A |