Skip to content

Discrete Mathematics for Computer Science

Spend $50 to get a free movie!

ISBN-10: 0534406718

ISBN-13: 9780534406714

Edition: 2006

Authors: Gary Haggard, John Schlipf, Sue H. Whitesides

List price: $53.95
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!

Description:

Packaged free with the text, this CD-ROM contains worked solutions to the odd-numbered exercises in the text.
Customers also bought

Book details

List price: $53.95
Copyright year: 2006
Publisher: Brooks/Cole
Publication date: 2/1/2005
Binding: Digital, Other 
Pages: 600
Size: 5.25" wide x 7.25" long x 0.10" tall
Weight: 4.994
Language: English

Sets
Basic Definitions
Exercises
Operations on Sets
Exercises
Mathematical Introduction
Exercises
Strong Form of Mathematical Introduction
Exercises
The Principle of Inclusion-Exclusion
Exercises
Russell's Paradox
Formal Logic
Introduction to Propositional Logic
Exercises
Truth and Logical Truth
Exercises
Normal Forms
Exercises
Formal Proofs in Propositional Logic
Exercises
First Order Logic
Exercises
Relations
Binary Relations
N-ary Relations
Operations on Binary Relations
Exercises
Special Types of Relations
Exercises
Equivalence Relations
Exercises
Ordering Relations
Exercises
Relational Databases-An Application
Exercises
Functions
Basic Definitions
Exercises
Operations on Functions
Sequences and Subsequences
Exercises
The Pigeon-Hole Principle
Applications
Exercises
Countable and Uncountable Sets
Exercises
Languages and Regular Sets
Exercises
Analysis of Algorithms
Comparing Growth Rates of Functions
Exercises
Complexity of Programs
Exercises
Uncomputability
Exercises
Graph Theory
Introduction to Graph Theory
The Handshaking Problem
Paths and Cycles
Graph Isomorphism
Representation of Graphs
Exercises
Connected Graphs
The Koingsberg Bridge Problem
Exercises
Trees
Spanning Trees
Rooted Trees
Exercises
Directed Graphs
Scheduling a Meeting Facility
Finding a Cycle in a Directed Graph
Priority in Scheduling
Connectivity in Directed Graphs
Exercises
Counting and Combinatorics
Traveling Salesperson Problem
Counting Principles
Set Decomposition Principles
Exercises
Permutations and Combinations
Constructing the k-th Permutation
Exercises
Repetitions and Identities
Combinatorial Identities
Pascal's Triangle
Multinomials
TSP Revisited
Exercises
Discrete Probability
Ideas of Chance in Computer Science
Exercises
Cross Product Sample Spaces
Exercises
Independent Events and Conditional Probability
Exercises
Discrete Random Variables
Exercises
Recurrence Relations
The Tower of Hanoi Problem
First Order Recurrence Relations
Exercises
Second Order Recurrence Relations
Exercises
Binary Search
Merge Sort
Multiplication of n-bit Numbers
Divide and Conquer Recurrences
Exercises
Geometric Series and Partial Fractions
Exercises