CSC 225 Final: CSC 225 Final Exam Fall 2013
31 Jan 2019
School
Department
Course
Professor
Document Summary
Csc 225 - algorithms and data structures: i. This question paper has eleven pages (the last page is blank in case you need extra space) plus the header page. Students must count the number of pages in this examination paper before begin- ning to write, and report any discrepancy immediately to the invigilator. Use only space provided on exam for answering questions. Circle true or false for each question and justify your answer. No marks will be given unless there is a correct justi cation. (a) [2 marks] the function f (n) = k 2k is in ( (k + 1) 2k + 1) when k 1. I 4 is in o(n4) for n 1. i = 1 (c) I 4 is in o(n6) for n 1. i = 1. [3 marks] it takes (n log n) time to build a heap of size n because this is how long it takes to do n insertions.
