NJIT Academic Integrity CODE: All Students should be aware that the Department of Mathematical Sciences takes the University Code on Academic Integrity at NJIT very seriously and enforces it strictly. This means that there must not be any forms of plagiarism, i.e., copying of homework, class projects, or lab assignments, or any form of cheating in quizzes and exams. Under the University Code on Academic Integrity, students are obligated to report any such activities to the Instructor.
Math 326-001: Discrete Analysis for Computer Engineers
Number of Credits: 3
Prerequisites: Math 112 with a grade of C or better or Math 133 with a grade of C or better. Effective From: Fall 2012
Course Description: An introduction to mathematical logic, Boolean algebra, and Karnaugh maps. Other topics include functions, equivalence relations and partially ordered sets, counting, graph theory and finite state machines. The emphasis is on computation but proofs will be addressed. Students cannot receive credit for both Math 226 and Math 326.
Textbook: Discrete Mathematics with Graph Theory, 3rd. Edition. Author: Goodaire and Parmenter; ISBN: 0-13-167995-3.
Website: http://web.njit.edu/~plastock
Instructor: (for specific course-related information, follow the link below)
Math 326-001 |
Grading Policy: The final grade in this course will be determined as follows:
▪ Project: |
15% |
▪ Two Midterm Exams: |
25% each |
▪ Final Exam: |
35% |
Your final letter grade will be based on the
following tentative curve.
NOTE: This course needs to be passed with a grade of C or better in order
to proceed to
Math 426.
A |
89.1-100 |
C |
69.1-75 |
B+ |
85.1-89 |
D |
60-69 |
B |
79.1-85 |
F |
|
C+ |
75.1-79 |
|
|
Drop Date: Please note that the University Drop Date November 6, 2012 deadline will be strictly enforced.
Homework Policy: Homework problems will be assigned in class.
Attendance: Attendance at all classes will be recorded and is mandatory. Please make sure you read and fully understand the Department’s Attendance Policy. This policy will be strictly enforced. Absences from class will inhibit your ability to fully participate in class discussions and problem solving sessions and, therefore, affect your grade. Tardiness to class is very disruptive to the instructor and students and will not be tolerated. Each student should have contact information of several fellow students to get homework assignments and class notes when absent. You are responsible for everything that happens in class whether you are present or not.
Makeup Exam Policy: There will be No make-up EXAMS during the semester. In the event the Final Exam is not taken, under rare circumstances where the student has a legitimate reason for missing the final exam, a makeup exam will be administered by the math department. In any case the student must notify the Math Department Office and the Instructor that the exam will be missed and present written verifiable proof of the reason for missing the exam, e.g., a doctors note, police report, court notice, etc., clearly stating the date AND time of the mitigating problem.
Further Assistance: For further questions, students should contact their Instructor. All Instructors have regular office hours during the week. These office hours are listed at the link above by clicking on the Instructor’s name. Teaching Assistants are also available in the math learning center.
Cellular Phones: All cellular phones and beepers must be switched off during all class times.
MATH DEPARTMENT CLASS POLICIES LINK
All DMS students must familiarize themselves with and adhere to the Department of Mathematical Sciences Course Policies, in addition to official university-wide policies. DMS takes these policies very seriously and enforces them strictly. For DMS Course Policies, please click here.
M |
Labor Day ~ No classes |
|
T |
Last Day to Withdraw from this course |
|
T |
Classes follow a Thursday Schedule |
|
W |
Classes follow a Friday Schedule |
|
R-Su |
Thanksgiving Recess |
|
R |
Reading Day |
|
F- R |
Final Exams |
Course Outline:
Projects, Homework and Midterm Exam dates will be announced in class.
1 |
1.1, 1.2, 1.3 |
Mathematical
Logic |
2 |
2.1, 2.2, 2.3 |
Sets and Binary
Relations |
3 |
2.4, 2.5 |
“Equivalence and Partial Order
Relations |
4 |
3.1, 3.2, 3.3 |
Functions |
5 |
4.1, 4.2, 4.3 |
Integers |
6 |
4.4, 4.5 |
Congruence and
Applications |
7 |
9.1, 9.2, 9.3 |
Graphs |
8 |
10.1, 10.2 |
Paths and
Circuits |
9 |
10.3, 10.4 |
Paths and
Circuits |
10 |
11.1, 11.4,
11.5 |
Applications of
Paths and Circuits |
11 |
14.1, 14.2 |
The MaxFlow -
Min Cut Theorem |
12 |
14.3, 14.4 |
Applications of
The MaxFlow - Min Cut Theorem |
13 |
|
|
14-15 |
Review |
REVIEW FOR
FINAL EXAM |
Prepared By: Prof. Roy Plastock
Last revised: May 10, 2012