CS 231: Algorithmic Problem Solving

Course information

• The course outline/syllabus
• Undergraduate Calendar course description
• Course information from the Cheriton School of Computer Science

Textbook

This course has been designed so that all the material you need will either be available on the course site or explained in lecture. Those who wish to have an additional resource may find a textbook helpful. The textbook is optional, not required; it does not cover all the course material, but has additional material on algorithms for those interested in additional application areas. Where they differ, style and terminology used in lectures, not the textbook, should be used.

Introduction to the Design and Analysis of Algorithms, third edition
Anany Levitin
Pearson, 2011


• Coverage of course material by the textbook can be found in this document.

Resources

The resources below are summaries and/or extensions of material covered in lecture as well as resources for the math session. For the math session, please attempt the exericises (either at the session or on your own) before downloading the solutions.

Please see the Python page for resources relating to Python, including information for the Python sessions.

• Pseudocode
• Calculating worst-case costs
• Recipes from lecture
• Problems from lecture
• Math guide
• Math session problems
• Math session solutions

Lecture videos

Videos of lectures are available on LEARN. In case it is easier for you to process the material in a different way, audio, transcripts of the audio, and slides are also available.

Source for examples

Code used in lecture can be downloaded here.

• Module 1: Colour neighbours
• Module 3: Activities
• Module 3: Testing activities
• Module 3: Finish first
• Module 3: Selection sort
• Module 4: Binary search
• Module 4: Mergesort
• Module 4: Maximum subtotal
• Module 5: Longest common subsequence
• Module 7: One sequence
• Module 7: All sequences