ÌÇÐÄVlog´«Ã½

Student Learning Outcomes

• Students will be able to use basic counting techniques, combinatorics concepts and binomial coefficients.
• Students will be able to understand the terminology of finite graphs and trees and use the basic algorithms for traversal, shortest path, graph coloring.
• Students will be able to use math induction and recursive definitions and algorithms.
• Students will be able to use truth table for propositional calculus.