Dr Ahmad Ali AlZubi

DISCRETE MATHEMATICS

Table of Contents:

General Information

Evaluation

Textbook

Course Description

Contents

Lecture Slides

Test & Examination Resources

 

General Information

There is one section of COMP104 during the first semester of 2007/2008

Please make sure that you are in the correct room(building 1 Second floor Room 9) for lectures.

Additional COMP104 course information appears on the COMP104 Home Page

 

Back to Top

 

Evaluation:

Assessment: The assessment for Discrete Mathematics is as follows.

          • Test 1 – 1-hour test to be held in the lecture on 7^th – 8^th  week. The test contributes 20% to the final assessment.

          • Test 2 – 1-hour test to be held in the lecture on 11^th – 12^th  week. The test contributes 20% to the final assessment.

          • Examination − 2-hour examination to be held in the end-of-semester examination period. The exam contributes 50% to the final assessment.

 

Back to Top

 

Text-book: Grossman, Peter (2002) Discrete Mathematics for Computing. 2nd ed. Basingstoke, Hampshire: Palgrave Macmillan

Teaching Staff: Lectures and tutorials will be presented by Dr Ahmad Al-Zubi, who can be contacted as follows.

          • Office: Room 131(Building 1 7^th Floor

          • Phone: 4735277 (Ext 131)

                    • Email: asseell@yahoo.com

                     

Back to Top

 

Course Description : In Discrete Mathematics, various mathematical ideas that play a key role in computing are introduced. Topics include number bases, logic, sets and relations, recursion, Boolean algebra and cryptography. Although Discrete Mathematics is designed in particular for those who are studying computing and information systems, the unit is relevant and useful for any person with an interest in modern mathematics and its applications.

 

Back to Top

 

Contents :

·       List of Symbols

·       Preface

·       Bases and Number Representation

·       Computer Representation and Arithmetic

·       Logic

·       Sets and Relations

·       Functions

·       Induction and Recursion

·       Boolean Algebra and Digital Circuits

·       Combinatories

·       Introduction to Graph Theory

·       Trees

·       Number Theory

·       Algorithms and Computational Complexity

 

Back to Top

Lecture Slides

Below are links to PDF versions of PowerPoint slides used in lectures. The slides are available in two formats – 3 slides per page (with space for making notes) and 6 slides per page. Choose whichever format you prefer!

Lecture	Section(s) in text		3 slides per page	6 slides per page
32		Final Exam
31	8.2, 8.3		Download	Download
30	8.1		Download	Download
29	8.1		Download	Download
28	7.5		Download	Download
27	7.5		Download	Download
26	7.1		Download	Download
25	7.1		Download	Download
24			Second Exam
23	5.5, 7.1		Download	Download
22	5.5		Download	Download
21	5.5		Download	Download
20	5.3, 5.4, 5.5		Download	Download
18	5.2, 5.3		Download	Download
17	5.1, 5.2		Download	Download
16	4.7		Download	Download
15	4.7		Download	Download
14			First Exam
13	4.6		Download	Download
12	4.6		Download	Download
11	4.5, 4.6		Download	Download
10	4.4, 4.5		Download	Download
9	4.3		Download	Download
8	4.1, 4.2, 4.3		Download	Download
7	3.4		Download	Download
6	3.3, 3.4		Download	Download
5	3.2, 3.3		Download	Download
4	2.5, 3.1, 3.2		Download	Download
3	2.4, 2.5		Download	Download
2	2.3, 2.4		Download	Download
1	2.1, 2.2, 2.3		Download	Download

 

Back to Top

Test and Exam Resources

Please note that Dr Ahmad Al-Zubi did not teach Discrete Mathematics before 2006 at Riyadh Community College, so test and examination papers Before2006 are not available.

The following documents are related to the two tests for Discrete Mathematics.

First Exam:
Test 1, 2006 – Solutions to Test 1, 2006
Second Exam:
Test 2, 2006 – Solutions to Test 2, 2006
 

Please do not hesitate to contact Dr Ahmad Al-Zubi if you have any problems, difficulties or questions about the work in Discrete Mathematics.

 

Back to Top