QFO-AP-VA-008 : ‫رمز النموذج‬ ‫ خطة المادة الدراسية‬: ‫اسم النموذج‬

‫ نائب الرئيس للشؤون‬:‫الجهة المصدرة‬

2 )Rev( :‫رقم اإلصدار‬
‫األكاديمية‬
‫جامعة فيالدلفيا‬
4-5-2021 :‫تاريخ اإلصدار‬
‫ اللجنة العليا لضمان الجودة‬: ‫الجهة المدققة‬ Philadelphia
4 : ‫عدد صفحات النموذج‬ University

Course Title:
Course code: 750120
Discrete Mathematics
Course Level: 1 Course prerequisite (s) and/or corequisite(s):
Lecture Time: Credit hours: 3
UR FR DR X C E

Academic Staff Specifics

Office No. and
Name Rank Office Hours E-mail Address
Location
Dr. Assistant
Mohammad professor 7309 ST: 10:30– 11:00 mtaye@philadelphia.edu.jo
MW:11:00–12:30
Taye

The Learning Style Used in Teaching the Course

The Learning Style
Blended Learning
Electronic Learning
Face-to-Face Learning X
Face-to- Electronic Blended
Face Percentage
100%

Course/Module Description:
This course studies the mathematical elements of computer science. Topics include propositional
logic; predicate logic; mathematical reasoning; techniques of proof; mathematical induction; set
theory; number theory; matrices; sequences and summations; functions, relations and their
properties, elementary graph theory, and tree.

Course/Module Objectives:
 Simplify and evaluate basic logic statements including compound statements, implications,
inverses, converses, and contrapositives using truth tables and the properties of logic.
 Express a logic sentence in terms of predicates, quantifiers, and logical connectives
 Apply the operations of sets and use Venn diagrams to solve applied problems.
 Determine the domain and range of a discrete or non-discrete function, identify functions types,
perform the composition of functions,

1
 List the terms in a sequence, write a sequence in closed form, compute the sum of a finite
sequence,
 Use elementary number theory including the divisibility properties of numbers to determine
prime numbers and composites, the greatest common divisor, and the least common multiple;
perform modulo arithmetic
 Perform basic matrix operations including sums, products, and transpose and perform 0-1
matrix operations.
 Apply rules of inference, and methods of proof including direct and indirect proof forms, proof
by contradiction, and mathematical induction and write proofs using symbolic logic and
Boolean Algebra.
 Describe binary relations between two sets; determine if a binary relation is reflexive,
symmetric, or transitive or is an equivalence relation; combine relations using set operations and
composition.
 Determine if a given graph is simple or a multigraph, directed or undirected, cyclic or acyclic,
and determines the connectivity of a graph.
 Represent a graph using an adjacency list and an adjacency matrix and apply graph theory to
application problems such as computer networks.
 Determine if a graph is a tree or not; use the properties of trees to classify trees, identify
ancestors, descendants, parents, children, and siblings; determine the level of a node, the height
of a tree or subtree.
 Perform tree traversals using preorder, in order, and post order traversals and apply these
traversals to application problems.

Course/ module components

 Textbook:
Discrete Mathematics and Its Applications, Kenneth H. Rosen, McGraw Hill, 7th edition, 2013.

Supporting material(s): Lectures handouts

Teaching methods:
Duration: 16 weeks, 48 hours in total
Lectures: 32 hours (2 hours per week),
Tutorials: 16 hours (1 per week),

Learning outcomes

A-Knowledge and understanding: with the ability to …

A1) Understand basic concepts of logic and proofs.
A2) Understand basic concepts of sets.
A3) Understand basic concepts of functions.
A4) Understand basic concepts of sequences and summations.
A5) Understand basic concepts of integers.
A6) Understand basic concepts of matrices.
A7) Understand basic concepts of relations.
A8) Understand basic concepts of graphs.
A9) Understand basic concepts of trees.

B- Intellectual skills: with the ability to …

B1) Use propositional and predicate calculus in reasoning.
B2) Prove equivalences and properties.
B3) Identify set identities
B4) Distinguish between geometric and arithmetic progression
2
B5) Find a result of a summation
B6) Identify operations and properties of sets, functions, relations, matrices, graphs, and trees
B7) Recognize the relationship between graphs, relations, and matrices
B8) Identify prime numbers, and calculate GCD and LCM

C- Subject specific skills – with ability to …

C1) Use proper proof method for a given problem.
C2) Apply mathematical structures to represent real situations and find their properties.

D- Transferable skills – with ability to

D1) Work in a group in order to represent mathematically specific subject.
D2) Communicate effectively by oral and written means.

Learning outcomes achievement

 Development: A, B, C and D are developed through the lectures, Tutorials, Homework’s,
and lab work

 Assessment : A, B, C and D are assessed through Assignments, Quizzes, Homework,

and written Exams.

Assessment instruments

Allocation of Marks
Assessment Instruments Mark
mid examination 30%
Final examination 40%
Quizzes, and tutorial contributions 30%
Total 100%

Course/Module Academic Calendar

Basic and
Homework/reports and
Week support material Lab works and tutorials
their due dates
to be covered
Assignments: selective
questions from
Propositional Q:11,13,14,16,17,18,19,31-
(1) 1st Tutorial
Logic 39 in Pages 13-15. Or
Quiz on Truth table,
translation
Assignments: selective
questions from Q:2,3,5-10
- 1st Lab work: using
- Applications of in Pages 22-23, Or
proposition logic in
Propositional Assignments: selective
computer programs.
(2) Logic questions from Q:1-6,9-33
- Propositional in Pages 34-35, Or
- 2nd Tutorial:
Equivalences Quiz on Translation,
Propositional Equivalences
Program Specification,
proposition equivalences.

3
 Assignments: selective
questions from Q:9-16,22-
29,35,36,43, in Pages 53-
Predicates and
56, Or
quantifiers
(3) Assignments: selective 3rd Tutorial
Nested
questions from Q:1,2,8-
quantifiers
17,24-28 in Pages 64-67,
Or
Quiz on Quantifications
Assignments: selective
questions from
Rules of
(4) Q:6,9,10,15,17,23-29 in 4th Tutorial
Inference
Pages 78-80 Or
Quiz on Inference rules
Assignments: selective
Introduction to questions from
(5) 5th Tutorial
proofs Q:1,2,6,17,18,26,27 in
Page 91 Or Quiz on Proofs
Assignments: selective
questions from Q:1,2,5- - 6th Tutorial
24,27,32, in Pages 125-
126, Or selective questions - 2nd Lab work: Using
Sets and from Q:3,4,25,29,47 in sets and set operations in
(6)
Set operations Pages 136-137, Or computer programs.
Quiz on Set operations

(7) Written exam on materials

First Revision in Sections 1.1-1.8 and -
examination Sections 2.1, 2.2
Assignments: selective
questions from Q:8-
- 7th Tutorial
15,22,23 in Pages 152-153,
Functions, Or selective questions from
(8) - 3rd Lab work: Using
Sequences, and Q:1-4,29-34 in Pages 167-
Functions, sequences, and
summations 169, Or Quiz on Function
summations in computer
Operators, Function
programs.
properties, find a sequence
formula. or summation.
- 8th Tutorial
Assignments: selective
questions from Q:1-
- 4th Lab work: Using one
(9) Matrices 5,10,26-29 in Pages 183-
and two dimensional
185, Or Quiz on Matrix
arrays in computer
Operators.
programs
(10) Divisibility and selective questions from
modular Q:1-4,14-17,24,25, in - 9th Tutorial
arithmetic Pages 272-273, Or Quiz on
Primes and Finding mod, prime - 5th Lab work: Using
greatest common factorization, GCD, LCM Prim numbers, greatest
divisors common divisors in
computer programs
4
 Assignments: selective
Mathematical questions from Q:5, 14-16 10th Tutorial
(11)
Induction in Pages 329-330, Or Quiz
on proving by induction
Assignments: selective
questions from Q:3,6,7,26-
28,30,32. in Pages 581-
583, Or selective questions
Relations and from Q:1-4,13-15,22-28, in
(12) their properties Pages 296-297, Or
Second Representing selective questions from
examination relations Q:2,3,25,26, in Pages 606-
Closures of 607, Or selective questions
relations from Q1,21,23,24 in Pages 11th Tutorial
Equivalence 615,616 Or Quiz on
relations relation operator or
representation.
Graphs and Assignments: selective
graph models, questions from Q:1-
Graph 3,20,35,. in Pages 665-667, - 12th Tutorial
terminology and Or selective questions from
special types of Q:1-15 in Page 675, Or - 6th Lab work: Representing
(13)
graphs, selective questions from graphs in computer
Representing Q:1-5, in Page 689 Or Quiz programs.
graphs on graph terminology or
Connectivity representation.
Assignments: selective
questions from Q:1-9 in - 13th tutorial
Page 755, Or selective -
Introduction to
questions from Q:7- - 7th Lab work: Representing
(14) trees
16,23,24 in Pages 783-784 tree with tree traversal in
Tree Traversal
Or Quiz on Tree computer programs.
terminology or tree
traversal.
(15) Revision -
(16) -
Final
Final Exam
Examinatio
n

Expected workload:
On average students need to spend 3 hours of study and preparation for each 50-minute
lecture/tutorial.

Attendance policy:
Absence from lectures and/or tutorials shall not exceed 15%. Students who exceed the 15% limit
without a medical or emergency excuse acceptable to and approved by the Dean of the relevant
college/faculty shall not be allowed to take the final examination and shall receive a mark of zero
for the course. If the excuse is approved by the Dean, the student shall be considered to have
withdrawn from the course.

5
Module references
Students will be expected to give the same attention to these references as given to the Module
textbook(s)
A- Required book (s), assigned reading and audio-visuals:
Discrete Mathematics and Its Applications, Kenneth H. Rosen, McGraw Hill, 7th edition, 2012.

B- Recommended books, materials, and media:

- Discrete Mathematics with Applications, Susanna S. Epp, Brooks Cole, 4th Edition, 2010.
- Logic and Discrete Mathematics A Computer Science Perspective, Winfried K. Grassman and
Jean Paul Tremblay, Prentice Hall, 1995.
- Discrete and Combinatorial Mathematics: An Applied Introduction, Ralph P. Grimaldi, 5th
edition, Addison Wesley, 2003.

Website(s):
Useful site:
www.mhhe.com/rosen