Course Title: Discrete Mathematics

Course Code: CS 122
Credit Value: 3 Credits

Contact Hours

• Lectures: 2 hours/week

• Tutorials / Problem Sessions: 2 hours/week

Duration: 15 Weeks (One Semester)
Prerequisite: Mathematics & Quantitative Reasoning (or equivalent)

1. COURSE DESCRIPTION

This course introduces the mathematical foundations of computer science. It focuses on discrete structures, logical reasoning, and computational problem-solving techniques used in algorithms, data structures, databases, networks, and software engineering.

Emphasis is placed on mathematical thinking as a tool for modeling computation, analyzing algorithms, and proving correctness of computational processes.

2. COURSE OBJECTIVES

By the end of this course, students should be able to:

• Apply logical reasoning in computational problem-solving

• Model systems using sets, relations, and functions

• Apply combinatorics in counting and algorithmic analysis

• Use graph and tree structures to represent computational problems

• Apply mathematical induction and recurrence relations in algorithm analysis

• Develop foundational proof skills for computer science

3. LEARNING OUTCOMES

Upon successful completion, students will be able to:

• Construct and simplify logical expressions using propositional and predicate logic

• Apply Boolean algebra in computational contexts

• Use sets, relations, and functions to model data systems

• Apply counting principles in computational problems

• Solve recurrence relations in basic algorithm analysis

• Model and analyze graphs and trees

• Construct valid mathematical proofs including induction