COE 428 Midterm: COE428 - Winter 2017 Midterm

• School: Ryerson University
• Department: Computer Engineering
• Course: COE 428
• Professor: All

Document Summary

Time: 105 min. (1 hour and 45 min. ) Pages without a name will not be graded. Answer all of the following questions in the space provided. Name:_______________________: suppose you are given the following heap: What would be the output if you followed the following steps: Hint: after you remove an element from the heap, make any necessary adjustments. Repeat the following until the heap is empty a) remove maximum element b) push maximum element onto a stack. Use the stack from 2. 1 and repeat following until stack is empty a) pop elements from the stack b) pop elements from the stack and enqueue into a queue. Use the queue from 2. 2 and repeat until queue is empty a) dequeue element b) write element on a new line after dequeuing. Name:_______________________: circle true or false for each statement below. (marks deducted for wrong answers) N log n + n/5 = o(n2) true, false. Name:_______________________: give the asymptotic tight bound of.