Scribd
Upload
164 views

Course Syllabus Discrete Math Spring 12 2

This document provides the course syllabus for a Discrete Mathematics course offered in the spring semester of 2012. The course will introduce topics in discrete mathematics including sets, logic, proof techniques, counting, combinatorics, graphs, trees, and Boolean algebra. Students will learn through lectures, problem solving, discussions, and math software demonstrations. Assessment will include three exams, quizzes, and homework assignments. The lectures will cover specific chapters in the required textbook over the course of the 16-week semester.

Uploaded by

Saeed Azar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
164 views

Course Syllabus Discrete Math Spring 12 2

This document provides the course syllabus for a Discrete Mathematics course offered in the spring semester of 2012. The course will introduce topics in discrete mathematics including sets, logic, proof techniques, counting, combinatorics, graphs, trees, and Boolean algebra. Students will learn through lectures, problem solving, discussions, and math software demonstrations. Assessment will include three exams, quizzes, and homework assignments. The lectures will cover specific chapters in the required textbook over the course of the 16-week semester.

Uploaded by

Saeed Azar
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Global Collages

Course Syllabus Discrete Mathematics Spring Semester 2012


Instructor: Dr. Said Moh'd Azar Email: [email protected] Course Information
Course Number: Course Title: Discrete Mathematics Section: A Credit Hours: 3 Contact hours: 3 Time: Sat. Teu. Location: Required Text: Discrete Mathematics with Applications, 3rd Edition, by

Susanna S. Epp,2004, Brooks/Cole Publishing Company Catalog Description This course is an elementary introduction to certain topics in Discrete Mathematics appropriate for work in computer science and in the further study of mathematics. Topics included are : sets, logic, proof and counting techniques, combinatorics, graphs, trees and Boolean Algebra.

Course Objectives The mean course aims are: 1. To study fundamentals mathematical concepts of logic, sets, and functions. 2. To refine mathematical reasoning skills through the study of mathematical logic and proof. 3. To develop problem solving skills for enumeration. 4. To investigate discrete structures, including sets, matrices, permutations, relations, graphs, trees, and finite-state machines. 5. To apply the above to applications with an emphasis on applications to computing.

Global Collages Delivery Methods


We will use different types of teaching methods including: Presentation explaining material. Problem solving. Discussion - actively involving students in learning by asking questions that provoke thinking and verbal response. Using Math packages explaining some material including Autograph. The lecture will be posted on the e-learning tool, so pay you attention to the class and try to understand everything.

Assessment Policy and Tools


Grades for the course will be assigned as follows:
Percent grade 95 -100 90-94 85 - 89 80 - 84 75 -79 70 - 74 65 - 69 60 - 64 below 60 Letter grade B+ B C+ C D+ D F A A+ Earned Points 5.0 4.0 3.5 3.0 2.5 2.0 1.5 1.0 4.5

Description of Exams:
1. Exams: There will be three major exams:
1. 2. 3. First Exam: 20%, Second Exam: 20%, Final Exam: 35%,

Each exam will consist of comprehensive questions, there will be partial credits, so students are required to show all their work to maximize their grades. 2. Quizzes (10%) There will be two quizzes 3. HomeWorks (15%)

Global Collages

Lectures schedule
This is a material that students should be familiar with. It will be reviewed as the course progresses whenever needed. Students are encouraged to review themselves.
Week 1 2 3 Date Chapter Chapter 1 Chapter 1 Topics overview Logical Form and Logical Equivalence. Conditional Statements. Valid and Invalid Arguments. Application: Digital Logic Circuits. Application: Number Systems and Circuits for Addition. Introduction to Predicates and Quantified Statements I. Direct Proof and Counterexample I Sequences. Mathematical Induction I. Mathematical Induction II. Basic Definitions of Set Theory. Properties of Sets. Disproofs, Algebraic Proofs,

Jan. 28 Feb. 1 Feb. 4 Feb. 8 Feb. 11 Feb. 15 Feb. 18 Feb. 22 Feb. 25 Feb. 29

Chapter 1

Chapter 2 Chapter 3 Chapter 4

Mar. 3 Mar. 7

Chapter 5

First Exam
7

Mar. 10 Mar. 14 Mar. 17 Mar. 21

Chapter 5

and Boolean Algebras. Russell's Paradox and the Halting Problem. Introduction. Possibility Trees and the Multiplication Rule. Counting Elements of Disjoint Sets: The Addition Rule. Counting Subsets of a Set: Combinations.

Chapter 6

Mar. 24 Mar. 28
9

Spring Break
Chapter 6 R-Combinations with Repetition Allowed. The Algebra of Combinations. The Binomial Theorem. Functions Defined on General Sets. One-to-One and Onto, Inverse Functions. Application: The Pigeonhole Principle. Composition of Functions.

Mar. 31 Apr. 4 Apr. 7 Apr. 11 Apr. 14 Apr. 18

10

Chapter 7

11

Chapter 7

Second Exam
12

Apr. 21 Apr. 25

Chapter 10

Relations on Sets. Reflexivity, Symmetry, and Transitivity. Equivalence Relations.

Global Collages
13

Apr. 28 May 2 May 5 May 9 May 12 May 16 May 19 May 23

Chapter 10

Modular Arithmetic with Applications to Cryptography. Partial Order Relations. Graphs: An Introduction. Paths and Circuits. Matrix Representations of Graphs. Isomorphisms of Graphs. Trees. Spanning Trees.

14

Chapter 11 Chapter 11 Chapter 11

15 16

Final Exam

You might also like