School of Science and Engineering (SSE)

Syllabus: MTH 1304 S1, Fall 2018: Discrete Mathematics for Engineers.

Instructor: Dr. A. El Boukili

Associate Professor of Applied Mathematics
School of Science and Engineering

Office: Building 5, Room 101

Phone: 2127
Website: http://www.aui.ma/personal/~A.Elboukili

Office Hours by Appointment:

Monday 9-10 16-16:40 18-19:30
Wednesday 9-10 18-19:30
Friday 12-13

Appointment: Email: [email protected].

Teaching Schedule:
MTH 1304 sections 1 and 2
Section 1: MW 4:40-6pm Room 3, B6
Section 2: MWF 11-11:50 Room 3, B6

MTH 1312 section 2

MWF 10-10:50 Room 3, B6

URP 3377 section 1

R 6:30-9:30pm Room 103, 08B

General information

Pre-requisite None
Co-requisite CSC2302 (for CSC and GE majors)
Pre-requisite for None
Offered in 1&2
Semester
Credit Hours 3
Contact Hours 3 hours per week

COURSE OBJECTIVES:

MTH 1304 is an introduction to the fundamental ideas of discrete

mathematics. In this course, students will learn about the following
topics:

1. PERT algorithm and its applications to project management

2. Discrete sets and their applications to engineering and business

3. Relations and their applications to encryption and decryption of data

4. Functions and their applications to coding theory,

5. Mathematical induction and logic

6. Graphs and their application to engineering and business

7. Trees and their application to engineering and business

8. Counting techniques and their applications to engineering and

business

9. Recurrence relations and their applications to engineering and

business
10. Combinatorial circuits and their applications to machines

TEXTBOOK: Discrete Mathematics, J. Dossey, A. Otto, L. Spence, C.

Vanden Eynden, 5th edition.

MAIN COURSE OUTCOMES:

Upon successful completion of this course, students are expected to:

1) Apply fundamental notions of discrete mathematics: sets, relations,
functions, congruence, encryption, decryption, coding theory, and
recurrence relations to real word problems
2) Have basic logical reasoning and construct and analyze basic proofs
(including proofs by mathematical induction).
3) Understand the applications of graphs and trees to engineering and
business.
4) Apply and distinguish between different counting techniques.

TIME REQUIREMENT: According to the catalog, it is expected that for

every hour of in-class contact, a student spends an absolute minimum of
two hours outside of class on solving homework problems, reading the
textbook and reviewing class notes. This means that you should be
prepared to spend at least 9 hours a week on this course.

Academic Integrity:
Students are reminded about AUI regulations on cheating and plagiarism as
outlined on page 70 of the catalogue. In particular "complete honesty is
required of students in the presentation of any and all phases of course work
as their own. This applies to quizzes of any length, as well as to all
examinations, daily reports, lab work and term papers”

Course Policies and Mobile Phones:

No make-ups for exams will be arranged except for extenuating
circumstances. A written explanation, including supporting documents from
AUI administration, must be communicated to the instructor before the
exam. If the explanation is acceptable, an alternative for the exam will be
arranged.
Mobile phones must be turned off in class. And, they are not allowed
during exams.

Civility in the Classroom:

In this course, you are expected to act in a manner consistent with the
behavior expected in the professional workplace. Respect each other,
come to class prepared, be supportive of others, be attentive, contribute
when appropriate, and have fun. Civility is expected and assumed.

In order for everyone to have the opportunity to maximize learning,

inappropriate or disruptive behavior is prohibited and may result in a
request to leave the classroom at a minimum. Examples include, but are
not limited to, using cell phones in class, texting in class, excessive tardiness
or late arrivals, demanding special treatment, challenges to the instructor’s
authority, leaving class early, shuffling backpacks and book bags, using
offensive language or remarks, reading newspapers in class, chewing gum,
wearing caps, prolonged side discussions, playing games in class, sleeping,
overt inattentiveness, and using a laptop, iPad, smart phone during class
unless instructed to do so.

Note:
-If you use bad words in class about your class mates or professor, you will
be asked to leave the class and you will get disciplinary sanctions by the
disciplinary committee

-If you use an offensive language in class, you will get disciplinary sanctions
by the disciplinary committee

-If you laugh at your professor or classmates, you will get disciplinary
sanctions by the disciplinary committee

DERIVATIVE WORKS: Per AUI policy, the university does not assume
any liability for derivative works from papers or assignments in this class.

GRADING:
Discipline in the class: 5%
Attendance: 5%
Team Based Research Projects: 3%

Quizzes: 17%
Midterm: 40%
Final Exam: 30%

Assignments (4 non graded and individual assignments): The grade of

each exam will depend strongly on the assignments (about 60%) and on the
examples of the textbook and lectures (about 40%). You must do all the
exercises of the assignments and all the examples of the covered sections. If
you do not do the assignments you may get 0.

Note: Grades must be earned by students. Grades are not just given for
free to students.

Discipline Grade: Discipline means:

1) No talking or chatting in the class or during exams.
2) No use of telephone in the class.
3) Hand in all the homework assignments on time. If not all of your
assignments have been handed in on time, then, you will get 0 in this
grade.
4) Read your textbook,
5) Attend on regular basis,
6) Respect the authority of your professor,
7) Be quite in the class.
8) Be on time,
9) Be serious in the class,
10) Be polite, and motivated to learn,
11) Respect others.
12) Participate in the class

If one of these meanings is not respected, you will get 0 in the discipline
grade.

How to calculate your final and total grade:

Total final grade = average quizzes*17% + (midterm)*40% +
attendance*5%+ discipline*5% + projects*3% + final exam*30%.

average quizzes = (quiz1 + qui2 + quiz3)/3.

How to calculate the attendance grade:

Find how many absences you have from Jenzabar. No absence will worth
100/100. Each absence cost 100/5=20 points. If you have 1 absence, this
grade will be 80 points and so on.

Tests: Final Exam Date: To be announced by the AUI administration and

not me.
Final Exams Week: December 5-12.
Midterm: Monday 17th October

Homework assignments: will be assigned every week.

Detailed Course Outcomes = Intended Learning Outcomes (ILOs):

Upon completion of this course, students should know and be able to do

the following:

Chapter 1: Introduction to combinatorial problems & techniques

• ILO1: Time to complete a project: PERT Algorithm

Chapter2: Sets, relations, and functions

• ILO2: Sets operations
• ILO3: Equivalence relations
• ILO4: Functions
• ILO5: Induction
• ILO6: Applications

Chapter3: Coding theory

• ILO7: Congruence
 • ILO8: Euclidean algorithms

Chapter4: Graphs
• ILO9: Graphs and representations
• ILO10: Paths and circuits
• ILO11: Shortest paths and distances

Chapter5: Trees
• ILO12: Properties of trees
• ILO13: Spanning trees
• ILO14: Depth-First search algorithm
• ILO15: Rooted trees
• ILO16: Binary trees and traversal

Chapter8: Counting techniques

• ILO17: Pascal’s triangle and Binomial theorem
• ILO18: Three fundamental principals
• ILO19: Permutations and combinations
• ILO20: Arrangements and selections with repetitions

Chapter10: Combinatorial circuits and finite state machines

• ILO21: Logical gates
• ILO22: Logical equivalence

OFFICE HOURS:
Rule1: You are required to send me an email to set up an appointment
first.
Rule2: You should come to learn more about what you did not
understand in the class or ask about the solution to some exercises.
Rule3: Discussions about personal issues are not accepted.
Rule4: Arguing, discussing, or negotiating grades is not accepted.
Grades must be earned by you and not just given to you.

It is the student’s responsibility to keep up with the course pace and to seek
help if needed. Students are strongly encouraged to use the office hours.
During office hours, you can come to talk to me, to ask questions about the
material or about exercises, to review graded work or to get suggestions for
further reading. Students are advised to do the following: come to the office
with specific questions, written down on a sheet of paper or in your book.
Bring your textbook and your notebook to show the problems you have
tried. You will learn more if we discuss or correct your solution together,
than if I just give you the right answer. When discussing exams, be prepared
to argue answers, not grades. Students who miss a class are responsible for
the material covered during that class.

The expected students outcomes (=program outcomes) of our bachelor

programs: CS, GE, EMS

Definition of students outcomes: The students outcomes are all the

outcomes from the whole program that should prepare graduate students to
achieve and attain the program educational objectives (PEOs). The PEOs
are specific to each program.

The PEOs of CS program are:

PEO1: Prepare graduates for career in different IT related fields according
to current market needs (Job)
PEO2: Produce graduates with good communication skills enabling them to
communicate effectively with people from many disciplines (wise
communication)
PEO3: Produce BS graduates who have a good exposure to basic science,
engineering and mathematics with ability to continue to learn how to apply
this expertise to a range of engineering problems (strong knowledge +
lifelong learning ability+ application ability)
PEO4: Produce BS graduates with a strong foundation of computer science
theory and practice, and the ability to continue learn and apply new
information technologies (strong background in theory, practice, and
innovation)

Our expected students outcomes from CS program are:

CS1: An ability to apply knowledge of computing and mathematics
appropriate to the discipline (ABET CS: a) ;
CS2: An ability to analyze a problem, and identify and define the
computing requirements appropriate to its solution (ABET CS: b) ;
 CS3: An ability to design, implement and evaluate a computer-based
system, process, component, or program to meet desired needs (ABET
CS: c);
CS4: An ability to function effectively on teams to accomplish a
common goal (ABET CS: d);
CS5:An understanding of professional, ethical, legal, security, and social
issues and responsibilities (ABET CS: e);
CS6: An ability to communicate effectively with a range of audiences
(ABET CS:f);
CS7: An ability to analyze the local and global impact of computing on
individuals, organizations and society (ABET CS:g);
CS8: Recognition of the need for and an ability to engage in, continuing
professional development (ABET CS:h);
CS9: An ability to use current techniques, skills, and tools necessary for
computing practices (ABET CS:i).
CS10: An ability to apply mathematical foundations, algorithmic
principles, and computer science theory in the modeling and design of
computer-based systems in a way that demonstrates comprehension of
the tradeoffs involved in design choices (ABET CS:i);
CS11: An ability to apply design and development principles in the
construction of software systems of varying complexity (ABET CS:i).

Our students outcomes for CS are more than ABET once for CS.

Our expected student’s outcomes from GE and EMS programs are:

ENG1: An ability to apply knowledge of mathematics, science, and
engineering (ABET GE/EMS a) ;
ENG2: an ability to design and conduct experiments, as well as to
analyze and interpret data (ABET GE/EMS b) ;
ENG3: An ability to design a system, component, or process to meet
desired needs within realistic constraints such as economic,
environmental, social, political, ethical, health and safety,
manufacturability, and (ABET GE/EMS c );
ENG4: An ability to function on multidisciplinary teams (ABET
GE/EMS d));
ENG5: An ability to identify, formulate, and solve engineering problems
(ABET GE/EMS e); not in CS.
ENG6: an understanding of professional and ethical responsibility
(ABET GE/EMS f);
ENG7: An ability to communicate effectively (ABET GE/EMS g);
 ENG8: The broad education necessary to understand the impact of
engineering solutions in a global, economic, environmental, and societal
context (ABET GE/EMS h);
ENG9: A recognition of the need for, and an ability to engage in life-
long learning (ABET GE/EMS i);
ENG10: A knowledge of contemporary issues (ABET GE/EMS j).
ENG11: An ability to use the techniques, skills, and modern engineering
tools necessary for engineering practice. (ABET GE/EMS k);

ABET: is an American agency that is entitled to give accreditation to

some programs worldwide.

Student outcomes (=program outcomes) enabled by MTH1304 are:

I=Introduce, E=Emphasize , R=Reinforce.

CS1, CS2, CS3, CS4, ENG5 CS6, CS7, CS8, CS9, CS10, CS11,
ENG1 ENG2 ENG3 ENG4 ENG6 ENG7 ENG8 EMS9 ENG10 ENG11
ILO1 I I I I I I E E I
ILO2 I I I I I I E E I
ILO3 I I I I I I E E I
ILO4 E E I E I I E E I
ILO5 E E I E I I E E I
ILO6 E E I E I I E E I
ILO7 E E I E I I E E I
ILO8 E E I E I I E E I
ILO9 E E I E I I E E I
ILO10 E E I E I I E E I
ILO11 E E I E I I E E I

Note: The instructor will use Jenzabar for announcements, and for
posting lecture notes, homework problems and handouts. Students are
expected to check these daily.

Tentative schedule

Lecture Date Sections Topic

1 January 1.1 Introduction, critical path analysis
16th
2 1.2 Matching problem
3 Knapsack problem
4 1.3 Knapsack problem
5 1.4 Efficiency of algorithms
6 A1 Logic
7 A2, A3 Logic, methods of proof
8 A3, 2.1 Methods of proof, sets
9 2.2 Equivalence relations
10 2.2 Equivalence relations
11 2.3 Partial ordering relations
12 2.4, 2.5 Functions, mathematical induction
13 2.6 Applications of mathematical induction
14 3.1 Congruences
15 3.2 Euclidean algorithm
16 Review
17 B1 Matrices
18 4.1 Graphs
19 4.2 Paths and circuits
20 4.2, 4.3 Paths and circuits, shortest paths and distance
21 4.3 Shortest paths and distance
Spring break
Spring break
Spring break
22 4.4 Coloring a graph
23 4.5 Directed graphs and multigraphs
24 5.1 Trees
25 5.2 Spanning trees
26 5.3 Depth-first search
27 5.4 Rooted trees
28 5.5 Binary trees and traversals
29 5.6 Optimal binary trees
30 5.6 Binary search trees
31 Review
32 8.1 Binomial theorem
33 8.2 Fundamental counting principles
34 8.3 Combinations and permutations
35 8.4 Arrangements and selections with repetitions
36 8.6 Principle of Inclusion-Exclusion
37 9.1 Recurrence relations
38 9.2 Iteration
39 9.3 Linear difference equations with constant
coefficients
40 9.4 Application of recurrence relations: analyzing
algorithms
41 Off
42 10.1 Logical gates
43 10.2 Creating combinatorial circuits
44 Review
45 Review
TBA Final Exam
Note: This schedule is subject to changes by the instructor: we aim to follow
it but your instructor may make modifications to the schedule if he feels it
will help your learning.

“A good stock of examples, as large as possible, is indispensable for

thorough understanding of any concept, and when I want to learn something
new, I make it my first job to build one.”
Paul R. Halmos