This course introduces students to the necessary mathematical skills in solving computer system problems. The topics in this course include Functions and relations: functions, discrete versus continuous function, relations, continuous and discrete relations, sets – Venn diagram, power sets, complements. Foundations of logic: propositional logic, logical connectives, truth table, normal forms, validity. Proof techniques: notion of implication, contradiction, direct proofs, proof by counterexample, proof by contraposition and contradiction, mathematical induction. Recursion and Recurrence Relations: concepts of recursion and recurrence, derivation of recurrence equations, initial condition. Counting: permutations and combinations, counting arguments rule of products, rule of sums, generating functions, modeling combinational problems.