Midterm Review CSE 2011 Winter October 2015

Algorithm Analysis Given an algorithm, compute its running time in terms of O, , and  (if any).  Usually the big-Oh running time is enough. Given f(n) = 5n + 10, show that f(n) is O(n).  Find c and n 0 Compare the grow rates of 2 functions. Order the grow rates of several functions.  Use slide 14.  Use L’Hôpital’s rule. 2

Running Times of Loops Nested for loops: If the exact number of iterations of each loop is known, multiply the numbers of iterations of the loops. If the exact number of iterations of some loop is not known, “open” the loops and count the total number of iterations. 3

Running Time of Recursive Methods Could be just a hidden “for" or “while” loop.  See “Tail Recursion” slide.  “Unravel” the hidden loop to count the number of iterations. Logarithmic  Examples: binary search, exponentiation, GCD Solving a recurrence  Example: merge sort, quick sort 4

Recursion Know how to write recursive functions/methods: Recursive call  Adjusting recursive parameter(s) for each call Base case(s) 1.Use the definition (factorial, tree depth, height) 2.Cut the problem size by half (binary search), or by k elements at a time (sum, reversing arrays). 3.Divide and conquer (merge sort, quick sort) 5

Sorting Algorithms Insertion sort Merge sort Quick sort Lower bound of sorting algorithms  O(NlogN) When to use which sorting algorithm? Linear-time sorting (bucket sort) 6

Running Time of Tree Methods Most tree methods are recursive. Visualize the recursion trace. Count the number of nodes that were visited (processed) k. Compute the running time for processing each node O(m). If O(m v ) ≠ O(m u ), sum up the running times of the k nodes. Otherwise total running time = k  O(m) 7

Arrays and Linked Lists Arrays A = B Cloning arrays Extendable arrays Strategies for extending arrays:  doubling the size  increment by k cells Linked lists Singly linked Doubly linked Implementation Running times for insertion and deletion at the two ends. 8

Running Times of Array and Linked List Operations Operation Array unsorted Array sorted DL list unsorted DL list sorted insertO( ) deleteO( ) searchO( ) 9

Stacks, Queues and Deques Operations Array implementation Linked list implementation Running times for each implementation Assignment 3 (deques) 10

Trees Definitions, terminologies Traversal algorithms and applications  Preorder  Postorder Computing depth and height of a tree or node. 11

Binary Trees Linked structure implementation Array implementation Traversal algorithms  Preorder  Postorder  Inorder Properties: relationships between n, i, e, h. 12

Binary Search Trees Properties Searching Insertion  Distinct keys  Duplicate keys Deletion Running times 13

During Reading Week Office hours: Friday, 25 February, 11:30-13:00 CSEB-2024 Homework (trees) R-7.5, 7.6, 7.7, 7.16, 7.23 C-7.4, 7.5, 7.6, 7.9 (C-7.23, 7.33, 7.34: optional, more difficult) R-10.1, 10.3, 10.4 Implement BST insertion method using the posted binary tree Java template. 14

Midterm Test Date: Tuesday, March 1 Time: 13:00-14:20 (80 minutes) Location: CB-121 (lecture room) Materials  Lectures notes from the beginning up to and including the lecture on February 17.  Corresponding sections in the textbook.  Assignments 1, 2 and 3. 15

Test Rules This is a closed-book test. No books, notes or calculators are allowed. You will be given blank paper for scrap work. Bring a photo ID, pens, and pencils. You may use pencils with darkness of at least HB; 2B is preferred. No questions are allowed during the test. You may leave the classroom if you hand in your test booklet 15 minutes or more before the test ends. Programming problems will be marked based on both correctness and efficiency. You may use either Java or Java-like pseudo-code. 16

Test Rules (2) Be present at 12:55 P.M. Put away all notes and books (under the seats). Seating:  4 students per table (or 8 per row), except the first row.  6 students in the first row (or 3 per table). Remind your neighbour(s) to put away all notes and books and follow the seating rule.