Syllabus for MAT 237/637 CMP 232-Gillet 305

MAT 237: Applications of Discrete Mathematics.

4 hours, 4 credits. Concepts and applications of graph theory, recurrence relations, linear programming, game theory, difference equations, matrices, combinatorics, statistical inference, probability. Problem solving using mathematical modeling. PREREQ: MAT 176. Note: Primarily for students planning to teach mathematics in a secondary school.

CMP 232: Elementary Discrete Structures and Applications to Computer Science.

4 hours, 4 credits. Sets, relations, and functions; propositional calculus, Boolean algebras, and combinatorial circuits, counting methods; proof techniques; analysis of algorithms; graphs and trees, puzzles; finite machines, sequential circuits, and recognizers. PREREQ: MAT 172 or placement by the Department of Mathematics and Computer Science or Departmental permission. Note: Students who receive a grade below B- in MAT 172 are strongly urged to speak to an adviser in the Department of Mathematics and Computer Science prior to registering for CMP 232.

MAT 637: Topics in Discrete Mathematics.

60 hours, 4 credits. Topics chosen from probability, combinatorics, decision making, game theory, graph theory, recurrence relations, linear programming, statistical inference. Problem solving using mathematical modeling. PREREQ: Two semesters of calculus.

 

Location: Gi 225 TTH 11:00- 12:40 PM

Instructor: Robert Schneider

Contact Info:

Accommodating Disabilities:  Lehman College is committed to providing access to all programs and curricula to all students.  Students with disabilities who may need classroom accommodations are encouraged to register with the Office of Student Disability Services.  For more info, please contact the Office of Student Disability Services, Shuster Hall, Room 238, phone number, 718-960-8441.

 

Final Date:To be determined



Grad Student Projects -- pick one:
  

Grading Policy:


 Course Outcomes:

1.  Perform numeric and symbolic computations (as part of departmental math objective A)

2   State and apply mathematical definitions and theorems  (E)

3.  Count by using combinatorial arguments  (A,B,C)

4.  Analyze and prove identities and inequalities for discrete functions 

5.  Apply discrete mathematics to real-life problems  (C)  


Math Major Outcomes incorporated  :
    

A. Perform numeric and symbolic computations

B. Construct and apply symbolic and graphical representations of functions

C. Model real-life problems mathematically

E. State and apply mathematical definitions and theorems

G. Construct and present a rigorous mathematical argument


Materials and  Resources :

Topics-- to be modified:



Department of Mathematics and Computer Science, Lehman College, City University of New York