Instructor: Rashid Bin Muhammad
Course Description
This course covers introductory discrete mathematics for the prospective computer scientist and applied mathematician, who would like to learn how the ideas apply to computer science. The course emphasize on relation/function, induction/recursion, graphs/trees, discrete probability and Boolean algebra. The main goals are to develop the ability to read and/or do proofs; and to think algorithmically.
Text
The required textbook for this course: Kenneth A. Ross and Charles R. B. Wright, Discrete Mathematics (Fifth Edition), Pearson Education, Inc., NJ, 2003. ISBN 0-13-065247-4
I strongly suggest that students purchase a copy of this textbook, and keep up-to-date in reading the material assigned at each lecture. Saving on textbook and concentrating solely on the power points/lectures would not be a wise idea.
Prerequisites: CS 10051, MATH 12001 or MATH 11022 or appropriate placement test score into MATH 12002
Credits: 3
Homework (30%)
There will be approximately 6-7 homework assignments during the semester, and will involve solving problems. In general, you will have adequate time to complete each assignment. However, you should begin working on each assignment early so that you will have plenty of time to do properly. Waiting to start working until the night before the assignment is due is a bad idea. Late homework will be accepted with a penalty of 10% per calendar day. Note that after the class submission means “Late homework”.
Exams (60%)
Midterms and final exam will be given that examines the student’s knowledge of the course material. No study guide(s) will be given before exams.
Pop Quizzes (10%)
The date of the quiz will NOT be announced (there will be surprise quizzes.) A quiz is held during the first 10 minutes of the class. Late students will not be given extra time to complete the quiz. No late quizzes will be accepted; no make-up quizzes.
Make-up and Late Policy
There is no make-up date for missed homework, quizzes, or exams. Missed work will result in grade of 0 for the applicable homework, quiz, or exam. Exceptional circumstances should be discussed with me in advance. Make-ups of exams for this class will only be given in the case of documented and valid circumstances.
Attendance Policy/Class Participation
Students are expected to attend each and every lecture. Attendance and active participation during a lecture will help you learn the material and succeed in class. Missed lecture/material will impact your understanding of material covered later in class. Any missed material due to absences is the responsibility of the student.
Grading
The final course grade will be determined by Computer Science standard percentage scale for CS 23022-Discrete Structures Course.
A 93% - 100% A- 90% - 92.99% B+ 87% - 89.99% B 83% - 86.99% B- 80% - 82.99% C+ 77% - 79.99% C 73% - 76.99% C- 70% - 72.99% D+ 67% - 69.99% D 60% - 66.99% F 0% - 58.99%
There will be no curve at the end of the course. Although,
there will be a fair chance, by the means of extra-credit, that you can curve
your grades to a considerable measure.
Classroom Etiquette
Please remember that personal conversation during lecture time
is distracting to your fellow students. Leave the class if your wish to converse
(on the phone). Collaboration/discussion on a homework problem(s) is an
exception of the course! Discussions with me regarding individual matters may be
conducted after the class, but NOT before or DURING the class time please. Early
departure and late arrival- Please done discreetly. Please turn off all wireless
phones, beepers, pagers, radios, the sound on all laptops and PDAs, and any
other noise making devises. Laptops are acceptable for taking notes; however,
please sit at the last row so that your screen does not distract/block other
students.
Academic Integrity
Student-teacher relationships are built on trust. Students must trust that teachers have made appropriate decisions about the structure and content of the courses they teach, and teachers must trust that the assignments, which students turn in, are their own. Acts that violate this trust undermine the educational process. In this course, the penalty for any act of academic dishonesty is a final course grade at F.
You should read the Department’s policy on this issue: http://www.cs.kent.edu/programs/grad/studentinfo.html#dishonesty
Cooperation on Homework Assignments
I strongly believe that discussion with you classmates/peers is an excellent learning tool. Here, by "discussion" I mean a method of argumentation in a question and answer format - the Socratic dialogue. You will be surprised how fast your learning curve grows by discussion.
Having advocated discussion, I must be crystal clear about what is and what is not allowed.
Note that there is a fine line between discussion and cheating. If you are unsure what is allowed and what isn't, feel free to discuss the distinction with me, but if something feels uncomfortable, it is probably not allowed.
Students with Disabilities
University policy 3342-3-18 requires that students with
disabilities be provided reasonable accommodations to ensure their equal access
to course content. If you have a documented disability and require
accommodations, please contact the instructor at the beginning of the semester
to make arrangements for necessary classroom adjustments. Please note, you must
first verify your eligibility for these through Student Disability Services, SDS,
(contact 330-672-3391 or visit
http://www.registrars.kent.edu/disability/default.htm for more information
on registration procedures).
Good luck and welcome to my class!
