• Course Description. Design, implementation, execution, and analysis of algorithms for problems such as sorting, searching, data compression, and data encryption. Time-space-structure trade-offs.
  Prerequisite: COMPSCI 161 or CSE 161. Recommended: I&C SCI 45C OR CSE 45C.
• Coursework. Coursework will consist of course projects, including a final project. Each project must be an individual effort. Working with others on course projects will be considered cheating. In addition to the procedures of the ICS Cheating Policy, students caught cheating will be given a failing grade in the project in question.
• Laptop policy. Open laptop computers are not allowed during lectures.
• Text. The course text, which is recommended, will be A Guide to Experimental Algorithmics by McGeoch.

Tentative Schedule

• Week 1: Algorithm Analysis. Select sorting algorithms.
• Week 2: Random number generators, random permutations.
• Week 3: Greedy Method. Bin packing.
• Week 4: Project 1 (Sorting) due.
• Week 5: Network structure.
• Week 6: Network algorithms.
• Week 7: Project 2 (Bin-packing Algorithms) due.
• Week 8: Network models.
• Week 9: Navigation in networks.
• Week 10: Project 3 (Network Algorithms) due.

Copyright © 2019 Michael T. Goodrich, as to all lectures. Students are prohibited from selling (or being paid for taking) notes during this course to or by any person or commercial firm without the express written permission of the professor teaching this course.