Text Books:

  • Kenneth H. Rosen, Discrete Mathematics and Its Applications, 8th ed., McGraw-Hill Inc., 2014

Total 18 Weeks include

  • 2 weeks, midterm and final exams
  • 4 week, Introduction & Logic
  • 2 weeks, Sets, Functions, Sequences and Sums
  • 2 weeks, Algorithm>
  • 2 weeks, Number Theory and Cryptography / Induction and Recursion
  • 2 weeks, Counting
  • 2 weeks, Relations
  • 2 weeks, Graphs

Description and Objective of the Course:

1. To demonstrate to students how mathematics can be applied to solve nontrivial real-life problems 2. To gain more experience with mathematical thinking, arguments and proof techniques, which are essential in reasoning about computation 3. To learn about a number of different discrete structures (e.g., sets, relations, graphs, trees, etc.) that provide the mathematical formalizations for many computational problems 4. To hope that students will not only learn some powerful mathematical tools but also develop their ability to perceive, to formulate, and to solve mathematical problems 5. To provide a gateway to more advanced courses in any computer science courses,including data structures, algorithm, database automata theory, computer security, etc.