DMMR: Study guide for Chapter 3 of the textbook by K. Rosen

Key concepts. (This is not a complete list of the course content.)

Linear search; binary search
Big O, Big Omega, and Theta estimations for the growth of functions
Basic proofs about the complexity of algorithms by using the Big O, Big Omega, and Theta estimations.

Parts of chapter 3 not covered in this course

Sorting algorithms; greedy algorithms; The Halting Problem. (These are covered later in other computer science courses.)

Home : Teaching : Courses : Dmmr

Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK
Tel: +44 131 651 5661, Fax: +44 131 651 1426, E-mail: school-office@inf.ed.ac.uk
Please contact our webadmin with any comments or corrections. Logging and Cookies
Unless explicitly stated otherwise, all material is copyright © The University of Edinburgh