THE INTERNATIONAL UNIVERSITY (IU) - VIETNAM NATIONAL UNIVERSITY - HCMC FINAL EXAMINATION 14/06/2018 Duration: 90 minutes Closed book One A4 handwriting note is allowed SUBJECT: DATA STRUCTURE AND ALGORITHMS Lecturer School of Computer Science & Computer. Engineering Vonal Signature: Upmales Signature: Full Name: | Full Name: Tran Thanh Tung Student Name: Student ID: Rounding convention: 9/2 5. Nodes visiting convention: alphabetic order. 1. (25pts) Binary tree Given an expression: a+(b-c)/d+e*(f+g)+h. a. Present the expression by a binary tree (15pts) b. Write the expression in postfix format (10pts) 2. Hash table (25pts) Given a hash table of size 7 where the open addressing procedure is used to solve collisions a. For a list of items (0, 1, 6, 14, 27, 25), write the hash function for the hash table (5pts), insert the items into the hash table and show the hash table (10pts) b. Change the hash table's size to 11. Show the new hash table (10pts) 3. (20pts) Given a graph G represented by the following list of successors. For each pair (x, y), x is the weight of the edge, y is the terminal extremity of the edge. A: (5, B) B: (3, F) C: (1, A) → (3, D) → (2, F) 1/2 Shot On itel S42 Fullscreen Selfie Phone