COMP 250 Study Guide - Final Guide: Binary Search Tree, Hash Table, Merge Algorithm
30 Nov 2017
School
Department
Course
Professor
Document Summary
Write your name at the top of this page. Three blank pages are added at the end in case you need extra space. This examination is worth 50% of your final grade. The total of all questions is 100 points. The value of each question is found in parentheses next to it. This is an open book exam though sharing materials with other students is not permitted. No electronic devices, calculator, laptop computer, cell phones, etc. are allowed. This exam comprises 14 pages, including the cover page and three blank pages at the end. Suggestions: read all the questions before you start! The number of points is not always proportional to the. Grading scheme: / 30, / 12, / 10, / 6, / 12, / 10, / 10, / 10. Indicate whether the following statements are true or false. Then, under the best possible choice of hash function, any find(key) operation will take time o(n/k log(n/k)).
