MARC details
| 000 -LEADER |
|---|
| fixed length control field |
03926nam a2200241Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
NULRC |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20250520100549.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250520s9999 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9814119679 |
| 040 ## - CATALOGING SOURCE |
|---|
| Transcribing agency |
NULRC |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA 76.9.M35 .W37 2002 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Washburn, Sherwood |
| Relator term |
author |
| 245 #0 - TITLE STATEMENT |
|---|
| Title |
Discrete mathematics / |
| Statement of responsibility, etc. |
Sherwood Washburn, Thomas Marlowe and Charles T. Ryan. |
| 250 ## - EDITION STATEMENT |
|---|
| Edition statement |
Low price edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Singapore : |
| Name of publisher, distributor, etc. |
Pearson Education Asia Pte. Ltd., |
| Date of publication, distribution, etc. |
c2002 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xvi, 370, 42, 7 pages : |
| Other physical details |
illustrations ; |
| Dimensions |
24 cm. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Includes index. |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
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. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
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. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
MATHEMATICS |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Marlowe, Thomas ;Ryan, Charles T. |
| Relator term |
co-author;co-author |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
Library of Congress Classification |
| Koha item type |
Books |
