# ICS 311 Spring 2017 Index

This is an index of web pages for ICS 311 Algorithms, taught Fall 2017 by Nodari Sitchinava. Generally the course is run within Laulima. Notes and other material are posted on this site, http://www2.hawaii.edu/~nodari/teaching/s17/, and on YouTube. However, course participants will need to log into Laulima regularly to watch screencasts, submit assignments, and to use other facilities such as discussions and the mail tool as needed. Classes are in Webster 101 and in Holmes 247.

## Contents

• Schedule: A weekly listing of events (includes lecture notes, problem sets, projects, and exams).

• Syllabus: Overview of course and plan.
• Topics: Summary of weekly topics.
• Problem Sets: List of active and planned problem sets.
• Exams: Planned exam dates

## Topics

This is not a complete schedule: see the Schedule for that. CLRS is the Cormen Leiserson Rivest and Stein textbook. Topic numbers are not in sequence due to changes to the curriculum since 2014.

• Week 1
• 01/09 - #1 & #4 - Introduction to Course, Review of Basic Data Structures: CLRS Chapters 1 & 10; Topic 01 Notes; Topic 04 Notes
• 01/11 - #2 - Proving Correctness; Analyzing Algorithms: CLRS Chapters 2.1-2.2 ; Topic 02 Notes;
• Week 2
• 01/16 - HOLIDAY
• 01/17 - Drop date (without W)
• 01/18 - #3 - Growth of Functions and Asymptotic Concepts: CLRS Chapter 3; Topic 03 Notes
• Week 3
• 01/23 - #7 - Divide & Conquer; Analysis of Recurrences: CLRS Chapter 2.3, 4 (4.1 & 4.3-4.5); Topic 07 Notes
• 01/25 - #8 - Binary Search Trees: CLRS Sections 12.1-12.3 (skim 12.4); Topic 08 Notes
• Week 4
• 01/30 - #11 - Balanced Trees (2-3-4 and Red-Black): Sedgewick Chapter 15 & CLRS Chapter 13; Topic 11 Notes
• 02/01 - #9 - Heaps, Heapsort and Priority Queues: CLRS Chapter 6 (all); Topic 09 Notes
• Week 5
• 02/06 - #5a - Probabilistic Analysis : CLRS Chapter 7 ; Topic 05A Notes
• 02/08 - #5b - Randomized Algorithms, Quicksort : CLRS Chapter 7 (all); Topic 05B Notes
• Week 6
• 02/13 - #6 - Hash Tables: CLRS Sections 11.1-11.4; Topic 06 Notes
• 02/15 - #10a - Selection and Order Statistics: CLRS Chapters 9; MIT Video Lecture 06; no lecture notes for this topic.
• Week 7
• 02/20 - HOLIDAY
• 02/22 - #10b - Theoretical Limits, and O(n) Sorts: CLRS Chapters 8; Topic 10 Notes
• Week 8
• 02/27 - Midterm 1
• 03/01 - Midterm 1 Review
• Week 9
• 03/06 - #12a - Dynamic Programming: CLRS Chapters 15.1-15.3 Topic 12A Notes
• 03/08 - #12b - Dynamic Programming (cont.): CLRS Chapter 15.4-15.5 Topic 12B Notes
• 03/10 - Drop date (with W)
• Week 10
• 03/13 - #13 - Greedy Algorithms & Huffman Codes: CLRS Sections 16.1-16.3; Topic 13 Notes
• 03/15 - #14A - Graph Representations, BFS, DFS: CLRS Chapter 22.1-22.3; Goodrich & Tamassia excerpt on Representations; Optionally Newman (2010) chapter 9 in Laulima; Topic 14A Notes
• Week 11
• 03/20 - #14B - Topological Sort, Strongly Connected Components: CLRS Chapter 22.4-22.5; Topic 14B Notes
• 03/22 - #16 & #17 - Disjoint Sets, Union-Find, Minimum Spanning Trees: CLRS Sections 21.1-21.3 & Chapter 23; Topic 16 Notes (leave out the linked representation); Topic 17 Notes

• SPRING RECESS: 03/27 — 03/31

• Week 12
• 04/03 - #18 - Single-Source Shortest Paths: CLRS Sections 24.1-24.3; Topic 18 Notes
• 04/05 - #19 - All-Pairs Shortest Paths CLRS Chapter 25; Topic 19 Notes
• Week 13
• 04/10 - Midterm 2
• 04/12 - Midterm 2 review
• Week 14
• 04/17 - #20 - Maximum Flow: CLRS Sections 26.1-26.3; Topic 20 Notes
• 04/19 - #20 - Maximum Flow (continued): CLRS Sections 26.1-26.3; Topic 20 Notes
• Week 15
• 04/24 - #24 - Complexity Theory & NP-Completeness: CLRS Chapter 34; Topic 24 Notes
• 04/26 - #25 - Approximation Algorithms: CLRS Chapter 35; Topic 25 Notes
• Week 16
• 05/01 - #22 - Multithreading CLRS Chapter 27 (emphasis on sections 27.1 and 27.3); Topic 22 Notes
• 05/03 - Special Topic (TBD) and/or Course Review

## Problem Sets

The problems sets will be released here and in Laulima when ready. See Assessment for the dual submission information.

## Exam Dates

• 02/27: Midterm 1 - Topics 1-11, in Webster 101
• 04/10: Midterm 2 - Topics 12-14, 16-19, in Webster 101
• Final Exam: Cumulative on all topics (1-14, 16-20, 22, 24, & 25), in TBA
• Section 1 (MW 8:30-10:10): Monday 7:30-9:30am
• Section 2 (MW 10:30-12:10): Monday 9:45-11:45am

Nodari Sitchinava (based on material by Dan Suthers)