Ds Bsds
Discrete Structures
Course Description
Discrete mathematics is mathematics that deals with discrete objects. The purpose of this course is to understand and use (abstract) discrete structures that are backbones of computer science. In particular, this class is meant to introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in computer science
Course Learning Outcomes (CLO)
CLO 1: Explaining the key concepts of Discrete Structures such as Sets, Permutations, Relations, Graphs, and Trees etc.
CLO 2: Apply formal logic proofs and/or informal, but rigorous, logical reasoning to real problems, such as predicting the behavior of software or solving problems such as puzzle
CLO 3: Apply discrete structures into other computing problems such as formal specification, verification, databases, artificial intelligence, and cryptography.
CLO 4: Differentiate various discrete structures and their relevance within the context of computer science, in the areas of data structures and algorithms, in particular.
