2-19 Which of the following sorting methods gives {3.1.4. 11.9. 16.7.28 ) after 2 runs? (2 point(s) O A heap sort O B. bubble sort o insertion sort OD. quick sort 2-20 Insert (18, 23, 11, 20, 27, 27, 33, 42, 15) one by one into an initially empty hash table of size 11 with the hash function (Key)=Key%11, and quadratic probing is used to resolve collisions. How many numbers can be inserted without collisions? (2 point(s) O A6 OB. 7 OC 8 OD 5 2-21 Given an undirected graph, and the edge set of a DFS from VO as: {(VO.V1), (VO.V4), (V1,V2), (V1,v3), (04.V5). (V5 V6)}. Which one the following cannot be the sequence f another DFS? (3 point(s)) O A VO V4, V5, V6, V1, V2, V3 OB. VO V6, V4, V5, V1, V2, V3 O CVO, V2, V1, V3, V4, V5, V6 OD. VO, V1, V5, V4. V6, V2, V3 2-22 Given the shape of a binary tree shown by the figure below. If its preorder traversal sequence is {E.D.A.F.HCB. G} then the node on the same level of A must be: (2 point(s) OAC OBH OC B and G OD. C and G 2-23 let P stands for push and O for pop. When using a stack to convert the infix expression 3*2+8/4 into a postfix expression, the stack operation sequence is (3 point(s) ) O A POPPOO OB. PPPOOO OC POPOPO OD. PPOOPO ( 2 point(s)) 2-19 Which of the following sorting methods gives {3, 1, 4, 11, 9, 16, 7, 28 } after 2 runs? A. heap sort B. bubble sort C. insertion sort D. quick sort Author Organization ( 2 point(s)) 2-20 Insert {18, 23, 11, 20, 2, 7, 27, 33, 42, 15) one by one into an initially empty hash table of size 11 with the hash function H(Key)=Key%11, and quadratic probing is used to resolve collisions. How many numbers can be inserted without collisions? A. 6 B. 7 C. 8 D. 5 (3 point(s)) 2-21 Given an undirected graph, and the edge set of a DFS from VO as: {(V0,v1), (VO,V4). (V1,V2), (v1,v3), (V4,V5), (V5, V6)}. Which one the following cannot be the sequence of another DFS? A. VO, V4, V5, V6, V1, V2, V3 B. VO, V6, V4, V5, V1, V2, V3 C. VO, V2, V1, V3, V4, V5, V6 D. VO, V1, V5, V4, V6, V2, V3 2 point(s)) 2-22 Given the shape of a binary tree shown by the figure below. If its preorder traversal sequence is { E, D, A, F, H, C, B, G }, then the node on the same level of A must be: A. C B. H C. B and G D. C and G (3 point(s)) 2-23 Let P stands for push and o for pop. When using a stack to convert the infix expression 3*2+8/4 into a postfix expression, the stack operation sequence is: A. POPPOO B. PPPOOO C. POPOPO D. PPOOPO