810:080, Sections 1 and 2, Spring 2003
Time and Place: MWF 9:00 a.m (section 1) and 10:00 a.m. (section 2), WRT 5
Required Text: Mathematical Structures for Computer Science, Judith Gersting (ISBN 0-7167-4358-2)
Prerequisite or Corequisite Computer Science I (810:059 or 810:061) and a mathematical background sufficient to take college calculus. Talk to me individually if you are concerned about these requirements.
Class Website: http://www.cs.uni.edu/~schafer/courses/S2003/disc/ You are responsible to check here frequently for lecture notes, announcements and supplemental class materials.
Class Mailing List: 810-080-01@uni.edu or 810-080-02@uni.edu. By default, this will send to your uni.edu account. See the class website for information on how to add a second account this.
Dr. Ben Schafer
Email: schafer@cs.uni.edu
Office and Office Hours: Wright Hall 325, phone 273-2187, MWF 11:00-12:00, TTh 10:00-11:45, anytime my door is open, and by appointment.
Discrete Structures is one of the first courses in the computer science department’s introductory sequence for majors. This course aims to provide an introduction to discrete mathematics as it is used in computer science. Topics include number representation, propositional and predicate logic, sets, proof techniques, elementary combinatorics, discrete probability, relations, functions, graphs, and trees.
Few computer scientists will be working primarily on discrete structures. However, many of the areas of computer science require the ability to work with concepts from discrete structures. For example, your ability to write efficient programs can be highly enhanced through the study of data structures and algorithms that is addressed in a discrete structures course. The ability to create and understand a formal proof is essential in software engineering, software verification, and cryptography. Graph theory concepts are used in networks, operating systems, and compilers. Finally, as the field of computer science matures, a strong background in discrete structures will help you to understand the computational techniques of the future.
By the end of the semester you should be able to:
1) Manipulate formal methods of symbolic propositional and predicate logic and demonstrate knowledge of formal logic proofs.
2) Outline basic proofs for theorems using the techniques of proof by contradiction and mathematical induction and apply these techniques.
3) Compute permutations and combinations of a set.
4) Illustrate by examples the basic terminology and operations associated with sets, functions, and relations as well as relate practical examples to the appropriate representation.
5) Calculate probabilities of events and expectations of random variables for problems arising from games of chance.
6) Illustrate by example the basic terminology of graph theory and model problems in computer science using graphs and tress.
Class meetings will consist of a mixture of short lecture, discussion, and in class activities. I expect you to read assigned topics prior to the class session and to participate in class activities. Since we will frequently discuss material that is beyond what you read in your textbook, attendance is essential.
In-class work (10%) – In class, I'll tend to break up the lecture with active and group learning exercises to aid learning. Part of your grade will be based on your participation of these in-class activities. Students benefit by (1) increased depth of understanding, (2) increased comfort and confidence, (3) increased motivation, and (4) being better prepared to work in groups on the job. This might sound great, but it will require you (and me) to work differently to prepare for class. Before the class, you must read the assigned reading, thought about what I've asked you to think about, etc.; otherwise you won't be able to effectively participate in your group during class.
Assignments (30%) – Assignments will be devoted to the exploration of the techniques and topics learned in class. Assignments will be mostly "pencil-and-paper" exercises, however we might have some computer-based exercises. It is expected that you will complete the assignments individually unless instructed otherwise. If you have questions concerning an assignment, feel free to consult your instructor.
In Class Exams (40%) – There will be four in-class exams this semester. These are tentatively scheduled to occur on January 29th, February 21st, March 14th, and April 11th. The exact date of each exam will be announced approximately one week prior to the exam. There are no scheduled make-up exam dates. If you are aware of conflicts prior to the exam, please make me aware of these as early as possible. In-class exams will always be closed book, closed notes. However, on certain exams you will be allowed to use specific study aids. When allowed, these will be clearly announced prior to each exam.
Final Exam (20%) – The final exams for this course will be administered according to university’s official exam schedule. The final exam will be part final unit exam and part comprehensive exam.
Grading for this course is on an absolute scale. Thus, the performance of others in the class will not negatively affect your grade. Final grades will be assigned based on cut off points no “higher” than:
93.0% < x <= 100.0% A
90.0% < x <= 93.0% A-
87.0% < x <= 90.0% B+
83.0% < x <= 87.0% B
80.0% < x <= 83.0% B-
77.0% < x <= 80.0% C+
73.0% < x <= 77.0% C
70.0% < x <= 73.0% C-
65.0% < x <= 70.0% D+
60.0% < x <= 65.0% D
0.0% < x <= 60.0% F
It is worth pointing out that departmental policy requires that you receive a grade of C or better in this course prior to enrolling in CS III.
Incompletes
Incompletes are awarded only in very rare instances when an unforeseeable event causes a student who has completed all the coursework to date to be unable to complete a small portion of the work (typically the final exam). Incompletes will not be awarded for foreseeable events including a heavy course load or a poorer-than-expected performance. Verifiable documentation must be provided for the incomplete to be granted, and arrangements for the incomplete should be made as soon as such an unforeseeable event is apparent.
You are responsible for being familiar with the University’s Academic Ethics Policies (http://www.uni.edu/pres/policies/301.html).
You should never ask to see another student’s solutions. Copying from other students is expressly forbidden. Doing so on assignments or exams will be penalized every time it is discovered. The penalty can vary from zero for the copied items (first offense) up to a failing grade for the course. In most cases I will also notify the university (the assistant Provost’s office) so the incident may be recorded in your academic file (as the old saying goes, “This will go down on your permanent record”).
If an assignment makes you realize you don't understand the material, ask a fellow student a question designed to improve your understanding, not one designed to get the assignment done. The solutions to assignments should be individual, original work unless otherwise specified.
Remember: Discussing assignments is good. Copying answers is not.
The Americans with Disabilities Act of 1990 (ADA) provides protection from discrimination for qualified individuals with disabilities. Students with a disability, who require assistance, will need to contact the Office of Disability Services (ODS) for coordination of academic accommodations. The ODS is located at 213 Student Services Center. Their phone number is 319/273-2676. Additionally, please contact me immediately if you have a learning or physical disability requiring accommodation