Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1
    Online Resource
    Online Resource
    Amsterdam ; Boston : Elsevier Academic Press
    UID:
    b3kat_BV036962301
    Format: 1 Online-Ressource (xxiv, 1045 p.) , ill , 25 cm
    Edition: Online-Ausgabe Elsevier e-book collection on ScienceDirect Sonstige Standardnummer des Gesamttitels: 041169-3
    ISBN: 0124211801 , 9780124211803
    Note: Includes bibliographical references (p. 899-905) and indexes
    Additional Edition: Reproduktion von Discrete mathematics with applications c2004
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Diskrete Mathematik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Amsterdam ; : Elsevier Academic Press,
    UID:
    almahu_9947366982102882
    Format: 1 online resource (1079 p.)
    Edition: 1st ed.
    ISBN: 1-281-05068-7 , 9786611050689 , 0-08-047734-8
    Content: This approachable text studies discrete objects and the relationships that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation.* Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes pr
    Note: Description based upon print version of record. , Front Cover; Discrete Mathematics with Applications; Copyright Page; Table of Contents; Preface; A Word to the Student; Chapter 1. The Language of Logic; 1.1 Propositions; 1.2 Logical Equivalences; 1.3 Quantifiers; 1.4 Arguments (optional); 1.5 Proof Methods; Chapter Summary; Review Exercises; Supplementary Exercises; Computer Exercises; Exploratory Writing Projects; Enrichment Readings; Chapter 2. The Language of Sets; 2.1 The Concept of a Set; 2.2 Operations with Sets; 2.3 Computer Operations with Sets (optional); 2.4 The Cardinality of a Set; 2.5 Recursively Defined Sets; Chapter Summary , Review Exercises Supplementary Exercises; Computer Exercises; Exploratory Writing Projects; Enrichment Readings; Chapter 3. Functions and Matrices; 3.1 The Concept of a Function; 3.2 Special Functions; 3.3 Properties of Functions; 3.4 The Pigeonhole Principle; 3.5 Composition of Functions; 3.6 Sequences and the Summation Notation; 3.7 Matrices; Chapter Summary; Review Exercises; Supplementary Exercises; Computer Exercises; Exploratory Writing Projects; Enrichment Readings; Chapter 4. Induction and Algorithms; 4.1 The Division Algorithm; 4.2 Divisibility Properties; 4.3 Nondecimal Bases , 4.4 Mathematical Induction 4.5 Algorithm Correctness; 4.6 The Growth of Functions; 4.7 Complexities of Algorithms (optional); Chapter Summary; Review Exercises; Supplementary Exercises; Computer Exercises; Exploratory Writing Projects; Enrichment Readings; Chapter 5. Recursion; 5.1 Recursively Defined Functions; 5.2 Solving Recurrence Relations; 5.3 Solving Recurrence Relations Revisited; 5.4 Generating Functions; 5.5 Recursive Algorithms; 5.6 Correctness of Recursive Algorithms; 5.7 Complexities of Recursive Algorithms (optional); Chapter Summary; Review Exercises; Supplementary Exercises , Computer Exercises Exploratory Writing Projects; Enrichment Readings; Chapter 6. Combinatorics and Discrete Probability; 6.1 The Fundamental Counting Principles; 6.2 Permutations; 6.3 Derangements; 6.4 Combinations; 6.5 Permutations and Combinations with Repetitions; 6.6 The Binomial Theorem; 6.7 The Generalized Inclusion-Exclusion Principle (GIEP) (optional); 6.8 Discrete Probability (optional); 6.9 Additional Topics in Probability (optional); Chapter Summary; Review Exercises; Supplementary Exercises; Computer Exercises; Exploratory Writing Projects; Enrichment Readings; Chapter 7. Relations , 7.1 Boolean Matrices 7.2 Relations and Digraphs; 7.3 Computer Representations of Relations (optional); 7.4 Properties of Relations; 7.5 Operations on Relations; 7.6 The Connectivity Relation (optional); 7.7 Transitive Closure (optional); 7.8 Equivalence Relations; 7.9 Partial and Total Orderings; Chapter Summary; Review Exercises; Supplementary Exercises; Computer Exercises; Exploratory Writing Projects; Enrichment Readings; Chapter 8. Graphs; 8.1 Graphs; 8.2 Computer Representations of Graphs (optional); 8.3 Isomorphic Graphs; 8.4 Paths, Cycles, and Circuits , 8.5 Eulerian and Hamiltonian Graphs , English
    Additional Edition: ISBN 0-12-421180-1
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Amsterdam : Elsevier Acad. Press
    UID:
    gbv_1645853365
    Format: Online Ressource (xxiv, 1045 p.) , graph. Darst.
    Edition: Online-Ausg. Amsterdam Elsevier Science & Technology Online-Ressource ScienceDirect
    ISBN: 9780124211803 , 0124211801 , 9780080477343 , 0080477348 , 1281050687 , 9781281050687
    Content: Preface: A Word to the Student; 1. The Language of Logic; 2. The Language of Sets; 3. Functions and Matrices; 4. Induction and Algorithms; 5. Recursion; 6. Combinatorics and Discrete Probability; 7. Relations; 8. Graphs; 9. Trees; 10. Digraphs; 11. Formal Languages and Finite-State Machines; 12. Boolean Algebra and Combinatorial Circuits; Appendix; Bibliography; Solutions to Odd Numbered Exercises; Index
    Content: This approachable text studies discrete objects and the relationsips that bind them. It helps students understand and apply the power of discrete math to digital computer systems and other modern applications. It provides excellent preparation for courses in linear algebra, number theory, and modern/abstract algebra and for computer science courses in data structures, algorithms, programming languages, compilers, databases, and computation. * Covers all recommended topics in a self-contained, comprehensive, and understandable format for students and new professionals * Emphasizes problem-solving techniques, pattern recognition, conjecturing, induction, applications of varying nature, proof techniques, algorithm development and correctness, and numeric computations * Weaves numerous applications into the text * Helps students learn by doing with a wealth of examples and exercises: - 560 examples worked out in detail - More than 3,700 exercises - More than 150 computer assignments - More than 600 writing projects * Includes chapter summaries of important vocabulary, formulas, and properties, plus the chapter review exercises * Features interesting anecdotes and biographies of 60 mathematicians and computer scientists * Instructor's Manual available for adopters * Student Solutions Manual available separately for purchase (ISBN: 0124211828)
    Note: Includes bibliographical references (p. 899-905) and indexes. - Description based on print version record , English
    Additional Edition: ISBN 0124211801
    Additional Edition: ISBN 1281050687
    Additional Edition: ISBN 0124211828
    Additional Edition: Druckausg. Koshy, Thomas Discrete mathematics with applications Amsterdam : Elsevier Acad. Press, 2004 ISBN 0124211801
    Additional Edition: ISBN 9788181478870
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Diskrete Mathematik ; Electronic books ; Electronic books
    URL: Volltext  (Deutschlandweit zugänglich)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Book
    Book
    Amsterdam : Elsevier Academic Press
    UID:
    b3kat_BV017321196
    Format: xxiv, 1045 p. , ill. : 25 cm
    ISBN: 0124211801
    Note: Includes bibliographical references (p. 899-905) and indexes
    Language: English
    Subjects: Mathematics
    RVK:
    Keywords: Diskrete Mathematik
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Book
    Book
    Boston, Mass. : Academic Press
    UID:
    kobvindex_ZBW12053431
    Format: 1045 Seiten , graph. Darst.
    ISBN: 0124211801
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 0124211704?
Did you mean 0122211804?
Did you mean 0124211607?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages