ICS 253_Syl_081

ICS 253_Syl_081 - ICS 253 Discrete Structures I Term 081...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ICS 253 -- Discrete Structures I Term:: 081 Section:: 1 and 2 INSTRUCTOR : Adel Ahmed OFFICE : 22-316 PHONE : 860-4314 E-MAIL : [email protected] kfupm.edu.sa WEBSITE : www.adelahmed.com DESCRIPTION The course covers various topics in discrete mathematics that are widely used in Computer Science. Discrete mathematics deals with (finite or infinite) objects that are disconnected like books, tables, integers, graphs, and trees. The course is divided into three main areas: logic and mathematical reasoning, counting and combinatorial techniques, and graphs and trees. PREREQUISITES ICS 102 COURSE OBJECTIVES 1. To develop mathematical and thinking skills necessary for reading, comprehending, and constructing mathematical arguments. 2. To learn the fundamental concepts and techniques of discrete mathematics needed for problem solving in computer science. COURSE LEARNING OUTCOMES After completion of this course, the student should be able to: 1. Formulate and derive propositional/predicate logic expressions, and apply
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 2

ICS 253_Syl_081 - ICS 253 Discrete Structures I Term 081...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online