Math 3614: Discrete Math II, Fall 1996, Syllabus

Instructor: Dr. Stephen C. Billups, CU-Denver Bldg., Rm 530F, 556-4814
email: sbillups@carbon.cudenver.edu
URL: http://www-math.cudenver.edu/~billups/
Office Hours: Mon, Wed 1-3, Thurs 2-4, or by appointment

Class hours: MW 5:30-6:45, Rm 327 Science Bldg.

Prerequisite: Discrete Math I (2614)
Required Text:
K. H. Rosen,Discrete Mathematics and Its Applications, McGraw-Hill, New york, NY, 1995 (3rd edition)

Overview

This is the second course of a sequence designed to provide discrete math concepts for computer science majors. Since this is a mathematics course, we will work toward developing skill at mathematical reasoning, including some theorem proving. You may be uncomfortable with this at first, but such skills are essential for computer scientists, especially if you are considering graduate school. At the same time, since this course is primarily for computer science majors, the main emphasis will be on the construction and coding of algorithms.

Course Objectives

Assignments

Expect to spend 4-8 hours per week outside of class. If you routinely spend more than this amount of time, please let me know!!
GROUP WORK: In order to maximize your learning experience, the class will be divided up into small learning groups. Each week, I will specify some learning objectives for the week. It will then be your responsibility to ensure that everyone in your group meets those objectives. Each class meeting, you will be given some time to meet with your group; however, you should also plan to meet outside of class.

Each week, I will give a short quiz or a group project to measure how well your group has achieved the learning objectives. Everyone in your group will receive the same score! The following are some examples for how you may be evaluated:

  1. Everyone will be given the same quiz, and the group score will be the average of the individual scores.
  2. Each member of the group will be given a different problem, and the group will receive the total score.
  3. A difficult problem will be assigned to your group, and you will all work together to solve the problem.
  4. A competition will be held between groups, with the winning team receiving an A, the second place team receiving an A-, etc.

What to do if your group is not successful: If you find that your group is not operating effectively (for example, because of personality conflicts, schedule conflicts, or just plain laziness of some of the group members), you should talk to me about it as soon as possible (that is before it hurts your grade). I will then help you resolve the problem. If you wait until after your group has received a bad grade, you will have to live with that grade!

HOMEWORK:There will be four in-depth homework assignments, involving both programming and written analysis. You should not expect to be able to do all of the homework assignments by yourself (unless you are truly gifted). Therefore, I strongly encourage you to discuss the homework with classmates; however, you should write up the results independently. Homeworks are due at the beginning of class.

Late homework will be assessed a 10% penalty if turned in by the beginning of the next scheduled class meeting, but will not be accepted after that time.

TESTS:There will be two tests and a final exam. All exams will be closed book.

Grading

Grades will be weighted as follows:
Group work 25%
Group work 25%
Homework 25%
Tests 30% (15% each)
Final Exam 20%

Grades will be awarded according to the following cutoffs: 93%=A, 90%=A-, 87%=B+, 83%=B, 80%=B-, 77%=C+, 73%=C, 70%=C-, 67%=D+, 63%=D, 60%=D-, <60%=F.

Important Dates

Sept 2 Labor Day, no class
Oct 14 Exam 1
Nov 4,6 Guest Lectures
Nov 25 Exam 2
Dec 16 Final Exam

Last updated: August 23, 1996