CSE 210
Discrete Mathematics
12/10/99
Spring Semester Semester
CSE 210Discrete Mathematics(3-0-3)
 Introduction to mathematical techniques fundamental to Computer Engineering and Computer Science. Topics: mathematical logic, induction, set theory, relations, functions, recursion, recurrence relations, introduction to asymptotic analysis, algebraic structures, graphs, machine computation.
  
Text: K. Rosen, Discrete Mathematics and its Applications, 5th ed., McGraw Hill, , 1995, 0-07-289905-0
 
References: P. Fletcher, H. Hoyle, & C. W. Patty, Foundations of Discrete Mathematics, , PWS-Kent, Boston, 1991,
 
Faculty-in-Charge: Gregory R. Madey
 
Course Goals:Discrete mathematics is characterized by techniques and representative problems that are quite different from those that a student typically encounters in the usual mathematics courses such as calculus and differential equations. The goal of this course is to introduce the student to these techniques and to lay the foundation for more advanced courses in computer science and computer engineering.
Prerequisites:CSE 232
Co-requisites:
  
Topics: Number of Lectures
  Proof Techniques3
  Elementary set theory, functions, and relations7
  Propositional and predicate logic and formal proof7
  Mathematical induction4
  Boolean algebra1
  Combinations and discrete probability8
  Combinations objects such as graphs and trees and their basic properties10
  An introduction to languages and grammars, finite automata, machines and model of computation2
  
Course Content:
 Engineering Science 1.0 Credits
 Engineering Design 0.0 Credits
 Mathematics 2.0 Credits
Course Grading:
 Programming assignments 30 %
 Three exams 40 %
 Homework problems 30 %
  
  
Computer Usage:A number of C++ language programming assignments will be made.
Laboratory Usage:None
Special Consideration:None
384 Fitzpatrick Hall
Notre Dame, IN 46556
Phone: (574) 631-8320
Fax: (574) 631-9260