Fall 01/02
CSC 415, Section 105
Foundations of Computer Science I

Time & Location: Wed 6:15 - 9:30 p.m., O'Hare, Room: TBA
Instructor: Omar Hamadache
Office: SAC 553, LPC Campus
Phone: (773) 325 2171 (during office hours)
E-mail: ohamadac@cs.depaul.edu
Office Hours: 9:00 - 10:30 am
Course Home Page: http://www.depaul.edu/~ohamadac/415_class

1. Course Description

This course covers some fundamental notions in the mathematics (in particular, Discrete Mathematics) that are necessary for the graduate study of Computer Science.  Topics include iteration, induction, and recursion; asymptotic analysis; proofs of correctness; elementary combinatorics; propositional and predicate logic.  There is NO programming in the course.

2. Pre-requisites

There is no pre-requisite for this course.  However, students are expected to have a good command of algebra (high school to undergraduate level).  

3. Course Materials

• Text: Discrete Mathematics, 5th edition, Richard Johnsonbaugh, Prentice Hall, 2001.
• References:
  • Discrete Mathematics with Applications, 2nd edition, Epp, Brooks/Cole Publishing Company, 1995.
  • Understanding Intermediate Algebra: 4^th edition, Hirsch and Goodman, Brooks/Cole Publishing Company, 1998.

4. Coursework

1. Readings. Readings will be assigned from the texts. See the class schedule for specified chapters/sections.
2. Assignments. Assignments will be given almost every week.  Most questions are taken from exercise problems in the textbook. 
3. Midterm and Final Exams.

5. Grading

The grade breakdown will be as follows:

    Assignments    40%
    Midterm        30%
    Final Exam     30% 

The grading scale is as follows: 

    90-100       A
    80-89.99     B
    70-79.99     C
    60-69.99     D
     0-59.99     F

Plusses and minuses will be given at the high/low ends of each grade range (note: no A+'s).

• Grading Policy

• Your answers will NOT be judged only by the final results/conclusions. Scores you receive will be based on the correctness of ALL parts of the answers.  So, points will be taken off if an answer contains incorrect statements, even though its final conclusion is correct.
• Assignments with NO NAME may be penalized by some points.

• Late Policy

  Assignments are due at start of class of the due dates.  Late assignments will NOT be accepted.

• Plagiarism/Cheating and Incompletes

See the University and School policies on plagiarism and incompletes.

6. Tentative Schedule

The schedule will be updated throughout the quarter. Check the listing for readings and the dates of exams.

• Schedule