Instructor: Chris Lüer
Tu, Th 6:30 pm – 7:45 pm, RB 104
Description - Materials - Policies - Schedule
Required Textbook:
Brassard, Gilles and Bratley, Paul. Fundamentals of Algorithmics. Prentice-Hall 1995.
Web site: http://www.cs.bsu.edu/homepages/chl/324-05F/
Cheating. Consequences of cheating in this class: the course grade is lowered, possibly to F. No team work is allowed in this class. Material that is copied from books or Web pages needs to be quoted and the source must be given.
Assignments. Assignments are due Tuesdays at the beginning of class. Late assignments will be subject to a deduction of 20% and are accepted up to a week late. Write your name on the top of page 1; if an assignment has more than one page, please staple them. The oral presentation at the end of the semester counts as three assignments.
Grading.
Final Exam 40%
Tests 20%
Homework 40%
If you receive 93.3% of the total course credit, you will get an A. If you receive 90.0%, you will get an A- or better. If you receive 86.7%, you will get a B+ or better, and so on. The grading scale will be shifted so that the median grade is at least a B.
Tests. There will be three non-comprehensive midterm tests plus a comprehensive final exam. Each test will cover both the material presented in class and the related material from the textbook.
Students with special needs or disabilities. If you need course adaptations or accommodations because of a disability, if you have emergency medical information to share with me, or if you need special arrangements in case the building must be evacuated, please make an appointment with me as soon as possible.
| Week | Topic | Readings (chapters in the textbook) | Assignments due |
|---|---|---|---|
| 1 | Introduction | ||
| 2 | Introduction | 1 | HW 1 |
| 3 | Efficiency of Algorithms | 2-3 | HW 2 |
| 4 | Analysis of Algorithms | 4 | HW 3 |
| 5 | Data Structures; Test 1 | 5 | Prepare for Test 1 (Tu 9/20) |
| 6 | Data Structures | HW 4 | |
| 7 | Greedy Algorithms | 6 | HW 5 |
| 8 | Divide-and-Conquer Algorithms | 7 | HW 6 |
| 9 | Dynamic Programming; Test 2 | 8 | Prepare for Test 2 (Th 10/20) |
| 10 | Fall Break; Test Review | HW 7 | |
| 11 | Graph Algorithms | 9 | HW 8 |
| 12 | String Matching; Probabilistic Algorithms | handouts; 10 | HW 9 |
| 13 | Computational Complexity; Test 3 | 12 | Presentation Proposal; Prepare for Test 3 (Th 11/17) |
| 14 | Student Presentations; Thanksgiving Tu 11/22 — Prathima Bommineni, Radix Sort Silpa Chilakapati, Bubble Sort Nagasree Chalasani, Prim Gopalagari Deepti, Boruvka |
||
| 15 | Student Presentations Tu 11/29 — Karlene Clapp, Las Vegas 8 Queens Nicolas Renet, Thompson Alex Dexter, Hexagonal Grids Travis Maurer, A* Th 12/1 — Robert Littleford, Gale-Shapley Rithesh Makkena, Strassen Kelly Wheeler, Genetic Algorithms Nick Niverson, Burrows-Wheeler |
TBA | |
| 16 | Student Presentations Tu 12/6 — Jerry Simon, Bisection Divesh Angula, Floyd Sashi Balijepalli, Bellman-Ford Graham Watson, Doomsday Th 12/8 — Ben Sample, 196 Trey Butz, DES Udaya Atyam, Shell Sort |
TBA |
Final Exam: Tuesday, December 13, 7:00 pm - 9:00 pm
Extra credit homework (due at final exam)