Instructor: Dr. William H. Winsborough
Office: SB 4.01.26
Phone: 458-5659
Email Address: winsboro at cs dot utsa dot edu
Course Homepage: http://www.cs.utsa.edu/~winsboro/teaching/CS3343F2008/
Office Hours: R 5:00 - 6:00pm SB 4.01.26 and by appointment
Class Times: TR 3:30 - 4:45pm SB 2.02.02
Recitation Time: T 5:30 - 6:20pm HSS 3.04.26

Text: Introduction to Algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. The MIT Press; 2nd edition (September 1, 2001).

Prerequisites: CS 2121, CS 2123, CS 2231, CS 2233, CS 3331, and CS 3333. Concurrent enrollment in CS 3341 is required.

• Basic algorithm design techniques and strategies
• Design of several classic algorithms
• Asymptotic notation for chacterizing algorithm complexity
• Basic techniques for complexity analysis of various algorithm patterns
• Introduction to NP-completeness

• 20% Each of two Midterm Exams
• 20% Homework Assignments
  
• 5% Attendance (mandatory in both lecture and recitation)
• 35% Final Exam (Friday, December 12, 10:30am - 1:00pm, SB 2.02.02)
  

No make-up exams will be given, except for university sanctioned, excused absences. If you must miss an exam (for a good reason), it is your responsibility to contact me as far before the exam as possible. In most cases, you must talk to me several weeks before the exam for the absence to be excused. At minimum, you must leave a message at the above number or send me email. If it is my judgement that this message should have come earlier, the grade for that exam will be a zero. If a make-up exam is given, it may be harder than the regular exam.

Unless other arrangments are made with me, all assignments are due at the beginning of class on the due date. Assignments turned in after that time will be accepted at my discression. Do not miss class to finish an assignment. Turn in what you have for partial credit.

You must write your solutions to the assignments by yourself and without help from anyone. That said, you are encouraged to discuss the problems with other students, but only after you have attempted the problem by yourself. While I recognize that this aspect of the policy cannot be enforced, it is in your interest to follow it because this is the easiest, most effective way to learn the material and perform well on the exams. If you discuss the problems with others, you must identify them on your homework paper. You must also write up your solution entirely independently. Scholastic dishonesty will be treated harshly. Cheaters, including students who assist others cheat, can expect to receive a failing grade and to be reported to the University for possible further disciplinary action. Students who hand in problem solutions that are identical or nearly identical will likely be considered to be cheating.

• Week of 8/25 (1 lecture)
  Chapters 1 and 2
  Course Introduction and Significance
• Week of 9/1 (1 lectures - Lecture and recitation on T 9/2 is canceled Lecture on R 9/4 is covered by Professor Jianhua Ruan)
  Chapter 2
  Insertion Sort, Loop Invariants
• Week of 9/8 (2 lectures)
  Chapters 2 and 3
  Complexity Analysis of Insertion Sort, Asymptotic Notation
• Week of 9/15 (2 lectures)
  Chapters 2 and 3
  Asymptotic Notation, Growth of Functions, Merge Sort, Divide and Conquer Strategy,
• Week of 9/22 (2 lectures)
  Chapters 2, 3, and 4
  Correctness and Complexity Analysis of Merge Sort, Recurrences
• Week of 9/29 (2 lectures)
  Chapters 2, 3, and 4
  Recurrences
• Week of 10/6 (1 lecture, 1 midterm 10/4)
  Catch up and Review
• Week of 10/13 (2 lectures)
  Topics and Chapters To Be Announced (TBA)
  
• Week of 10/20 (2 lectures)
  TBA
  
• Week of 10/27 (2 lectures)
  Winsborough out of town 10/27-31
  TBA
  
• Week of 11/3 (2 lectures)
  TBA
  
• Week of 11/10 (1 lecture, 1 midterm 11/8)
  Catch up and Review
• Week of 11/17 (2 lecture)
  TBA
  
• Week of 11/24 (1 lecture, Thanksgiving)
  TBA
  
• Week of 12/1 (2 lectures)
  TBA
  
• Week of 12/8
  Final exam, Friday, December 12, 10:30am - 1:00pm