Scribd
Upload
117 views3 pages

Math 241 - Syllabus - Form

This document provides information about a Discrete Mathematics course offered in the second semester of 2016/2017 at Jordan University of Science and Technology. It outlines the course details including the instructor, catalog, topics to be covered over the semester, evaluation criteria, and intended learning outcomes. The course aims to introduce students to discrete mathematical structures important for computing including sets, functions, matrices, graphs, and their applications. Students will learn to apply these concepts to solve problems in computer science and real-life situations. Evaluation will be based on two midterm exams, a final exam, and mastery of topics such as sets, relations, functions, and graph theory.

Uploaded by

Kareem20 Kh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
117 views3 pages

Math 241 - Syllabus - Form

This document provides information about a Discrete Mathematics course offered in the second semester of 2016/2017 at Jordan University of Science and Technology. It outlines the course details including the instructor, catalog, topics to be covered over the semester, evaluation criteria, and intended learning outcomes. The course aims to introduce students to discrete mathematical structures important for computing including sets, functions, matrices, graphs, and their applications. Students will learn to apply these concepts to solve problems in computer science and real-life situations. Evaluation will be based on two midterm exams, a final exam, and mastery of topics such as sets, relations, functions, and graph theory.

Uploaded by

Kareem20 Kh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Jordan University of Science and Technology

Department of Mathematics and Statistics


Course Syllabus
Second Semester 2016 /2017

Course Information
Course Number: Math 241 Course Name: Discrete Mathematics
Credit Hours: 3 hours Contact Hours: Multi-section Course
E-learning web address: https://elearning.just.edu.jo/
Prerequisites: Math 102
Required

Instructor Information
Coordinator: Prof. Saleh Abdullah Instructor: Prof. Saleh Abdullah
Office Hours: Sun. 10:30-12 , M: 10- Office Location: Ph2, upper level
11:30, Tu: 12-1:30, Thu. 10:30 -12.
Instructors E-mail: sabdulah@just.edu.jo

Course Catalog
Course Description:
Introduction to discrete mathematical structures that form the basis for computing.  Sets,
functions and sequences. Propositional calculus, formal proofs, quantifiers, predicted calculus,
mathematical induction.  Matrices, groups, semigroups, homomorphism and isomorphism. 
Relations, partitions, equivalence relations, trees, directed and undirected graphs. 
Textbook:
Discrete Mathematical Structures, Kolman, Busby, and Ross. Sixth Edition., Prentice Hall, 2008

References and Supplement Materials:


1. Skvarcius, Robinson. Discrete Mathematics with Computer Science Applications, 1986.
2. Kenneth and Kalmanson. An Introduction to Discrete Mathematics and its Applications,
1986.
3. Kenneth H. Rosen, Discrete Mathematics and its Applications, 7th Edition. Mc Grow
Hill, New York, 2012.

Evaluation
First Exam Approx. End of week 5 30%
Second Exam Approx. End of week 10 30%
Final Exam To be announced by university 40%
Outcomes of instruction: By the end of the course, studentsshould be able to
1- Deal with sets and set operations
2- Understand relations and functions
3- Apply relations and functions in computer science and real life problems
4- Understand matrices and the operations on them.
5- Have a good knowledge of Boolean matrices and relate them to relations and digraphs
6- Have a good knowledge of groups, semigroups, homomorphism and isomorphism. 
Relations, partitions, equivalence relations, trees, directed and undirected graphs

Topics to be Covered
Week Chapter Topics
1 1.1 Sets and Subsets
Chapter 1
1.2 Operations on sets.
2+3 1.3 Sequences .
Chapter 1
1.4 Properties of Integers
3+4 1.5 Matrices
2.1 Propositional and Logical Operations
5 Chapter 2 2.2 Conditional Statements
6 2.4 Mathematical Induction
4.1 Product sets and Partitions
7 4.2 Relations and Diagraphs
Chapter 4
4.3 Paths in Relations and Digraphs
8 4.4 Properties of Relations
Chapter 4
4.5 Equivalence Relations
9 4.6 Computer Representation of Relations and Digraphs
Chapter 4
4.7 Operations and Relations
10+11 Chapter 5 5.1 Functions
5.2 Functions for Computer Science
5.3 Growth of Functions
12 Chapter 5 5.4 Permutation Functions
13 7.1Trees
Chapter 7
7.2Labeled Trees
14 7.3Tree Searching
Chapter 7
7.4 Undirected Trees
15 Chapter 7 7.5 Minimal Spanning Trees

16 Final exams starts


Relationship of the Course to theMathematics Program Outcomes:
Program outcomes Level
√
a–k (L, M, H)

(a) an ability to apply knowledge of mathematics, science, and applied sciences Y H

(b) an ability to design and conduct experiments, as well as to analyze and interpret
data
(c) an ability to formulate or design a system, process, or program to meet desired Y M
needs
(d) an ability to function on multidisciplinary teams

(e) an ability to identify and solve applied science problems

(f) an understanding of professional and ethical responsibility

(g) an ability to communicate effectively Y M

(h) the broad education necessary to understand the impact of solutions in a global
and societal context
(i) a recognition of the need for and an ability to engage in life-long learning

(j) a knowledge of contemporary issues

(k) an ability to use the techniques, skills, and modern scientific and technical tools Y M
necessary for professional practice.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy