Instructor: Dr. William H. Winsborough
Office: SB 4.01.26
Phone: 458-5659
Email Address: wwinsborough at acm dot org
Office Hours: SB 4.01.26 by appointment (set up by email, phone, or stopping by)

Class Times: TR 2:00 - 3:15pm EB 3.02.02
Recitation Times:
2231 001 T 3:30 - 4:20pm HSS 3.02.02
2231 002 R 3:30 - 4:20pm HSS 3.02.02
Course Homepage: http://www.cs.utsa.edu/~winsboro/teaching/CS2233S2009/

TA: Angela Dean
Office Hours: To be announced
Email Address: angelakdean at gmail dot com

Text: Discrete Mathematics and Its Applications, Sixth Edition by Kenneth H. Rosen

Prerequisites: CS 1721, CS 1723, and MAT 1223. Concurrent enrollment in CS 2231 is required.

• Propositional and predicate calculus
• Basic set theory and functions
• Mathematical proof
• Techniques for specifying and analyzing algorithms
• Basic asymptotic complexity and order notation (big-O)
• Induction, recurision, and recurrences
• Introduction to relations, equivalence relations and order relations
• Introduction to graph theory and trees

• 20% Each of two Midterm Exams
• 20% Homework Assignments
  
• 5% Attendance
• 35% Final Exam (Thursday, May 7, 10:30am 1:00pm in regular lecture room)
  

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 (the instructor) 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 otherwise stated, all assignments are due at the beginning of class on the due date. Assignments turned in after that time may receive a zero, however you should discuss the matter with me, as homework is more important as a learning opportunity than as a measurement device. Do not miss class to finish an assignment. Turn in what you have for partial credit and discuss with the instructor whether turning in the rest later will be acceptable.

You must write your solutions to the assignments by yourself and without help from anyone. You may, however, discuss problems with other students, once you have studied the problem on your own. Do not make it harder for yourself to learn the material by failing to think about problems on your own before you discuss them with others. This will make a big difference to your performance on exams when it really counts.

Scholastic dishonesty will be treated harshly. Cheaters, including students who assist others to cheat, can expect to be reported to the University. Students who hand in problem solutions that are identical or nearly identical to those of other students or other sources of answers will likely be considered to be cheating.

• Week of 1/12 (2 lectures)
  Sections 1.1, 1.2
  Logic and Propositions
• Week of 1/19 (2 lectures)
  Sections 1.3, 1.4
  Propositions, Predicates, and Quantifiers
• Week of 1/26/3 (2 lectures)
  Sections 1.5, 1.6, 1.7
  Rules of Inference, Methods of Proof
• Week of 2/2 (2 lectures)
  Sections 2.1, 2.2, 2.3
  Sets and Set Operations, Functions
• Week of 2/9 (2 lectures)
  Sections 2.3, 2.4
  Properties of Functions, Sequences and Sums, Countability
• Week of 2/16 (1 lecture, 1 midterm 2/19)
  Catch up and Review (Come prepared with questions)
• Week of 2/23 (2 lectures)
  Sections 3.1
  Go over exam, Algorithms
• Week of 3/2 (2 lectures)
  Sections 3.2, 3.3
  Growth of Functions and Complexity of Algorithms
• Week of 3/9 Spring Break (You're on your own)
  Travel, Hang Out and Groove
• Week of 3/16 (2 lectures)
  Sections 4.1, 4.2
  Mathematical Induction and Strong Induction
• Week of 3/23 (2 lectures)
  Sections 4.2, 4.3
  Correctness of Induction, Well-Ordering, Recursive Definitions
• Week of 3/30 (1 lecture, 1 midterm 4/2)
  Catch up and Review (Come prepared with questions)
• Week of 4/6 (2 lectures)
  Sections 4.4, 7.1, 7.2
  Recursive Algorithms, Recurance Relations,
• Week of 4/13 (2 lecture)
  Sections 7.3, 8.1
  Divide-and-Conquer Algorithms, Relations
• Week of 4/20 (2 lectures)
  Section 8.2, 8.5, 8.6, 9.1
  Equivalence Relations, Partial Orderings, Graphs
• Week of 4/27 (1 lecture)
  Sections 9.2, 10.1
  Representations of Graphs, Trees
• Week of 5/4 (Final exam)
  Thursday, May 7, 10:30am-1:00pm in lecture room