ICS 6B: Boolean Algebra & Logic - Winter 2010

• Class meetings
  • Lecture: MWF 9:00-9:50am, in ICS 174
  • Discussion: MW 2:00-2:50pm, in ICS 174
• Instructor
  • Professor Dan Hirschberg
  • Office hours: MWF 10:00-10:45am, in 4226 Donald Bren Hall
  • Email: dan (at) ics.uci.edu
• Teaching assistant
  • Ish Rishabh
  • Office hours: M 10:15-11:30am, 1:00-1:50pm in 2069 Donald Bren Hall
  • Email: irishabh (at) uci.edu
• Reader
  • Minh Doan
  • Email: daywednes (at) gmail.com
• Text book
  • [Rosen] Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6th edition, McGraw Hill, 2007.
    This book is required, and it should be available at the UCI bookstore.
    Note: There is an online list of errata.
• Course announcements
  • Course announcements will be sent via email to the official UCI email address of all students enrolled in the class.
• Grading
  • Grading will be based on the following weights:
    Final Exam 50%, Quizzes 40%, Homework 10%.
  • You may view your ICS 6B assignment grades on EEE Gradebook
  • Final Exam: Wednesday of week 11 [Mar 17, 8:00-9:45am]
  • Quizzes will be given in Lecture Section, generally on Fridays at the start of the class.
    (Any exceptions will be announced in class.)
    The lowest quiz score will be dropped when computing your quiz average.
  • Homework assignments will generally be due Wednesday, one minute before the start of the lecture (i.e., at 8:59am).
    Homework is to be submitted on the table in the front of the lecture room.
    Late homework, submitted before the end of lecture on the due day, will lose half its score.
    The lowest homework score will be dropped when computing your homework average.
  • Click here for the homework assignments.
    You should be reading sections of the book before those sections are discussed in lecture.
    On occasion, there may be homework questions from sections of the book not yet covered in lecture.
• List of topics, by week. Numbers in parentheses are sections from [Rosen].
  Note that the following schedule is approximate.
  • Week 1: Logic (1.1), Propositional equivalences (1.2), Predicates and quantifiers (1.3)
  • Week 2: Nested quantifiers (1.4), Rules of inference (1.5), Introduction to proofs (1.6)
  • Week 3: Proof methods and strategy (1.7), Sets (2.1, 2.2), Functions (2.3)
  • Week 4: Relations and their properties (8.1), n-ary relations and their applications (8.2)
  • Week 5: Matrices (3.8), Representing relations (8.3), Closure of relations (8.4)
  • Week 6: Equivalence relations (8.5), Partial orderings (8.6)
  • Week 7: Boolean functions (11.1), Representing Boolean functions (11.2)
  • Week 8: Logic gates (11.3), Languages and grammars (12.1)
  • Week 9: Finite state machines (12.2, 12.3)
  • Week 10: Turing machines (12.5)