Discrete Structures

Course Objectives:

This course aims to give students the basic concepts of Discrete Mathematics, which enables it to absorb the necessary foundations to study the computer systems and software development.

Course Content:

1. Introduction to the basics of Discrete Mathematics and its Applications in Computer Science.
2. Theory and logic premise and principles of methods of proof.
3. Relations and functions and Boolean algebra.
4. Digital Logic.
5. The principles of number theory and the basics of counting.
6. Finite state machine.

Skills expected from this course:

Upon finishing of this course the student should:

1. Knowledge of the basics of Discrete Mathematics and its Applications in Computer Science.
2. Know the premise and digital logic and how to use in the methods of proof.
3. Understand the principles of the theory of numbers and counting.
4. How to use finite state machine model the situation in software development and systems.


Textbook:
Kolman, Ross and Busby, "Discrete Math structures," 6th Edition, 2007, Prentice Hall, ISBN 0132297516
Reference:
James L. Heinf, "Discrete Structures, Logic, and Computability," 2nd Edition, 2005, Jones & Bartlett Computer Science, ISBN 0763718435