Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
INSTRUCTOR: Sultan Almuhammadi OFFICE: 22-320
 

Summary: INSTRUCTOR: Sultan Almuhammadi
OFFICE: 22-320
PHONE: 860-1625
E-MAIL: muhamadi@ kfupm.edu.sa
COURSE SITE: http://www.ccse.kfupm.edu.sa/~sultanm/ICS253 (see also the webCT)
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 proving
methods.

  

Source: Almuhammadi, Sultan - Department of Information and Computer Science, King Fahd University of Petroleum and Minerals

 

Collections: Computer Technologies and Information Sciences