Class Overview

Much of the basic discrete mathematical tools useful in electrical and computer engineering will be presented, with applications. Students will learn actively the art of creating real-world proofs in these areas, preparing them for diverse regions of electrical and computer engineering such as communication, architecture, networking, algorithms, cryptography, etc.

Important Notes

Lectures

  • When: Tue/Thu, 13:00~14:30
  • Where: Kim Beang-Ho & Kim Sam-Youl ITC Building (N1) #102

Exam Schedules

  • Midterm: April 15 (Tue) 13:00 – 16:00, Kim Beang-Ho & Kim Sam-Youl ITC Building (N1) #102
  • Final exam: June 10 (Tue) 13:00 – 16:00

Instructor

Teaching Assistants

  • Seokjin Hong (Head TA)
  • Jein Yoo
  • Jaehoon Kang
  • Sungjun Park
  • Taeha Kim

Textbook

  • Discrete Mathematics and Its Applications (8th edition), by Kenneth Rosen

Schedule

Week Date Class / Assignment Required reading Homework
1 2/25 Tue Introduction [slides]
2/27 Thu Propositional logic [slides] 1.1, 1.2
2 3/4 Tue Propositional equivalences [slides] 1.3
3/6 Thu No Class
3 3/11 Tue Predicate calculus, nested quantifiers [slides] 1.4, 1.5
3/13 Thu Rules of inference [slides] 1.6
4 3/18 Tue Intro to proofs, Proof methods and strategy [slides] 1.7, 1.8 HW1
3/20 Thu Sets, Set operations, Functions [slides] 2.1, 2.2, 2.3 Quiz1 (Sol)
5 3/25 Tue Sequences and summations, cardinality of sets, matrices [slides] 2.4, 2.5, 2.6
3/27 Thu Matrices (II) [slides]
6 4/1 Tue Algorithms [slides] 3.1 HW2, Quiz2 (Sol)
4/3 Thu The growth of functions, complexity of algorithms [slides] 3.2, 3.3
7 4/8 Tue Divisibility and modular arithmetic, integer representations [slides] 4.1, 4.2
4/10 Thu Primes&GCD, solving congruences [slides] 4.3, 4.4
8 4/15 Tue Midterm
9 4/22 Tue Mathematical induction, strong induction and well-ordering [slides] 5.1, 5.2
4/24 Thu Recursive definitions and structural induction, recursive algorithms [slides] 5.3, 5.4
10 4/29 Tue Basics of counting, the pigeonhole principle, Permutations and combinations [slides] 6.1, 6.2, 6.3, 6.5
5/1 Thu Discrete probability, probability theory 7.1, 7.2
11 5/6 Tue No Class (Holiday)
5/8 Thu Bayes' theorem, expected value, variance 7.3, 7.4
12 5/13 Tue Recurrence relations 8.1, 8.2, 8.3
5/15 Thu Inclusion-exclusion 8.5, 8.6
13 5/20 Tue Relations and their properties 9.1, 9.3
5/22 Thu Equivalence relations, partial orderings 9.5, 9.6
14 5/27 Thu Graphs, terminology, and types 10.1, 10.2
5/29 Tue Isomorphism, connectivity, Euler, Hamilton 10.3, 10.4, 10.5
15 6/3 Tue No Class (Holiday)
6/5 Thu TBA
16 6/10 Tue Final exam

Class Policy

Students are encouraged to interact with classmates, as well as the professor and the TAs, to discuss course material and assignment problems. In all your writing, including homework, essays, reports, and exams, use your own words, and acknowledge the source if you use someone else’s slides, quotes, figures, text, etc. Plagiarism and cheating are serious offenses and will be punished by failure on assignments/course, and suspension or expulsion from the university.