CSE 173: Discrete Mathematics
Course Description
Discrete Mathematics is an introductory course designed for typical computer science student. The course gives a first exposure to mathematical topics essential to their study of computer science or digital logic. Additionally, this course will help the students think mathematically, and will improve their mathematical maturity. Upon completion, students are expected to:
Objectives: The objectives of this course are to
construct mathematical arguments using propositions, predicates, logical connectives, quantifiers, and rules of inference as well as verify them,
select appropriate proof methods (e.g. direct proof, proof by contradiction, proof by contraposition, existence proof, etc) to build simple mathematical proofs,
identify the types and properties of sets, relations, functions, graphs, and trees and prove simple mathematical properties of them
describe recursive function, sequence, or the sum of a series using recurrence relation and solve that using forward/backward substitution method,
prove basic properties of number theoretic operations (e.g. congruence, mod, GCD, and LCM) and apply those to solve simple related problems
apply mathematical induction to prove properties of mathematical objects, series, etc.,
apply the knowledge of summation notation and basic counting techniques to solve simple mathematical problems.
Outcome-based Education (OBE)
Click here for details
Teaching Staff
Instructor
Md. Shahriar Karim
Office location: SAC 1010C
Office hours: Click here
Contact
Required Text
|