COE 428 Midterm: COE428 - Winter 2011 Midterm

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

Document Summary

Examiner (circle the name of your professor): o. das, r. sedaghat. Pages without a name will not be graded. Answer all of the following questions in the space provided. ________________________________________________________________________: indicate, for each pair of expressions (a, b) in the table below, whether a = o(b) or a = (b). Your answer should be yes or no written in each box of the table. (10 marks) Name:_______________________: give the asymptotic tight bound of nt (2)( Draw the recursion tree and guess the asymptotic tight bound for t(n). Then use the substitution method to verify and proof your answer. Name:_______________________: use two queues (queue a and queue b) to implement a stack s. perform the following set of operations on the stack in the given order. (10 marks) Show the content of the two queues and all the queue operations for the corresponding stack operation: push(s, 310) , find the asymptotic tight bound for.