| CSE 20110 |
| Discrete Mathematics |
| 12/10/99 |
| Spring Semester Semester |
| CSE 20110 | 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: | ||
| References: | ||
| Faculty-in-Charge: | ||
| 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 20232 | |
| Co-requisites: | ||
| Topics: | Number of Lectures | |
| Course Content: | ||
| Course Grading: | ||
| Computer Usage: | A number of C++ language programming assignments will be made. | |
| Laboratory Usage: | None | |
| Special Consideration: | None | |