This subject aims to develop students' ability to think logically and computationally and help them apply various techniques of discrete mathematics to solve practical problems. While calculus primarily focuses on continuous functions or objects, discrete mathematics encompasses various mathematical concepts related to discrete objects. This course provides students with an opportunity to understand fundamental concepts such as logic, proof, sets, functions, algorithms, relations, graphs, and trees. Although this course is primarily designed for students who will major in computer science in the future, the fundamental concepts of discrete mathematics are applicable not only to computer science but also to general science and engineering. As a result, non-computer major students are allowed to take this course if available slots exist.
The course starts with learning skills of logical and rigorous mathematical thinking, then they connects to computational and algorithmic thinking in the subsequent stage. The lectures cover a broad introduction to various fields within discrete mathematics and provide applied examples at the juncture that will be further explored in higher-level courses.
Please checkout the latest syllabus here
If students have some experience in computer programming, it would help to understand some mathematical concepts more easily. However, this course is basically designed for freshmen, so no prior knowledge is required.
Discrete Mathematics and its Applications, Kenneth Rosen (8th edition), McGraw Hill
You may also use other editions such as 7th edition or global edition. But exercise problems which may be included in homework might be different from 8th edition.
Tue/Thu 14:00 (2:00pm) - 15:15 (3:15pm)
Engineering Building 301 (dong) - 118 (ho)
Jungdam Won (원정담) / [email protected]
Chanha Kim (김찬하) / [email protected]
Euikyun Jung (정의균) / [email protected]
Jooyong Yang (양주용) / [email protected]
Minseok Kim (김민석) / [email protected]