COE 428 Midterm: COE428 - Winter 2018 Midterm

156 views9 pages

Document Summary

Pages without a name will not be graded. Answer all of the following questions in the space provided. Total l7 t5 fi0 n2 t8 t6 n2 t60 g""1ion. ffi. I t heap data structure is initially empty: objects are added in the order: 9, 8. Shor,v horv the heap evolves as each item is added. (build-heap and max-heapify) (sholy your steps) for each item added. indicate how many swap operations are needed. Xame: : a quelre is implemenred as a linked lisr. ffi. Draw the linked structure following each of the operations below. The operations enqueue and dequeue should take o(l) tirne. 5: enqueue (q, 10, enqueue (q, 15) tffiftrilrn, enquette (q, 8) Page 5: give the asymptotic tight bound o of z(iz) = t(n - 1) + - n. Draw the recursion tree and guess the as1"mptotic tight lrpper bound o for t(n). F. r^ *w b*rt: t( -a) hurroni - 5ex;e9 .

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