CSCI 3104: Algorithms

Class Calendar -- Spring 2010

This page contains a record of what we've done in class, and sometimes includes the tentative schedule for the near-future.

Date Reading and Assignment Agenda
Jan 11 Mon Chapter 0, HW #1 Out Introduction
Jan 13 Wed Chapter 1, Omit 1.5 Fibonacci Numbers, Complexity
Jan 15 Fri Big-O and friends, Computer Arithmetic
Jan 18 Mon MLK Day -- No Class
Jan 20 Wed Modular Arithmetic, Modular Exponentiation
Jan 22 Fri HW #1 Due Euclid's Algorithm
Jan 25 Mon HW #2 Out Euclid's Extended Algorithm and Modular Division
Jan 27 Wed Primality Testing, Fermat's Little Theorem
Jan 29 Fri Read Ch 2 (omit 2.6) Generating Large Primes, Intro to Cryptography
Feb 1 Mon RSA
Feb 3 Wed Divide and Conquer
Feb 5 Fri HW #2 Due Recurrences and the Master Theorem
Feb 8 Mon Selection; Strassen's Alg
Feb 10 Wed HW #3 Out;Read Ch 3 Graphs and DFS
Feb 12 Fri MT I Review
Feb 15 Mon Midterm I
Feb 17 Wed Midterm Solns; More DFS
Feb 19 Fri DAGs and Linearization
Feb 22 Mon Strongly Connected Components
Feb 24 Wed HW 3 Due; HW 4 Out; Read Ch 4 BFS, Shortest-Paths
Feb 26 Fri A Review of Priority Queues
Mar 01 Mon Dijkstra's Algorithm
Mar 03 Wed Read Ch 5 (Omit 5.3) Bellman-Ford, SPs in a DAG, Longest Path
Mar 05 Fri Greedy Algorithms, MSTs
Mar 08 Mon Kruskal's Algorithm and the Cut Property
Mar 10 Wed Disjoint Sets
Mar 12 Fri HW #4 Due; HW #5 Out Prim's Algorithm, Intro to Compression
Mar 15 Mon Huffman Codes
Mar 17 Mon Midterm II Review
Mar 19 Fri Midterm II
Mar 22 Mon Spring Break
Mar 24 Wed Spring Break
Mar 26 Fri Spring Break
Mar 29 Mon Read Ch 6 Set Cover
Mar 21 Wed Dynamic Programming -- Intro
Apr 2 Fri Edit Distance
Apr 5 Mon Knapsack
Apr 7 Mon Matrix Chain Multiplication
Apr 9 Fri HW 5 Due; HW 6 Out Traveling Salesman Problem
Apr 12 Mon Read Ch 8 Independent Sets in Trees
Apr 14 Wed Intro to NP-Completeness
Apr 16 Fri
Apr 19 Mon
Apr 21 Wed
Apr 23 Fri
Apr 26 Mon
Apr 28 Wed
Apr 30 Fri Final Review
May 04 Tue Final Exam 1:30pm-4pm, Regular Classroom, Comprehensive