COCS-223

1

Course number:

COCS 223

Name :

Mathematics for Computing

2

Credits:

3

Contact hours:

42 Hrs Lecture

3

Course coordinator’s name:

Prof. Dr. Salah Behiry

4

a)

Textbook:

-Discrete and Combinatorial Mathematics- An Applied Introduction, Ralph. P.Grimaldi, 5th Edition. Pearson Education, 2004

b)

Other references:

-Discrete Mathematical Structures with applications to computer science, Trembly J.P.& Manohar .P, Tata McGraw-Hill Pub Co Ltd, New Delhi, 2007, ISBN-10: 0070651426, ISBN-13: 978-0070651425

-Discrete Mathematics for Computer Scientists & Mathematicians, Mott, J.L., Kandel, A., and Baker. T. P., 2 Sub edition, Prentice Hall, 1986, ISBN-10: 0835913910, ISBN-13: 978-0835913911

5

a)

Synopsis:

The course aims at teaching students Mathematics that enable the student to understand the necessary mathematical foundations for the study of Computer Science and IT related course.

b)

Prerequisites:

COCS 222-Discrete Structures

c)

Type of course:

Core

6

a)

Course Learning Outcomes

Upon finishing this course, the students should be able to:

• Have the knowledge of permutation and combination(a)
• Knowledge of different discrete probabilities (a)
• Can represent different Trees and Graphs with mathematical notations (a,b)

• Finite State Machines models in software and system development.(a,b)

b)

Student Outcomes: This course aims to meet student outcomes (a) and (b) of ABET criterion 3.

.

7

Brief list of topics and their duration

8

Grading System