Download total - جامعة العلوم الإسلامية العالمية

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Theoretical computer science wikipedia , lookup

Computational phylogenetics wikipedia , lookup

Transcript
‫جامعة العلوم اإلسالمية العالمية‬
‫دائرة االعتماد وضمان الجودة‬
‫مخطط المادة الدراسية‬
Discrete Mathematical Structures
0601203
Course Name/‫اسم المادة‬
3
48
Credit Hours/)‫الساعات المعتمدة (نظرية وعملية‬
Actual Credit Hours /)‫الساعات الفعلية (نظرية وعملية‬
Prerequisites /‫ المتطلبات المتزامنة‬/ ‫المتطلبات السابقة‬
Lanier Algebra (0601012)
Bachelor
Course No /‫رقم المادة‬
Program Name /‫اسم البرنامج‬
Program No /‫رقم البرنامج‬
The world Islamic secience & Education
University
Information Technolgy
Computer Science
2
First 2016/2017
Bachelor
Software Engineer(SE)+ Network(NW)
English
2012 / every year
University Name /‫اسم الجامعة‬
.1
.2
.3
.4
.5
.6
.7
College Name /‫الكلية‬
.8
.9
Course Level /‫ مستوى المادة‬.10
Semester/Academic Year/‫ الفصل الدراسي‬/ ‫ العام الجامعي‬.11
Degree /‫ الدرجة العلمية للبرنامج‬.12
Other Departments ‫ األقساام األرارى المراترفة تاي سادريا الماادة‬.13
Department Name /‫القسم‬
sharing the course
Teaching language /‫ لغة التدريا‬.14
‫ ساااريا مراجعااة ماطااد المااادة‬/ ‫ ساااريا اساات داط ماطااد المااادة الدراسااية‬.15
Last Syllabus Update /‫الدراسية‬
:Coordinator /‫منسق المادة‬
.16
Dr Ali Al-Ibrahim :Name /‫االسم‬
304 :Office Number /‫رقم المكتب‬
8-10+ 11-01+ 9:30-11:Office Hours/ ‫الساعات المكتبية‬
2363 :Phone Number /‫رقم الهاتف‬
[email protected] :E-mail /‫البريد اإللكتروني‬
:Instructors: /‫مدرسو المادة‬
.17
Dr Ali Al-Ibrahim :Name /‫االسم‬
304 :Office Number /‫رقم المكتب‬
8-10+ 11-01+ 9:30-11:Office Hours/ ‫الساعات المكتبية‬
2363 :Phone Number /‫رقم الهاتف‬
[email protected] :E-mail /‫البريد اإللكتروني‬
: Course Description/‫وصف المادة‬
.18
focus on the fundamental mathematical structures and logical principles that are relevant
to computer science. In this course, students will be encouraged to develop an understanding of
how modern mathematics provides as a sound foundation upon which to build a deeper
understanding of the elements of computing. In addition to textbook problem-sets, students may
possibly engage many mathematical and logical principles through short, focused programming
activities.
Sets, set operations, relations, and functions. Propositional and predicate calculus,
propositions, truth tables, tautologies, fallacies and quantifiers. Induction and recursion. Counting
techniques: Permutations, combinations, and counting finite sets. Graph theory: paths connected
and weighted graphs, matrix representation, spanning trees and traversing graphs and trees.
:Course Goals & Objectives /‫أهداف تدريس المادة ونتائجها‬
.19
1. Effectively use formal logic proofs and logical reasoning to solve problems.
2. Relate and apply these concepts to practical applications of computer science.
3. Model problems in computer science using graphs and trees.
4. The methods used by computer scientists to solve problems are based on the material of
discrete structures. This course is meant to prepare students with the tools and problem
solving skills to help them develop software, tools of analysis, and procedures that they
will be using in both their academic and professional lives. It is essential that the
students understand these topics in order to understand modern computational
techniques.
5. Demonstrate an understanding of combinations and permutations
:Course Content and Schedule /‫محتوى المادة الدراسية والجدول الزمني‬
‫المراجع‬
‫أساليب التقييم‬
‫نتاجات التعلم‬
References Assessment
‫المتحققة‬
policies
Outputs
Question Sets and
1.1,1.2
+ Quiz Subsets,
‫األسبوع المدرس‬
Lecturer week's
Dr
Ali W1
Alibrahim
operations
on Sets
1.3, 1.4
Question Sequences /
+ Quiz Regular
Expressions
Division in
the Integers
‫تفاصيل‬
‫الموضوع‬
Topic
‫الموضوع‬
Topic Details
Sets and
Sets and
Subsets,
Subsets,
operations
on Sets
Dr
Ali W2
Alibrahim
.20
Sequences /
Regular
Expressions
operations
on Sets
Sequences /
Regular
Expressions
Division in Division in
the Integers
the Integers
1.5,2.1
Question Matrices,
+
Homework
Dr Ali
Alibrahim
W3
2.1
Question
Propositions
+
and Logical
Homework
Operations
Dr Ali
Alibrahim
W4
Question Predicates,
Quantifiers,
conditional
statements
Dr Ali
Alibrahim
W5
2.2,2.3
Methods of
Proof
Matrices,
Propositions
and Logical
Operations
Predicates,
Quantifiers,
conditional
statements
Methods of
Proof
Question Product of
+ Quiz Sets and
Partitions
W6
Methods of
Proof
Dr Ali
AlIbrahim
W7
Product of
Sets and
Partitions
Relations and
Diagraphs
4.3,4.4
Question Paths in
+ Quiz relations and
Diagraphs
+ Quiz
Question Equivalence
Relations
Methods of
Proof
Mathematical
Mathematical
Induction
Induction
Product of
Sets and
Partitions
Relations and Relations and
Diagraphs
Diagraphs
Dr Ali
AlIbrahim
W8
Properties of
Relations and
Diagraphs
4.5
Predicates,
Quantifiers,
conditional
statements
First Exam
Dr Ali
AlIbrahim
Mathematical
Induction
4.1,4,2
Propositions
and Logical
Operations
Methods of
Proof
W6
2.4
Matrices
Paths in
relations and
Diagraphs
Paths in
relations and
Diagraphs
Properties of Properties of
Relations and Relations and
Diagraphs
Diagraphs
Dr Ali
AlIbrahim
W8
Equivalence
Relations
Equivalence
Relations
4.7,4.8
5.1,5.2
+ Quiz Operations
Question on Relations
Quzis
Functions/
Dr Ali
AlIbrahim
W9
Operations
on Relations
Operations
on Relations
Dr Ali
W10
Functions/
Functions/
type of
functions
type of
functions
Permutation
Functions.
Second
Exam
Permutation
Functions.
Trees
Trees
W13
labeled
Trees, Tree
Searching
labeled
Trees, Tree
Searching
W14
Undirected
Trees,
Spanning
Trees
Undirected
Trees,
Spanning
Trees
Minimal
spanning
Trees
Minimal
spanning
Trees
Graph,
Graph,
Euler paths
and circuits
Euler paths
and circuits
type of
functions
W11
5.4
Quiz + Permutation
Question Functions.
7.1
Quiz +
Question Trees
7.2,7.3
7.4,7.5
Quiz +
Question
Quiz +
Question
labeled
Trees, Tree
Searching
Undirected
Trees,
Spanning
Trees
Dr Ali
AlIbrahim
W11
Dr Ali
W12
Dr Ali
Dr Ali
Minimal
spanning
Trees
8.1,8.2
Graph,
Euler paths
and circuits
Dr Ali
AlIbrahim
W15
W16
Final Exam
:Activities and Strategies /‫النشاطات واالستراتيجيات التدريسية‬
.21
: Assessment Policies and Course Requirements /‫أساليب التقييم ومتطلبات المادة‬
.22
Grading Component
Points
Date
First Exam
20 %
See the Website
Second Exam
Assignments, quizzes,
attendance and class
activities
Final Exam
20 %
10%
See the Website
See the Website
50 %
100%
See the Website
TOTAL
: Course Polcies / ‫السياسات المتبعة بالمادة‬


.23
Lecture notes will be available before each exam. It will contain homework
assignments and important instructions.
You should read the assigned chapters before class, complete assignments on
time. Ask questions.
:Required Devices and Tools /‫المعدات واألجهزة المطلوبة‬.24
whiteboard
: References/‫المراجع‬
.25
Discrete Mathematical Structures
Kolman, Busby, Ross
Prentice Hall
2009
Sixth Edition
1- Discrete Mathematics, Second Edition, James L. Hein 2003
2- Discrete Mathematics, Fifth Edition, Kenneth A. Ross 2003
3- Discrete Mathematics for IT student , first Edition, Ali Al-Ibrahim 2014
:Additional Notes/‫معلومات إضافية‬
Dr Ali Al-Ibrahim
_______________ Dr Ali Al-Ibrahim
____________
______________________
____________
______________________
.26
:Coordinator /‫اسم منسق المادة‬
:Signature/‫التوقيع‬
: Syllabus committee head/‫مقرر لجنة الخطة‬
: Signature/‫التوقيع‬
:Head of department /‫رئيس القســـم‬
: Signature/‫التوقيع‬
__
: Syllabus committee head (Faculty)/)‫مقرر لجنة الخطة ( الكلية‬
______________________
: Signature/‫التوقيع‬
______________________
:Dean /‫العميد‬
______________________
: Signature/‫التوقيع‬
‫رئيس القسم‬
‫مساعد العميد لضمان الجودة‬
‫ملف المادة‬
‫دائرة االعتماد وضمان الجودة‬
:‫نسخة إلى‬
-