Mathematical Structures for Computer Science

ISBN-10: 071676864X

ISBN-13: 9780716768647

Edition: 6th 2007 (Revised)

Authors: Judith L. Gersting

List price: $192.99
30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy


This edition offers a pedagogically rich and intuitive introduction to discrete mathematics structures. It meets the needs of computer science majors by being both comprehensive and accessible.
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Calculus 1 Online content $4.95 $1.99
Add to cart
Study Briefs
Algebra Online content $4.95 $1.99
Add to cart
Study Briefs
Introduction to Logic Online content $4.95 $1.99
Add to cart
Study Briefs
Business Math Formulas Online content $4.95 $1.99
Customers also bought

Book details

List price: $192.99
Edition: 6th
Copyright year: 2007
Publisher: W. H. Freeman & Company
Publication date: 7/7/2006
Binding: Hardcover
Pages: 784
Size: 8.50" wide x 10.50" long x 2.00" tall
Weight: 3.674
Language: English

Note to the Student
Formal Logic
Statements, Symbolic Representation, and Tautologies
Propositional Logic
Quantifiers, Predicates, and Validity
Predicate Logic
Logic Programming
Proof of Correctness
Proofs, Recursion, and Analysis of Algorithms
Proof Techniques
More on Proof of Correctness
Recursive Definitions
Recurrence Relations
Analysis of Algorithms
Sets, Combinatorics, Probability, and Number Theory
Principle of Inclusion and Exclusion; Pigeonhole Principle
Permutations and Combinations
Binomial Theorem
Number Theory
Relations, Functions, and Matrices
Topological Sorting
Relations and Databases
The Mighty Mod Function
Graphs and Trees
Graphs and their Representations
Trees and their Representations
Decision Trees
Huffman Codes
Graph Algorithms
Directed Graphs and Binary Relations; Warshall's Algorithm
Euler Path and Hamiltonian Circuit
Shortest Path and Minimal Spanning Tree
Traversal Algorithms
Articulation Points and Computer Networks
Boolean Algebra and Computer Logic
Boolean Algebra Structure
Logic Networks
Modeling Arithmetic, Computation, and Languages
Algebraic Structures
Finite-State Machines
Turing Machines
Formal Languages
Derivation Rules for Propositional and Predicate Logic
Summation Notation
The Logarithm Function
Answers to Practice Problems
Answers to Selected Exercises
Answers to Self-Tests
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.