Skip to content

Discrete Mathematics for Computer Science

Spend $50 to get a free movie!

ISBN-10: 053449501X

ISBN-13: 9780534495015

Edition: 2006

Authors: John Schlipf, Sue Whitesides, Gary Haggard

List price: $333.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!

Master the fundamentals of discrete mathematics with DISCRETE MATHEMATICS FOR COMPUTER SCIENCE with Student Solutions Manual CD-ROM! An increasing number of computer scientists from diverse areas are using discrete mathematical structures to explain concepts and problems and this mathematics text shows you how to express precise ideas in clear mathematical language. Through a wealth of exercises and examples, you will learn how mastering discrete mathematics will help you develop important reasoning skills that will continue to be useful throughout your career.
Customers also bought

Book details

List price: $333.95
Copyright year: 2006
Publisher: Brooks/Cole
Publication date: 2/1/2005
Binding: Hardcover
Pages: 624
Size: 7.50" wide x 9.25" long x 1.00" tall
Weight: 2.750
Language: English

John Schlipf is a Professor of Computer Science in the Department of Electrical and Computer Engineering and Computer Science at the University of Cincinnati. His research interests include logic programming and deductive databases, algorithms for satisfiability, computability and complexity, formal verification, and model theory.

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. Haggard�s current work is directed towards finding chromatic polynomials of large graphs.

Sets, Proof Templates, and Induction
Basic Definitions
Exercises
Operations on Sets
Exercises
The Principle of Inclusion-Exclusion
Exercises
Mathematical Induction
Program Correctness
Exercises
Strong Form of Mathematical Induction
Exercises
Chapter Review
Formal Logic
Introduction to Propositional Logic
Exercises
Truth and Logical Truth
Exercises
Normal Forms
Exercises
Predicates and Quantification
Exercises
Chapter Review
Relations
Binary Relations
Operations on Binary Relations
Exercises
Special Types of Relations
Exercises
Equivalence Relations
Exercises
Ordering Relations
Exercises
Relational Databases: An Introduction
Exercises
Chapter Review
Functions
Basic Definitions
Exercises
Operations on Functions
Sequences and Subsequences
Exercises
The Pigeon-Hole Principle
Exercises
Countable and Uncountable Sets
Exercises
Chapter Review
Analysis of Algorithms
Comparing Growth Rates of Functions
Exercises
Complexity of Programs
Exercises
Uncomputability
Chapter Review
Graph Theory
Introduction to Graph Theory
The Handshaking Problem
Paths and Cycles
Graph Isomorphism
Representation of Graphs
Exercises
Connected Graphs
The Konigsberg Bridge Problem
Exercises
Trees
Spanning Trees
Rooted Trees
Exercises
Directed Graphs
Applications: Scheduling a Meeting Facility
Finding a Cycle in a Directed Graph
Priority in Scheduling
Connectivity in Directed Graphs
Eulerian Circuits in Directed Graphs
Exercises
Chapter Review
Counting and Combinatorics
Traveling Salesperson
Counting Principles
Set Decomposition Principle
Exercises
Permutations and Combinations
Constructing the kth Permutation
Exercises
Counting with Repeated Objects
Combinatorial Identities
Pascals Triangle
Exercises
Chapter Review
Discrete Probability
Ideas of Chance in Computer Science
Exercises
Cross Product Sample Spaces
Exercises
Independent Events and Conditional Probability
Exercises
Discrete Random Variables
Exercises
Variance, Standard Deviation, and the Law of Averages
Exercises
Chapter Review
Recurrence Relations
The Tower of Hanoi Problem
Solving First-Order Recurrence Relations
Exercises
Second-Order Recurrence Relations
Exercises
Divide-and-Conquer Paradigm
Binary Search
Merge Sort
Multiplication of n-Bit Numbers
Divide-and-Conquer Recurrence Relations
Exercises
Chapter Review