CS240 Study Guide - Midterm Guide: Binary Search Tree, Double Hashing, Avl Tree

180 views13 pages

Document Summary

Additional materials allowed: one 8. 5 x 11 double-sided help sheet. Start time: 4:30 pm end time: 6:20 pm. Instructions: please sign this exam below these in- structions, please ensure that the information recorded on the exam label is correct, cheating is an academic o ense. Your signature on this page indicates that you understand and agree to the uni- versity"s policies regarding cheating on exams. For each question below, indicate in the box provided whether the statement is true or false. Please do not simply write t or f as these as easily misread. You will receive 2 marks for a correct answer, 0 for a blank answer, and -0. 5 for a wrong answer. Your minimum total mark is 0. a. b. c. d. e. f. g. h. i. If f (n) o(g(n)) then f (n) o(g(n)). Traversing any heap (in binary-tree form) in pre-order will always yield the stored keys in decreasing order.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

Related Questions