Course 4190.101: Discrete Mathematics (2008)

 

  • School of Computer Science and Engineering, Seoul National University
  • Instructor: Prof. Byoung-Tak Zhang
  • TA: Seung-joon Yi (Room 301-419, Tel: 880-1847)
  • Classroom: 301-203
  • Time: Mon 13:00-14:15 and Wed 13:00-14:15
  • Textbook
    • Discrete Mathematics and Its Applications, 6th Edition, Kenneth H. Rosen, McGraw Hill, 2007
  • Evaluation: Mid Exam, Final Exam, Projects,  Quiz, Homeworks + Attendance
  • Projects: TBA

    • Topic

Title

Lecture note

    - Course overview

Slide 0

    - Foundations of Logic

Slide 1

    - Basic Proof Methods

Slide 2

    - The Theory of Sets

Slide 3

    - Functions

Slide 4

    - Algorithms

Slide 5

    - The Growth of Functions

Slide 6

    - Complexity of Algorithms

Slide 7

    - Basic Number Theory

Slide 8

Midterm Exam : 4/23

 

    - Matrices

Slide 9

    - Proof Strategy

Slide 10

    - Sequences

Slide 11

    - Summations

Slide 12

    - Countability

Slide 13

    - Inductive Proofs

Slide 14

    - Recursion

Slide 15

    - Combinatorics

Slide 16

    - Probability Theory

Slide 17

    - Recurrence Relations

Slide 18

    - Relations

Slide 19

    - Graph Theory

Slide 20

Project #1 :~5/12

 

Final Exam : TBA

 

Խ
Related Links

This Page is maintained by Seung-joon Yi
Last Update: March 01, 2008.