ICS 241: Discrete Mathematics II
Fall, 2007
Instructor: Prof. Lee Altenberg


Syllabus

Texts:

Weekly Assignments:

Week 1: August 20

  • 8: Relations.
    • 8.1 Relations and Their Properties, pp. 519-529

Week 2: August 24

    • 8.2 n-ary Relations and Their Applications, pp. 530-536
    • 8.3 Representing Relations, pp. 537-543

  • For Outreach Students: August 29: Last day to register, or to drop and receive 100% refund.

Week 3: August 31

    • 8.4 Closures of Relations, pp. 544-554
    • 8.5 Equivalence Relations, pp. 555-565

Week 4: September 7

    • 8.6 Partial Orderings, pp. 565-580

  • 7: Advanced Counting Techniques
    • 7.1 Recurrence Relations, pp. 449-459

  • Outreach Students: 09/11/2007: Last day to drop (No "W" on transcript) and receive 50% refund.

    Week 5: September 14

      • 7.2 Solving Recurrence Relations, pp. 460-473

    Week 6: September 21

      • 7.3 Divide-and-Conquer Algorithms and Recurrence Relations, pp. 474-483
      • 7.4 Generating Functions, pp. 484-498

    Week 7: September 28

      • 7.5 Inclusion-Exclusion, pp. 499-504
      • 7.6 Applications of Inclusion-Exclusion, pp. 504-512

    • 9: Graphs
      • 9.1 Introduction to Graphs, pp. 589-596

    Week 8: October 5

      • 9.2 Graph Terminology, pp. 597-610
      • 9.3 Representing Graphs and Graph Isomorphisms, pp. 611-620
      • 9.4 Connectivity, pp. 621-632

    Week 9: October 12

      • 9.5 Euler and Hamilton Paths, pp. 633-646
      • 9.6 Shortest Path Problems, pp. 647-656

    Week 10: October 19

      • 9.7 Planar Graphs, pp. 657-665
      • 9.8 Graph Coloring, pp. 666-674

    • 10/19/2007: Last day for Outreach students to withdraw from class ("W" on transcript).

    Week 11: October 26

    • 10: Trees
      • 10.1 Introduction to Trees, pp. 683-694
      • 10.2 Applications of Trees, pp. 695-709
      • 10.3 Tree Traversal, pp. 710-723

    Week 12: November 2

      • 10.4 Spanning Trees, pp. 724-736
      • 10.5 Minimum Spanning Trees, pp. 737-742

    Week 13: November 9

    • 11: Boolean Algebra
      • 11.1 Boolean Functions, pp. 749-756
      • 11.2 Representing Boolean Functions, pp. 757-759
      • 11.3 Logic Gates, pp. 760-765

    Week 14: November 16

      • 11.4 Minimization of Circuits, pp. 766-780

    • 12: Modeling Computation
      • 12.1 Languages and Grammars, pp. 785-795
      • 12.2 Finite-State Machines with Output, pp. 796-803

    Week 15: November 21 (Day before Thanksgiving)

      • 12.3 Finite-State Machines with No Output, pp. 804-816
      • 12.4 Language Recognition, pp. 817-826

    Week 16: November 30

      • 12.5 Turing Machines, pp. 827-837

    Week 17:
    • Wed. December 5, Week 15 Assignments due.
    • Fri. December 7, Week 16 Assignments due.


    Assignments:

    With the exception of the first and last weeks, and Thanksgiving or Spring Break:
    • Homework will be assigned on Fridays at 5pm.
    • Homework will be due by Friday 5pm, two weeks after it is assigned.