CS 6363.501: Algorithms (Spring 2013)

Announcements

```
5/7: Check your scores on assignments, projects and exams on elearning
and report any errors to instructor as soon as possible.

Final exam scores and grade will be available on elearning by Monday morning
Final exams can be viewed on Mon, May 13, from 1:00-3:00 PM

4/23: Notes for SAT to Subset Sum reduction

4/18: Assignment 5 (due 5/2).

4/09: More problems to try out (not a homework)

4/15: Notes for maximum flow problem
Sample execution of Ford-Fulkerson flow algorithm

4/09: Problems to try out (not a homework)

4/04: Notes for Single-source shortest paths
Sample execution of shortest path algorithms
Sample execution of Dijkstra's algorithm

4/02: Assignment 4 (due 4/18).

3/20: Sample input file for discord DP  and its (possible) Output
Sample input file for stones DP  and its (possible) Output

3/18: For the problem of minimizing discord (project), assume
that k is at most n/3.

3/05: Programming project (due, 3/26)

2/21: If you lost points in Q4 of Assignment 1, you can resubmit the
pseudocode for Q4  (along with your original submission)
on Tue, Feb 26 (in class).

2/20: Assignment 3 (due 3/5).

2/13: C code for cutting rod problem

2/12: Assignment 2 (due 2/19).

2/1:  Read Chapter 7 and sections 9.1, 9.2 (9.1 not discussed in class).
Practice problems: Problem 7-2, Exercise 9.3-6, Problem 9-1, 9-2.
In next quiz, 2 "cheat" sheets allowed (hand written, 8 1/2"x11" pages).

1/30: Teaching assistants:

Office: ECSS 4.702, Office hours: TR 3:30-5:15 PM, TR 8:20-8:50 PM.

2. Benjamin Ferrell, benjamin.ferrell@utdallas.edu
Office: ECSS 4.705, Office hours: Monday/Thursday 4:00-5:30 PM

1/29: Assignment 1 (due 2/12).
Quiz 1 scores are available on elearning.

1/22: Slides used in class

1/18: Sample questions from previous exams (illustrating levels C/B/A)