Toán rời rạc

Upon finishing the course, students must acquire: 1. the following knowledge: (ABET a.1) • Concepts of logical expressions & predicate logic. • The method of induction and recursive definition. • Concepts of algorithms, recursive algorithms, the complexity. • Recurrence relations and divide-and-conquer algorithms. • Application of integers and congruence in information technology. • Set structure and map, counting principles and combinatorics concepts. • The terminologies and properties of graphs & trees & weighted graphs. • The applications of graphs, trees and weighted graphs in information technology. 2. the following skills: (ABET a.2) • Manipulate logical expressions & produce equivalent logical expressions. • Produce proof of simple mathematical propositions, including applying induction method. • Evaluate complexity of algorithms. • Solving simple congruence equations. • Apply counting techniques in evaluating various set cardinalities. • Solve counting problems, apply in analyze algorithms. • Apply graph’s algorithms to solve problems related to graph theory.