| CSE 210 | Discrete 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 Techniques | 3 |
| |
Elementary set theory, functions, and relations | 7 |
| |
Propositional and predicate logic and formal proof | 7 |
| |
Mathematical induction | 4 |
| |
Boolean algebra | 1 |
| |
Combinations and discrete probability | 8 |
| |
Combinations objects such as graphs and trees and their basic properties | 10 |
| |
An introduction to languages and grammars, finite automata, machines and model of computation | 2 |
| | |
| Course Content: |
| | Engineering Science |
1.0 |
| | Engineering Design |
0.0 |
| | Mathematics |
2.0 |
| 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 |