Finite Mathematics - CS 4/51012

 

  Topics     Chapters     Handouts  
Two Interval Graph Problems (Introduction)         pdf  ps  
Combinatorial Circuits Sec. 9.1 and 9.2 from J (or Sec. 1.7 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Boolean Algebras Sec. 9.3 from J (or Sec. 1.7 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Boolean Functions and Synthesis of Circuits Sec. 9.4 and 9.5 from J (or Sec. 1.7 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Synthesis of Circuits: Applications Sec. 9.5 from J (or Sec. 1.7 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Graphs, Directed Graphs: Introduction Sec. 6.1 and 6.2 from A        pdf(1)   ps(1)      pdf(2)   ps(2). 
Representation of Graphs Sec. 6.6 from A (or Sec. 6.5 from J )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Euler Paths and Cycles Sec. 6.5 from A (or Sec. 6.2 from J )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Hamiltonian Cycles and the TSP Sec. 6.3 from J (or Sec. 14.4 and 6.7 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Hamiltonian Cycles: Existence Sec. 14.4 from A        pdf(1)   ps(1)      pdf(2)   ps(2). 
Algebraic Properties of Graphs Sec. 14.1 from A        pdf(1)   ps(1)      pdf(2)   ps(2). 
Planar Graphs Sec. 14.2 from A        pdf(1)   ps(1)      pdf(2)   ps(2). 
Coloring Graphs Sec. 14.3 from A        pdf(1)   ps(1)      pdf(2)   ps(2). 
Trees Sec. 7.1 and 7.2 from J (or Sec. 6.3 and 15.1 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Binary Trees Sec. 7.5 and 7.6 from J (or Sec. 15.2 and 15.4 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Spanning Trees (by Chenyu Yan) Sec. 7.3 from J (or Sec. 15.5 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Isomorphism Problem Sec. 6.6 and 7.8 from J (or Sec. 15.4 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Theory of Codes Sec. 18.1, 18.2 from A        pdf(1)   ps(1)      pdf(2)   ps(2). 
Hamming Codes Sec. 18.3 from A        pdf(1)   ps(1)      pdf(2)   ps(2). 
Intersection Graphs (by Irina Lomonosov)        pdf(1)   ps(1)      pdf(2)   ps(2). 
Routing in Graphs (by Irina Lomonosov)        pdf(1)   ps(1)      pdf(2)   ps(2). 
Discrete Probability (Intro) Sec. 4.4 from J (or Sec. 8.5 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Discrete Probability Theory Sec. 4.5 from J (or Sec. 8.9 from A )       pdf(1)   ps(1)      pdf(2)   ps(2). 
Textbooks: 
James A. Anderson,  Richard Johnsonbaugh,  Douglas B. West, 
Discrete Mathematics with Combinatorics,   Discrete Mathematics, 5/E,   Introduction to Graph Theory, 2/E,  
Prentice Hall, 2001.   Prentice Hall, 2001.   Prentice Hall, 2001.  

HOMEWORKS 
  1. Homework #1  pdf  ps (due 09/17/2002)
    2. results (pdf)
  2. Homework #2  pdf  ps (due 10/08/2002)
    3. results (pdf)
  3. Homework #3  pdf  ps (due 10/15/2002)
    4. results (pdf)
  4. Homework #4  pdf  ps (due 11/5/2002)
    5. results (pdf)
  5. Homework #5  pdf  ps (due 11/26/2002)
    6. results (pdf)
  6. Homework #6  pdf  ps (due 12/3/2002)
    7. results (pdf) solutions (pdf)
EXAMS
  1. Tuesday, October 29, 2002, 3:15 - 4:30 p.m. Info Results
  2. Wednesday, December 11, 2002, 7:45 - 10:00 a.m. Info

 

Finite Mathematics - CS 4/51012

Final Grades (pdf)

 

F. Dragan
dragan@cs.kent.edu
Fall 2002