2-14 Given input { 4321, 56, 57, 46, 289, 17, 331, 33, 234,63 ). Which one of the following is the result after the 1st run of the Least Signification Digit (LSD) radix sort? (2 point(s) ) OA -56-289-4321-331-33-234-46-57-63-17 OB. +331-4321-33-63-234-56-46-5717289 OC -5745289173323463564321331 OD. -4321-331-33-63-234-56-46-5717289 2-15 The maximum flow in the network of the given Figure is: (3 point(s)) 33 1520 10 O A 132 O B. 125 OC 110 OD. 104 2-16 Given an initially empty hash table HT of size 11. The hash function is H(key) = key 7 with linear probing used to resolve the collisions. Now hash the keys 87, 40, 30, 6. 11. 22.98 and 20 one by one into HT. What is the average search time for unsuccessful searches? (2 point(s) ) OA4 OB. 6.29 O C 5.25 OD 6 2-17 Given an undirected graph, and the edge set of a DFS from VO as: (VOV1). (VO.V4), (V1.12). (V1,V3), (04.15), (05,V6)}. Which one the following cannot be the sequence of another DFS? (3 point(s)] O A VO, V3, V1, V2, V4, V5, V6 OB. VO, V1, V2 V3 V4 V5, V6 OC VO, V1, V4, V5, V6, V2, V3 OD. VO V5, V4. V6, V1, V2, V3 2-18 Given a sequentially stored list L of 16 sorted records. If binary search is used to find a record that does not exist then the maximum number of comparisons is: (2 point(s) OA4 OB. 6 OC 7 OD 5 2-14 Given input { 4321, 56, 57, 46, 289, 17, 331, 33, 234,63 ). Which one of the following is the result after the 1st run of the Least Signification Digit (LSD) radix sort? (2 point(s) ) OA -56-289-4321-331-33-234-46-57-63-17 OB. +331-4321-33-63-234-56-46-5717289 OC -5745289173323463564321331 OD. -4321-331-33-63-234-56-46-5717289 2-15 The maximum flow in the network of the given Figure is: (3 point(s)) 33 1520 10 O A 132 O B. 125 OC 110 OD. 104 2-16 Given an initially empty hash table HT of size 11. The hash function is H(key) = key 7 with linear probing used to resolve the collisions. Now hash the keys 87, 40, 30, 6. 11. 22.98 and 20 one by one into HT. What is the average search time for unsuccessful searches? (2 point(s) ) OA4 OB. 6.29 O C 5.25 OD 6 2-17 Given an undirected graph, and the edge set of a DFS from VO as: (VOV1). (VO.V4), (V1.12). (V1,V3), (04.15), (05,V6)}. Which one the following cannot be the sequence of another DFS? (3 point(s)] O A VO, V3, V1, V2, V4, V5, V6 OB. VO, V1, V2 V3 V4 V5, V6 OC VO, V1, V4, V5, V6, V2, V3 OD. VO V5, V4. V6, V1, V2, V3 2-18 Given a sequentially stored list L of 16 sorted records. If binary search is used to find a record that does not exist then the maximum number of comparisons is: (2 point(s) OA4 OB. 6 OC 7 OD 5
