srisr2021 1801_R16_Comp_V_CSDLO5013_M_Q1_Regular 1601_R16_Comp_V_CSDLO5013_AA_Q1_R egular Your email address (2019mohi form. Not you? Switch account will be recorded when you submit this * Required 1601_R16_Comp_V_CSDLO5013_AA_Q1_Regular 1. Choose the correct option for following questions. All the Questions are compulsory and carry equal marks 1. In dynamic table, the amortized cost of the single operation is at the 2 points 2. In Hiring Problem, how many times a new office assistant will be hired if 2 points the input is considered in the order of rank of candidates where the order is <4, 5, 2, 6,3, 7,8, 9,10, 1>* Os hitpssidocs. google. comiformsda/FAlpQLSeaxc)Naaut_2i6KXKEPVLcAHIaS-(FNooBnmi2MGoW tat wformResponse vesrisr2021 41601_R16_Comp_V_CSDL05013_AA_Q1_Regular 3. A binomial tree B, has --- * 2points © Konodes and the height of the tree is (k +2) © nodes and the height of the tree is 2k @ 2 nodes and the height of the tree is k © (k+2) nodes and the height of the tree is (Ig k) 4, Let the capacity of the edge from vertex u to vertex vis 30 and flow points from vertex u to vertex v is -10 (minus 10). The residual capacity Cp is - Ox» O 50 © O 30 5. In bipartite graph G = (VE), vertex set can be partitioned into V=PUQ 2 points where ~ and all edges in E go between P and Q. * O Pnaze O Qis subset of P @ Pna-o © Pis subset of @ hitpssidocs. google. comifermsdlalFAlpQLSeaxc)Naaul_2i6KXKEPVLcAHIaS-(FNooBnmi2MGoW tat hwformResponse 28srisr2021 41601_R16_Comp_V_CSDL05013_AA_Q1_Regular 6. The sweeping algorithm which takes n line segments as input and 2points considers endpoints in sorted order have runtime complexity of ~ to determine any pair of line segments intersects. * O om) O on) @ onigny O oOlgn) 7. Let ASp B. Which of the following statement is true? * 2 points © problem A cannot be reducible to Bin polynomial-time. CO problem A is polynomial time reducible to problem 8. © problems A and B are polynomial time equivalent ©@ problem B is polynomial time reducible to problem A 8. In Aggregate analysis for sequence of n operations worst case time is 2 points T(n). In the worst case the amortized cost per operation is given by ~ O 1m) O T)*T) © Tm hitpssdocs. google. comiformssda/FAlpQLSeaxc)Naaut_2i6KXKEPVLcAHI@S-(FNooBnmi2MGoW tat hwformResponse sesrisr2021 41601_R16_Comp_V_CSDL05013_AA_Q1_Regular Ontn 9. In Red-Black tree, RB-DELTE_FIXUP procedure takes time performs at the most - rotations. * and © O(n) and 2 rotations © (lgn) and 3 rotations © O(n) and 4 rotations © O(n ign) and 1 rotations 10. In relabel-to-front algorithm let f is preflow. The edge from vertex u to vertex v is admissible if and only if ~ -* 2 points 2 points © Residual cepactty af edge v to vertex u is greater than zero and height of vertex uis less than vertex v. Residual capacity of edge u to v and height of vertex u and vertex v is equal. Residual capacity and height both conditions need not be fulfilled oOoO°o than vertex v, 11. Those problems that can be solved in polynomial time known as problems. * CO intractable @ Tractable O Complete hitpssidocs. google. comiformsda/FAlpQLSeaxc)Naaul_2i6KXKEPVLcAHIaS-(FNooBnmi2MGoW tat hwformResponse Residual capacity of edge u to v is greater than zero and height of vertex uis larger 2 points 48srisr2021 41601_R16_Comp_V_CSDL05013_AA_Q1_Regular O decision 12. The convex hull of a set Q of points, denoted by CH(Q).IfIQ|23then — 2 points at termination of Graham scan algorithm bottom to top content of stack is © Allthe vertices in CH(Q) CE Aillthe vertices having same polar angle. © Exactly the vertices of CH(Q) in counterclockwise order © Exactly the vertices of CH(Q) in clockwise order 13, The time complexity of the recurrence T(n) = 3T (n/3)+ n/2 by using 2 points master theorem is ----- O or) @® e(nlogn) © otlogn) O ain) 14, Let Red-Black has n number of internal nodes. Then this tree has height 2 points O latn+1) hitpssidocs. google. comifermsla/FAlpQLSeaxc)Naaut_i6KXKEPVLcAHIaS-(FNooBnmi2MGoW tat wformResponse sesrisr2021 41601_R16_Comp_V_CSDL05013_AA_Q1_Regular @ 2ig(n+1) 15. Which of the following statement is correct in case of hiring problem? * 2 points ©@ Interviewing has lower cost whereas hiring is expensive CE Interviewing and hiring both have equal cost. CO hiring has lower cost than Interviewing CO Interviewing has higher cost than hiring 16.1n Push-relabel algorithm the basic operation PUSH(u, v) that pushes 2 points flow from vertex u to vertex v applies if ~ * @ is an overflowing vertex, Cp (u,v)>0 and vertex u height = vertex v height +1 © uis an underflowing vertex, Cp (u, v)>0 and vertex u height = vertex v height + 1 © Vis an underflowing vertex, Cp (v, u)}>0 and vertex v height = vertex w height +1 © vis an overflowing vertex, Cp (v, u)>0 and vertex v height = vertex u height + 1 17. Let Mand N are the two vectors. If the cross product M X N = 0 then - 2 points © Mand are not related to each other. © Mis counterclockwise from N with respect to the origin (0,0) © Mis clockwise from N with respect to the origin (0,0) hitpssidocs. google. comiformsda/FAlpQLSeaxc)Naaul_2i6KXKEPVLcAHIaS-(FNooBnmi2MGoW tat 3hwformResponse oesrisr2021 1801_R16_Comp_V_CSOLOSO13_AA_O1 Regular @© Mand N are said to be colinear 18. Suppose two problems A and B not known to be in NP. Let problem C 2 points be an NP-Complete problem. Problem A is polynomial-time reducible to C and problem C is polynomial-time reducible to problem B. Which one of the following statements is true? * CO Problem B is NP-Complete O Problem Ais NP-hard © Problem A is NP-Complete @ Problem B is NP-hard 19. In the union of two binomial heaps H1 and H2, the root list of H1 and H2. 2 points is merged into a single linked list which is sorted by © Decreasing order of the degree of the root nodes. CE Increasing order of the key value of the root nodes. © Decreasing order of the key value of the root nodes. © increasing order of the degree of the root nodes 20. Deletion of a node in Red-Black tree takes 2 points O oO(mtgn) O o) hitpssidocs. google. comiformsda/FAlpQLSeaxc)Naaul_2i6KXKEPVLcAHIaS-(FNooBnmi2MGoW tat 3hwformResponse 18srisr2021 41601_R16_Comp_V_CSDL05013_AA_Q1_Regular O (lg (ign) @ Olgn) Back Submit Never submit passwords through Google Forms, This form was created inside of Welcome to Vivekanand Education Society, Repoit Abuse hitpssidocs. google. comiformsdla/FAlpQLSeaxc)Naaul_2i6KXKEPVLcAHIaS-(FNooBnmi2MGoW tat hwformResponse