Amazon cover image
Image from Amazon.com

Discrete mathematics / Sherwood Washburn, Thomas Marlowe and Charles T. Ryan.

By: Contributor(s): Material type: TextTextPublication details: Singapore : Pearson Education Asia Pte. Ltd., c2002Edition: Low price editionDescription: xvi, 370, 42, 7 pages : illustrations ; 24 cmISBN:
  • 9814119679
Subject(s): LOC classification:
  • QA 76.9.M35 .W37 2002
Contents:
1. Sets, Subsets, Induction and Recursion. --1.1. The Pascal Triangle (Application: A Counting Problem). -- 1.2. Induction (Application: The Tower of Hanoi). -- 1.3. Sets, Subsets, and Binary Strings (Application: The Knapsack Problem). -- 1.4. Set Operations (Application: An Error-Correcting Code). -- 1.5. Recursions (Application: Shift Registers). -- 2. Integers, Remainders, and the Golden Ratio. -- 2.1. The Integers (Application: When is Div(n) a Tree?). -- 2.2. Lamé's Theorem (Application: Egyptian Fractions). -- 2.3. The Integers Mod n (Application: Public Key Encryption). -- 3. Functions, Relations, and Counting. -- 3.1. Functions and Relations (Application: The Prüfer Correspondence). -- 3.2. Counting Rules (Application: Boolean Functions). -- 3.3. Three Counting Techniques (Application: Tenth Powers). -- 4. Graphs. -- 4.1. Graphs (Application: The Icosahedron and Dodecahedron). 4.2. Graph Theory (Application: One-Way Streets). -- 4.3. Trees (Application: Structural Induction). -- 5. Proof Techniques and Logic. -- 5.1. Proof Techniques (Application: The Liar Problem). -- 5.2. Logic (Application: Logic and the Genetic Code). -- 5.3. The Propositional Calculus (Application: Syllogisms). -- 6. Boolean Algebras, Boolean Functions, and Logic. -- 6.1. Boolean Algebras and Functions (Application: Normal Forms in the Propositional Calculus). -- 6.2. Boolean Functions and Circuits (Application: Regions in Logic Diagrams). -- 6.3. The Predicate Calculus (Application: Proving Program Correctness). -- 7. Graphs and Relations. -- 7.1. Graph Coloring and Matching (Application: Register Allocation). -- 7.2. Posets and Lattices (Application: The Kirkman Schoolgirl Problem). -- 8. Algorithms. -- 8.1. Sorting, Searching, and Listing (Application: The Man, Dog, Goat, and Cabbage Problem). 8.2. Graph Algorithms (Application: Network Flows). -- 8.3. The Complexity of an Algorithm (Application: Kruskal's Algorithm and Prim's Algorithm). -- 9. Combinatorics. -- 9.1. Recursions and Their Solution (Application: AVL trees). -- 9.2. Probabilities (Application: Network Reliability). -- 9.3. Groups and Counting (Application: Rooted Trees). -- 10. Models of Computation. -- 10.1. Languages and Grammars (Application: The Chomsky Heirarchy). -- 10.2. Finite State Machines and Turing Machines (Application: DNA Computing). -- 10.3. Gödel and Turing (Application: The Vanishing). -- Appendix A. Guide to the Literature -- Appendix B. Notes -- Answers to Selected Exercises. -- Index.
Summary: This textbook integrates the topics that make up a discrete mathematics course. "Discrete Mathematics" combines classic, historical material and cutting-edge computer science applications in a clear, high-quality format. The exercise sets, including basic exercises, advanced exercises, and computer exercises, are designed to allow readers to master what they have learned before moving on to more difficult material. With its highly flexible organization, and unique grade of difficulty, "Discrete Mathematics" successfully fits either the freshman-sophomore course or a more advanced junior-senior course, and is accessible to both computer scientists and mathematicians.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Main General Circulation Gen. Ed. - COE GC QA 76.9.M35 .W37 2002 (Browse shelf(Opens below)) c.1 Available NULIB000005781
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Gen. Ed. - COE Close shelf browser (Hides shelf browser)
No cover image available
GC QA 76.9.C643 .N85 2012 c.2 The essentials of computer organization and architecture / GC QA 76.9.D3 .C67 2013 Database principles : fundamentals of design, implementation, and management / GC QA 76.9.D3 .S55 2011 Database system concepts / GC QA 76.9.M35 .W37 2002 Discrete mathematics / GC QA 76.76.C65 .C66 2012 Engineering a compiler / GC QA 76.76.C65 .W55 1995 c.2 Compiler design / GC QA 76.76.D47 .P55 2008 Head first software development /

Includes index.

1. Sets, Subsets, Induction and Recursion. --1.1. The Pascal Triangle (Application: A Counting Problem). -- 1.2. Induction (Application: The Tower of Hanoi). -- 1.3. Sets, Subsets, and Binary Strings (Application: The Knapsack Problem). -- 1.4. Set Operations (Application: An Error-Correcting Code). -- 1.5. Recursions (Application: Shift Registers). -- 2. Integers, Remainders, and the Golden Ratio. -- 2.1. The Integers (Application: When is Div(n) a Tree?). -- 2.2. Lamé's Theorem (Application: Egyptian Fractions). -- 2.3. The Integers Mod n (Application: Public Key Encryption). -- 3. Functions, Relations, and Counting. -- 3.1. Functions and Relations (Application: The Prüfer Correspondence). -- 3.2. Counting Rules (Application: Boolean Functions). -- 3.3. Three Counting Techniques (Application: Tenth Powers). -- 4. Graphs. -- 4.1. Graphs (Application: The Icosahedron and Dodecahedron). 4.2. Graph Theory (Application: One-Way Streets). -- 4.3. Trees (Application: Structural Induction). -- 5. Proof Techniques and Logic. -- 5.1. Proof Techniques (Application: The Liar Problem). -- 5.2. Logic (Application: Logic and the Genetic Code). -- 5.3. The Propositional Calculus (Application: Syllogisms). -- 6. Boolean Algebras, Boolean Functions, and Logic. -- 6.1. Boolean Algebras and Functions (Application: Normal Forms in the Propositional Calculus). -- 6.2. Boolean Functions and Circuits (Application: Regions in Logic Diagrams). -- 6.3. The Predicate Calculus (Application: Proving Program Correctness). -- 7. Graphs and Relations. -- 7.1. Graph Coloring and Matching (Application: Register Allocation). -- 7.2. Posets and Lattices (Application: The Kirkman Schoolgirl Problem). -- 8. Algorithms. -- 8.1. Sorting, Searching, and Listing (Application: The Man, Dog, Goat, and Cabbage Problem). 8.2. Graph Algorithms (Application: Network Flows). -- 8.3. The Complexity of an Algorithm (Application: Kruskal's Algorithm and Prim's Algorithm). -- 9. Combinatorics. -- 9.1. Recursions and Their Solution (Application: AVL trees). -- 9.2. Probabilities (Application: Network Reliability). -- 9.3. Groups and Counting (Application: Rooted Trees). -- 10. Models of Computation. -- 10.1. Languages and Grammars (Application: The Chomsky Heirarchy). -- 10.2. Finite State Machines and Turing Machines (Application: DNA Computing). -- 10.3. Gödel and Turing (Application: The Vanishing). -- Appendix A. Guide to the Literature -- Appendix B. Notes -- Answers to Selected Exercises. -- Index.

This textbook integrates the topics that make up a discrete mathematics course. "Discrete Mathematics" combines classic, historical material and cutting-edge computer science applications in a clear, high-quality format. The exercise sets, including basic exercises, advanced exercises, and computer exercises, are designed to allow readers to master what they have learned before moving on to more difficult material. With its highly flexible organization, and unique grade of difficulty, "Discrete Mathematics" successfully fits either the freshman-sophomore course or a more advanced junior-senior course, and is accessible to both computer scientists and mathematicians.

There are no comments on this title.

to post a comment.