Anda di halaman 1dari 4

Sultan Qaboos University-College of Science

Department of Mathematics and Statistics


MATH3330 - Discrete Mathematics for ECE
Format: 2-2-3
Semester: SPRING 2016

Coordinator: Dr. Sanjiv Gupta

Short Course Description


This course on Discrete Mathematics has applications in Electrical and Computer Engineering and is tailormade for the relevant students. The course coverage includes: numbers, cryptography, counting, recursion,
basics of logic, Boolean functions and applications, circuits, graphs and trees.
Objectives
This course provides foundations and basic concepts of many mathematics fields. It exposes students to
foundations in Logic, Boolean Algebra, Set Theory, Graph Theory, Number Theory and Counting.
Textbook
Title:
Authors:
Publisher:

Discrete Mathematics and its Applicaitons, 6th Edition, (2007)


K. H. Rosen
McGraw-Hill Company

Learning Outcomes
On successful completion of the module, the student will be able to:
Define propositions and operations on propositions and identify equivalent propositions. Also, student
will be able to define Boolean functions and represent them using logic gates and circuits.
Define sets, relate them to other sets and elements and operate on them. Also define functions as
relations on sets and identify one to one and onto functions.
Recall basic concepts in number theory related to integers, divisibility, modular arithmetic, prime
numbers, greatest common divisor and least common multiple. Students shall be able to express
integers using different basis.
Use mathematical induction to prove mathematical results on natural numbers. Students shall be
able to define some functions recursively.
Solve some counting problems using basics principles of counting.
Identify different types of graphs and represent them in different ways. Students shall be able to
identify graphs with Euler or Hamiltonian paths. They shall be able to compute shortest path between
vertices of a weighted graph. They shall be able to define trees and find spanning trees in graphs.

Contents
1.1
1.2
1.3
2.1
2.2
2.3
3.4
3.5
3.6
3.7
4.1
4.2
4.3
5.1
5.2
5.3
9.1
9.2
9.3
9.4
9.5
9.6
9.7
10.1
10.2
10.4
11.1
11.2
11.3
11.4
12.2

Propositional Logic; omitting Translating English Sentences, Boolean Searches,


Logic Puzzles
Propositional Equivalences
Predicates and Quantifiers; omitting Translating from English into logical
Expressions till end of the section
Sets
Set Operations
Functions
The Integers and Division
Primes and Greatest Common Divisors*; omitting The Distribution of Primes
Integers and Algorithms; omitting Algorithms for Integer Operations
Applications of Number Theory*; omitting Public Key Cryptography till end of the section
Mathematical Induction; omitting Proving results about algorithms,
creative use of Mathematical Induction
Strong Induction and Well- Ordering; omitting Using Strong Induction
in Computational Geometry till end of the section
Recursive Definitions and Structural Induction; omitting Example 6
till end of the section.
The Basis of Counting; omitting Tree Diagrams
The Pigeonhole principle; omitting Some Elegant Applications of the
Pigeonhole principle
Permutations and Combinations.
Graphs and Graph Models
Graph Terminology and Special Types of Graphs
Representing Graphs and Graph Isomorphism; Here define Matrices, Transpose,
Symmetric Matrices, Zero-one matrices. This material is found in (3.8).
Connectivity
Euler and Hamiltonian Paths
Shortest- Path Problems; omit Theorem 2 till end of section
Planer Graphs
Introduction to Trees
Applications of Trees;
Omit The complexity of sorting algorithm and Theorem 1 till end of the section.
Spanning Trees omit Depth-First Search in Directed Graphs.
Boolean Functions
omit The Abstract Definition of Boolean Algebra.
Representing Boolean Functions.
Logic Gates; omit Adders
Minimization of Circuits
Finite- State Machine with Output up to Example 4, omit the rest.

Assessment
Final Exam
40 %

2 In-semester Tests
20% + 20%

Quizzes
15%

Homework / Homework Quiz


5%

Attendance
COME to CLASS. Attendance is compulsory. If you miss more than 10% of the total number of hours
(this is 6 hours), you get a warning notice. If you miss more than 20% of the total number of hours (this is
12 hours), you will be barred from the course.
Homework Assignments/Quizzes/Exams
On the third page you will find the suggested tutorial and practice problems, which are an integral
part of this course. The best way to prepare for quizzes and exams is to carefully study the theory
and then do all these problems.
There will be 4 quizzes. Last quiz (Quiz 4) will assess the homework. Quizzes will be in tutorials
except Quiz 4. Quiz 4 will be conducted in lecture. All quizzes will be conducted at the beginning
of the lecture and no extra time will be given to those who come to lecture late. Homework will be
posted on Moodle in week 11 and will be assessed by Homework Quiz (Quiz 4) in week 14.
Homework
Quizzes

Week 11
Weeks 3, 5, 9 and 14

There will be two one-hour In-Semester Tests.


Examinations
Date
Test 1
10th March
2:15-3:15 PM (Week 6)
Test 2
21st April
2:15-3:15 PM (Week 12)
Final Examination
25th MAY 2016
11:30am-2:00pm
The final examination will cover all the course material, and will be two and a half hours duration.
For a student missing a quiz or an exam without a valid excuse, the mark assigned will be zero.
There will be no make-up quizzes or exams. Absentees with genuine reasons (supported by
proper documents submitted to the instructor within one week from return to the class), will be
treated separately.
Graded test papers will be returned to students during a class. Once students get their test papers,
check carefully that all solutions have been seen and graded. If students have any query on the grading,
they must return the test papers to their instructor before they leave the class room.
For information about the course (e.g. homework assignments, solutions, past exams, review sheets,
announcements, etc) make it a habit to regularly check MOODLE.
Phones are NOT allowed to use as a calculator.
Weekly Outline
Week
Sections
1 31 January - 04 February
1.1, 1.2
2 07 - 11 February
1.3, 2.1
3 14 - 18 February (Quiz 1)
2.2, 2.3
4 21 - 25 February
3.4, 3.5
5 28 February - 3rd March (Quiz 2) 3.6, 3.7
6 6 - 10 March (Test 1)
4.1, 4.2
7 13 - 17 March
4.3, 5.1
8 20 - 24 March
5.2, 5.3
Note
This course schedule indicated above may change as

9
10
11
12
13
14
15

Week
27 March - 31 March (Quiz 3)
03 April - 07 April
10 April - 14 April
17 April - 21 April (Test 2)
24 April - 28 April
01 May - 05 May (Quiz 4)
08 May - 12 May

the semester progresses.

Sections
9.1, 9.2, 9.3
9.4, 9.5
9.6, 9.7, 10.1
10.2, 10.4
11.1, 11.2, 11.3
11.4, 12.2
Review

Getting HELP
Office Hours: We encourage our students to regularly use the office hours of the course team in order to
perform well in the course. If students have a question (or just would like to talk about the course), they
are encouraged to consult their instructor during his/her office hours or by appointment. Office numbers of
course instructors, in the Department of Mathematics & Statistics, are given below:
Section Instructor
Office
Section Instructor
Office
10
Dr. Sanjiv Gupta 0223
20
Dr. Nadia Al-Dhamri 0213
Suggested Textbook Examples and Exercises
The following table lists the solved textbook examples and the suggested tutorial/practice exercises for each
section. Because of time constraint, all suggested examples or exercises cannot be covered by the instructors.
Students will therefore be required to read the examples and do the tutorial exercises, not covered in the
lecture/tutorial, on their own.
Sec.
1.1
1.2
1.3
2.1
2.2
2.3
3.4
3.5
3.6
3.7
4.1
4.2
4.3
5.1
5.2
5.3
9.1
9.2
9.3
9.4
9.5
9.6
9.7
10.1
10.2
10.4
11.1
11.2
11.3
11.4
12.2

Lecture/Examples
1-11, 15, 16, 20,21
1-8
1, 3, 5, 7, 9, 11, 13, 15, 17, 19-22
2, 4-6, 11-16, 19, 20
1, 3, 5, 7, 10, 11, 15, 17, 18
3, 4, 6-8, 10-12, 15-17, 19, 21, 23,27-29
1, 2, 3, 5, 6, 7, 10
2, 3, 10, 11, 15
1, 3, 4, 5, 6, 12
1-4, 6-10
1-4, 10, 14
2, 4
1-5
4-7, 10
1-8
1-3, 5, 7, 8-10, 11, 13, 15
2, 3
1, 3, 5 11, 17, 18
3, 5, 8-11
9, 12-14
Dodecahedron graph, 8
1, 2
3, 4, 5, 7, 9
8, 9 10
1-4
1, 3-5, 8
1-12
1-3
1-3
1-10
1-4

Tutorial/ Prctices
7, 9, 12, 18, 23, 25, 30,32, 33, 37, 38
5, 6, 8, 9, 11, 14, 18, 22, 31, 46, 49, 60
1 , 2, 5, 9, 11, 17, 20, 30, 35, 43, 45, 53
1, 5, 7, 10, 13, 14, 17, 21, 23, 29, 30, 35
4, 10, 12, 14, 16, 18, 25, 27, 29, 36, 37, 51, 54, 55
1, 2, 4, 6, 8, 10, 18, 20, 32, 33, 35, 39, 58, 60
1, 6, 10, 16, 18, 23, 24, 31, 32
1, 3, 10, 12, 20, 22, 24, 27
1, 3, 5, 7, 8, 10, 13, 19, 23, 28
1, 3, 5, 11, 18, 19, 25, 27, 32
3 5, 7, 9, 10, 15, 18 20, 22, 28, 31, 32, 38
3, 4, 12
1, 3, 5 9, 12
1 4, 7 13, 16, 18, 21, 27, 30, 32 35, 38, 40, 42, 47
1 3, 5, 8, 13, 15, 19, 31
1 6, 9, 11, 13, 14, 16, 18, 21, 23, 25, 27, 30, 33, 37
3 10, 13, 16, 19
1 6, 20 26, 29 31, 34, 36, 42, 45, 47 51
1, 2, 5, 6, 9, 10, 13 17, 22, 23, 25, 26, 30, 31, 35 37, 57
1, 3 6, 14, 17 18, 24, 29 32
1 5, 9, 10, 13 15, 26, 28, 30 35, 37 42, 47
2 7, 11, 27
3, 4, 5, 6, 7, 9, 11, 13, 20, 21, 23, 24, 27
1 3, 5, 7, 9, 16 20, 22, 27 29, 31
1, 3, 7
1 4, 8 10, 13 16, 24, 30
1 3, 6, 8 11, 15, 17, 21, 24, 25, 28
1, 2, 4, 5, 7, 12, 14, 16
1 6, 8
2, 4, 6 8, 12, 14, 16, 23, 24, 30
1 5, 7, 8

E-learning
The university provides an E-learning system called Moodle. Moodle page for this course is provided for
assisting students study.
Key
Title
Contents

m3330
College of Science
Math3330 Discrete Mathematics for ECE
Past final exams, tests, handouts

On this website, students can access various items such as past exams, quizzes and handouts. Students are
encouraged to use this facility to improve their mathematical skills.