EE213: Discrete Methods for Electrical Engineering

Course Info

Instructor: Prof. Sung-Ju Lee (, N1 #812
TAs: Haeyoon Cho, Andrew Wan Ju Kang, Boseong Kim, Adiba Orzikulova, Hyojun Soon, HyungJun Yoon
When: Tue/Thu 10:30-11:45
Where: Online Class
Class website:
KLMS page (for online lectures):
Class email:
Campuswire page:
Office hours: By appointment


  • During the remote classroom operation due to the Coronavirus outbreak, this class will provide online course videos that the students can view anytime (non-live).

  • 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..


    • Basic high-school math skills
    • Commitment, energy, enthusiasm to learn


    Discrete Mathematics and Its Applications 8th edition
    by Kenneth Rosen

    Grading Policy

    Quizzes 22% Short quiz at the beginning of each class. (Starting from September 8th)
    Final Exam 40% No midterm exam; The format will be announced later.
    Homework 30% Problem exercises and short essays.
    Participation 8% This course would be successful only when it's interactive. Students are highly encouraged to ask questions, present their opinion, and lead discussions. (in campuswire)


    • 9/7 Announcement about quizzes
      1) The link to the quiz will be uploaded on a class website (from Sep 8th)
      2) Questions will be from the content of the class
      3) Criteria for grading is: +1 for correct answer, 0 for incorrect answer, and -1 for no answer or missing the quiz
      4) Duration of quiz will be very short, so we suggest you to be ready to take a quiz at least one minute prior to the beginning of the quiz
      5) Tomorrow's (September 8th) quiz will start at 10:30:00 and the due is at 10:32:00 (two minutes)
      6) The duration of quiz might depend on the difficulty of the problem. We will give notices about the duration of the coming quizzes in advance

    • 9/1 Instructions about making Second Chance video:
      1) You should first be confirmed as a preview presenter from the professor.
      2) Please follow the instructions until Chapter 2 as instructed in this file.
      3) Send us the video via the course email (

    • 9/1 Welcome to EE213! If you're ready to take this course, please do the following:
      1) Submit this form ( to get access to course materials
      2) Join our Campuswire group(password: 1446) for class discussions


    Week Date Class / Assignment Quiz Preview Required reading Submission
    1 9/1 Tue Class overview [slides] [video1] [video2]
    9/3 Thu Propositional logic [slides] [video1] [video2] 1.1, 1.2
    2 9/8 Tue Propositional equivalences [slides] [video] link 1.3
    Due: Homework #1 [slide] Submit
    9/10 Thu Predicate calculus, nested quantifiers [slides] [video1] [video2] [video3] link 1.4, 1.5
    3 9/15 Tue Rules of inference [slides] [video1] [video2] link 1.6
    9/17 Thu Intro to proofs[slides] [video1] [video2] link 1.7
    Due: Homework #2 [slide] [solution] submit
    4 9/22 Tue Proof methods and strategy [slides] [video1] [video2] link 1.8
    9/24 Thu Sets, set operations [slides] [video1] [video2] [video3] link 2.1, 2.2
    5 9/29 Tue Functions [slides] [video1] [video2] link 김윤서 2.3
    Due: Homework #3 [slide] [solution] Submit
    10/1 Thu Chuseok – no class
    6 10/6 Tue Sequences and summations, cardinality of sets, matrices [slide] [video1] [video2] [video3] [video4] link Sabina Abdurakhmanova 2.4, 2.5, 2.6
    10/8 Thu Divisibility and modular arithmetic, integer representations, primes&GCD [slides] [video1] [video2] [video3] [video4] [video5] [video6] link 유소영 4.1, 4.2, 4.3
    7 10/13 Tue Mathmatical induction, strong induction and well-ordering [slides] [video1] [video2] [video3] link 김윤서 5.1, 5.2
    10/15 Thu No class
    Due: Homework #4 [slide] [solution] Submit
    8 10/20 Tue Midterm week
    10/22 Thu Midterm week
    9 10/27 Tue Recursive definitions and structural induction, recursive algorithms [slide] [video1] [video2] [video3] [video4] link 5.3, 5.4
    10/29 Thu Basics of counting, the pigeonhole principle [slide] [video1] [video2] [video3] link Sabina Abdurakhmanova 6.1, 6.2
    10 11/3 Tue Permutations and combinations [slide] [video1] [video2] link Zunnoor Fayyaz Awan 6.3, 6.5
    11/5 Thu Discrete probability, probability theory [slide] [video1] [video2] [video3] link Suyun Chae 7.1, 7.2
    11 11/10 Tue Bayes' theorem, expected value, variance [slide] [video1] [video2] [video3] [video4] link 이하영 7.3, 7.4
    Due: Homework #5 [slide] [solution] Submit
    11/12 Thu Recurrence relations [slide] [video1] [video2] [video3] link 오범석 8.1, 8.2, 8.3
    12 11/17 Tue Inclusion-exclusion [slides] [video1] [video2] link 박강태 8.5, 8.6
    11/19 Thu Relations and their properties [slides] [video1] [video2] link> Sabina Abdurakhmanova 9.1, 9.3
    13 11/24 Tue Equivalence relations, partial orderings [slides] [video1] [video2] link 9.5, 9.6
    11/26 Thu Graphs, terminology, and types [slides] [video1] [video2] [video3] [video4] link 10.1, 10.2
    14 12/1 Tue Isomorphism, connectivity, Euler, Hamilton [slides] [video1] [video2] [video3] [video4] [video5] link 최태훈 10.3, 10.4, 10.5
    Due: Homework #6 [slide] [solution] Submit
    12/3 Thu Trees, traversal, spanning trees [slide] [video1] [video2] [video3] [video4] link Sabina Abdurakhmanova 11.1, 11.3, 11.4
    15 12/8 Tue No class
    12/10 Thu Undergrad admissions interview. No Class
    16 12/15 Tue Finals week
    12/16 Wed Honor Code Submit
    12/17 Thu Finals, Thu 9am ~ Fri 11:55am [Finals Slides][Finals Video] [Finals Slides] [LaTeX Tutorial] [Final LaTeX Skeleton Tex] [Final LaTeX Skeleton pdf]
    Final Exam (Thu 9am ~ Fri 11:55am) [Finals Tex to submit] [Finals pdf] [Finals solution] Submit
    12/18 Fri

    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 exams/assignments/course, and suspension or expulsion from the University.