COMP 2140 Midterm: review.pdf
13 Aug 2014
School
Department
Course
Professor
Document Summary
Final exam: dec 14, 6:00pm, 221 & 223 wallace bldg, closed-book. Cover all topics (including those before the midterm) in this semester: bring your student id, please be on time. You might not be allowed to write the exam if you are 30 mins late: official policy for missing final exam: http://umanitoba. ca/student/records/finals/682. html. Recursion: trace results of recursion code, write simple code to solve problem using recursion or iteration. Sorting: running time of each algorithm, know how each algorithm works (e. g. trace the intermediate results of a sorting algorithm) Stack/queue: know the standard stack/queue operations and how to write code for them, know the running time, applications: bracket matching, postfix expression evaluation, handle boundary cases. E. g. when doing pop or top operation on a stack, need to check whether stack is empty. Hash: hash table, hash functions, polynomial hash code, horner"s method, collision resolution.
