CSCI 271: Discrete Mathematics

Prof. David Wilczynski

General Information

Course Overview

Prerequisites. It is expected that you already know how to do "object-based" programming using C++ and Java.

Discrete Mathematics covers some formal topics that are essential to Computer Science. In particular the class will focus on:

Chapter 1:  Logic and Proofs,

Chapter 2:  Basic Structures: Sets, Functions, Sequences, and Sums
Chapter 4:  Induction and Recursion
Chapter 5:  Counting: Basics and Pigeonhole

Chapter 8:  Relations
Chapter 9:  Graphs
Chapter 10:  Trees
Chapter 12: Modeling Computation

Other topics may be covered.

Textbook

Discrete Mathematics and Its Applications, 6th Edition, by Kenneth Rosen
McGraw Hill,  ISBN-13  978-0-07-288008-3   ISBN-10  0-07-288008-2

 All reading assignments are given at Lectures. The date shown there is the date a reading should be done by. 

Assignments

Programming assignments are graded on thorough testing, documentation, and style, as well as correctness. All work to be submitted for the class is to be done individually unless an assignment specifies otherwise.

Grades

Assignments and Programming: 30%

2 midterms: 40% (20% each)

1 final: 30%

 

A = 92%      A- = 90%

B+ = 88%    B = 82%      B- = 80%

C+ = 78%   C = 72%      C- = 70%

Exams will be scaled to match these ranges.

Extra credit may be available on assignments for use in deciding borderline cases.

 

Last modified August 4, 2006 by David Wilczynski

The University of Southern California does not screen or control the content on this website and thus does not guarantee the accuracy, integrity, or quality of such content. All content on this website is provided by and is the sole responsibility of the person from which such content originated, and such content does not necessarily reflect the opinions of the University administration or the Board of Trustees