CS 507 Mathematical Methods In Computer Science

  • Instructor: Prof. Sung-Hyuk Cha


  • CRN: 34968

  • Meeting:
    • Meeting Times: W 06:00 - 08:40 PM, Spring 2004
    • Place: WM 1215

  • Textbook:Kenneth H. Rosen, Discrete Mathematics and Its Applications, 5th Edition, McGraw-Hill, (1999)

  • Course Description:
    This course provides an intensive introduction to mathematical techniques related to computer science for students with limited background in college mathematics. Topics include sets, logic induction, functions and relations, recursion, combinatorics, graphs and tree algorithms, matrix applications.
    Discrete Mathematics is the gate and key of Computer Science!

  • Schedule:

    WeekTopic
    1 (2/4) Ch 1 The Foundations: Logic, Sets, and Functions
    2 (2/11) Ch 2 The Fundamentals: Algo, Integers, & Matrices
    3 (2/18) Class cancelled
    4 (2/25) Ch 2 The Fundamentals: Algo, Integers, & Matrices
    5 (3/3) Ch 2 The Fundamentals: Algo, Integers, & Matrices
    6 (3/10) Ch 3 Mathematical Reasoning, Induction, and Recursion
    7 (3/17) Spring Break
    8 (3/24) Ch 4 Probability,
    9 (3/31) Ch 5 Discrete Probability, Midterm Exam due
    10 (4/7) Ch 5 Discrete Probability
    11 (4/14) Ch 9 Trees
    12 (4/21) Ch 8 Graphs
    13 (4/28) Ch 10 Boolean Algebra
    14 (5/5) Reviews
    15 (5/12) Final Exam
      

  • Evaluation:
    • Attendance (10%):
    • Homework (10%):
    • Midterm Exam (40%): October 23
    • Final Exam (40%):

  • Course Policies
    • will be added.