CS122 : Discrete Mathematics

Department

Department of Computer

Academic Program

Bachelor in computer

Type

Compulsory

Credits

03

Prerequisite

MM106

Overview

This course deals with the foundations of logic, logical cases and tools, truth tables and logical relations, sets, functions, algorithms and matrices, mathematical reasoning, methods of proof, mathematical induction, back-to-back definitions and algorithms, harmonics, counting methods, permutations and combinations (and discrete probabilities), probability theory and combinations. discrete.

Intended learning outcomes

1. Recognize the basic concepts of discrete mathematics.

2. Explains the foundations necessary for discrete mathematics to study computer systems and software development.

3. Explain how to use the hypothetical and numerical region in proof methods.

4. Mention the principles of number theory and the basics of counting.

5. Learn how to build and develop software and systems using the limited-state machines model.

Teaching and learning methods

1. The lecture

2. Discussion and dialogue

3. Survey and research

Methods of assessments

first semester 20%

second half 20%

final exam 60%

Total 100%

Course content

the week

Scientific subject

The number of hours

1

The foundations of logic logical issues

4

2

Connectivity Tools

4

3

Truth tables and logical relationships

4

4

groups of functions

4

5-6

Algorithms

6

7

Matrices

4

8

Mathematical reasoning

4

9

Proof methods

4

10-11

mathematical induction

6

12

Harmonics

4

13

Counting methods and combinations

4

14

Probability theory and discrete structures

4

the total

56

References

discrete structures 1 the author d. Omar Zarti

Discrete Mathematical Structures, Author Azzam Sabry