title: Discrete Mathematics for Computer Science (with Student Solutions Manual CD-ROM)
author:  Gary Haggard 
description: Gary Haggard is Professor of Computer Science at Bucknell University. His research in data structures focuses on the implementation of effective algorithms for computing invariants for large combinatorial structures such as graphs. Dr. Haggards current work is directed towards finding chromatic polynomials of large graphs.
zlib_text: Discrete Math in Computer Science
  
  Ken Bogart
  
  Cliff Stein
  
  Dept. of Mathematics
  
  Dept. of Computer Science
  
  Dartmouth College
  
  Dartmouth College
  
  June 23, 2002
  
  2
  
  This is a working draft of a textbook for a discrete mathematics course. This
  course is designed to be taken by computer science students. The prerequisites
  are first semester calculus (Math 3) and the introductory computer science
  course (CS 5). The class is meant to be taken concurrently with or after the
  second computer science course, Data Structures and Computer Programming (CS
  15). This class is a prerequite to Algorithms (CS 25) and it is recommended
  that it be taken before all CS courses other than 5 and 15.
  
  c
  
  Copyright Kenneth P. Bogart and Cliff Stein 2002
  
   **Chapter 1**
  
   **Counting**
  
   **1.1**
  
   **Basic Counting**
  
   **About the course**
  
  In these notes, student activities alternate with explanations and extensions
  of the point of the activities. The best way to use these notes is to try to
  master the student 