Course Plan

Face-to-Face Learning

:General information

College IT
Department Computer science
Semester 2 Academic year 2022-2023

:Course details

Course name ‫الرياضيات المتقطعة‬ Course number 0612102

Credited hours 3 Theoretical Practical Actual
Course Level Year 1
Concurrent
Prerequisite - -
Requirement

Compulsory -1
Course type college -2

The link of the

course’s page on the
Web

:Instructor’s Information

Name of the instructor YAHIA.M.ALEMAMI

E-mail [email protected]

Course time Sun, Tue , Thu 1.30-2.30

Office hours Sun , Tues , Thu 11.30-12.30

Office phone number -

1
 Name of the lab
supervisor -
(laboratory)

Textbook

Discrete Mathematics and its Applications” by Kenneth H. Rosen, 5th Edition, 

.McGraw-Hill Higher Education, 2003, ISBN 0-07-331271-1

Main references: reference title, author(s), edition, year, ISBN, publisher, book website.

Discrete Mathematics and its Applications” by Kenneth H. Rosen, 5th Edition, 

.McGraw-Hill Higher Education, 2003, ISBN 0-07-331271-1


Secondary references: reference title, author(s), edition, year, ISBN, publisher, book
.website




:Description of the course

This course aims to introduce students to various discrete mathematical structures and
theories that hold significant relevance in the field of computer science. Students will
explore topics such as sets, matrices, mathematical logic, counting techniques, relations,
functions, and trees. Additionally, the course will provide students with essential
mathematical tools and analytical skills for effectively proving theorems and solving
problems in the context of computer science. Through this curriculum, students will
develop a strong foundation in discrete mathematics, empowering them to apply these
.concepts in real-world problem-solving scenarios

:Learning objectives

:By the end of this course, students will be able to

Understand and apply fundamental concepts of sets, including set operations and set .1
.notation
Analyze and manipulate matrices, including matrix operations and their applications .2
.in computer science
Comprehend and use mathematical logic, including propositional and predicate logic, .3
.to reason about computational problems
Utilize various counting techniques, such as permutations and combinations, to .4
.analyze and solve problems related to algorithms and data structures
Investigate and work with relations and functions to model and represent data and .5
.processes in computer science
2
Develop skills in theorem proving and apply these techniques to verify the correctness .6
.of algorithms and programs
Demonstrate problem-solving abilities using discrete mathematical structures and .7
.theories in the context of computer science challenges
Apply mathematical tools and analytical techniques to develop efficient algorithms .8
.and solutions for computational problems
Recognize the relevance of discrete mathematics in computer science and its impact .9
.on various areas of the discipline

Additionally, this course will incorporate practical implementation of concepts using

Octave programming language. Students will learn how to implement algorithms and
solutions for various computational problems covered in the course using Octave. This
hands-on experience will enable students to bridge the gap between theoretical
understanding and real-world applications, enhancing their problem-solving skills and
computational thinking abilities. By working with Octave, students will gain valuable
experience in applying discrete mathematics concepts to practical scenarios in computer
.science

:Learning Outcomes (LO)

:Learning Outcomes (LO)

LO1: Acquire a solid understanding of fundamental concepts related to sets, .1
including set notation and set operations, and apply this knowledge to solve
.problems in computer science
LO2: Demonstrate proficiency in analyzing and manipulating matrices, .2
understanding matrix operations, and applying matrices in various computer
.science applications
LO3: Apply principles of mathematical logic, including propositional and .3
predicate logic, to effectively reason about computational problems and
.decision-making processes
LO4: Utilize various counting techniques, such as permutations and .4
combinations, to analyze and solve algorithmic and data structure problems,
.demonstrating an ability to calculate probabilities and outcomes
LO5: Investigate relations and functions, and effectively model and represent .5
data and processes in computer science scenarios, showcasing a grasp of their
.applications
LO6: Develop skills in theorem proving and employ these techniques to verify .6
.the correctness and efficiency of algorithms and computer programs
LO7:Analyze and apply various properties of sequences, including arithmetic, .7
.geometric, and recursive sequences, to solve problems in computer science
LO8: Implement and apply discrete mathematical concepts and algorithms using .8
the Octave programming language, gaining hands-on experience and practical
.problem-solving skills in computer science

3
:Course topics

Learning
Week or Topic Required assignments and Outcome
Chapter supplementary resources Number

Chapter 1 discussions, laboratory, LO1,LO8

Sets and Subsets
homework assignments/ activities
Chapter 2 Operations on discussions, laboratory, LO1,LO8
Sets homework assignments/ activities
Chapter 3 discussions, laboratory, LO7,LO8
Sequences
homework assignments/ activities
Chapter 4 Integers and discussions, laboratory, LO2,LO8
matrix homework assignments/ activities
Chapter 5 Logical discussions, laboratory, LO3
Operations homework assignments/ activities
Chapter 6 Conditional discussions, laboratory, LO3
Statements homework assignments/ activities
Chapter 7 Methods of Proof discussions, laboratory, LO6
homework assignments/ activities
Chapter 8 Permutations discussions, laboratory, LO4
homework assignments/ activities
Chapter 9 Combinations discussions, laboratory, LO4
homework assignments/ activities
Chapter 10 Probability discussions, laboratory, LO4
homework assignments/ activities
Chapter 11 Properties of discussions, laboratory, LO5
Relations homework assignments/ activities
Chapter 12 Functions discussions, laboratory, LO5
homework assignments/ activities
13
14
* 15
Final
examination

Week 4: Midterm exam *

Week 8: Final exam *

4
 :Course policies

The instructor can elaborate/ modify the following generic policies to suit the course’s
:requirements

Topic Policy
Conduct at least 1 quiz.
Quizzes Each quiz carries 10 marks.
.No makeup quizzes will be given

The exam is generally composed of general definitions, multiple

Exams
.choice, true/false, problem analysis, and essay questions

Resit exams should not be given unless a legitimate excuse is

Resit exams
.submitted

Dropping
.The dropout period according to the University’s instructions
period

.Cheating/ coping in exams or quizzes is unethical and illegal -

.AHU University instructions are applied -
Integrity
All assignments must be from your own work and in your own -
.language

.The student is expected to attend all lectures -

The policy of AHU University requires a faculty member to give a -
zero mark in case the student misses 15% of the lectures without an
Attendance
.accepted excuse
If a student misses a lecture, it is his responsibility to follow up any -
.announcement/ assignment given to students

Course It is the student's responsibility to constantly follow up on the

resources .electronic information resources related to the course

Workload The student is expected to spend an average of 3 hours per week

.preparing for the course

Marked
The lecturer must submit the examination marks within a week of the
exams
.examination date
Participation
Participation and contribution to the discussions during the lecture -
5
 Topic Policy
will positively affect the final grade. Raise your hand if you have any
.questions

Any kind of distracting, indecent, or side conversations in the lecture -

.will negatively affect you

.Required homework assignments are shown in the previous table -

Assignments and
projects Regarding the course project, more details about its stages and topics -
.will be given at a later time

Course evaluation (Dates and marks):

Mark
Expected Date Evaluation Tool
Postgraduate Undergraduate
30% Week 4 Midterm Exam
Assignments and other
20% Next lecture
* related activities
50% Week 8 Final examination

The distribution here accordingly depends on the course itself; it may, but not *
.exclusively, include homework assignments/ activities, attendance, quizzes......etc