Course 4190.101.001: Discrete Mathematics (2005)

 

  • 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-101
  • Time: Tue 09:00-10:15 (Lecture) and Thu 09:00-10:15 (Practice)
  • Textbook
    • Discrete Mathematics and Its Applications, 5th Edition, Kenneth H. Rosen, McGraw Hill, 2003.
  • Goals
    • To understand the mathematical facts, concepts, and skills underlying computer science
    • To learn mathematical reasoning, combinatorial analysis, discrete structure and algorithmic thinking
  • Evaluation: Mid exam (30%) , Final Exam (30%), Projects (30%), Homeworks + Attendance (10%)

 Midterm Exam: April 28, 2005 (Ch 1-3)

 Project #1: Deadline May 17, 2005

    • Chapter 4. Counting
      - Combinatorics ( Slide 16 )
    • Chapter 5. Discrete Probability
      - Probability Theory( Slide 17 )
    • Chapter 6. Advanced Counting Techniques
      - Recurrence Relations ( Slide 18 )
    • Chapter 7. Relations
      - Relations ( Slide 19 )
    • Chapter 8. Graphs
      - Graph Theory ( Slide 20 )
    • Chapter 9. Trees
    • Chapter 10. Boolean Algebra
    • Chapter 11. Modeling Computation

Exam #2 :June 16, 2005


Bulletin Board

This page is maintained by Seung-Joon Yi
Last updated: April 26, 2005