Discrete and Combinatorial Mathematics: Pearson New International Edition (häftad)
Format
Häftad (Paperback)
Språk
Engelska
Antal sidor
936
Utgivningsdatum
2013-08-07
Upplaga
5
Förlag
Pearson
Illustrationer
Illustrationsstrations (black and white, and colour)
Dimensioner
275 x 210 x 20 mm
Vikt
1992 g
Antal komponenter
1
ISBN
9781292022796
Discrete and Combinatorial Mathematics: Pearson New International Edition (häftad)

Discrete and Combinatorial Mathematics: Pearson New International Edition

An Applied Introduction

(1 röst)  |  Läs 1 recension
Häftad Engelska, 2013-08-07
729
Fåtal ex i lager. Skickas inom 1-2 vardagar.
Fri frakt inom Sverige för privatpersoner.
This fifth edition continues to improve on the features that have made it the market leader. The text offers a flexible organization, enabling instructors to adapt the book to their particular courses. The book is both complete and careful, and it continues to maintain its emphasis on algorithms and applications. Excellent exercise sets allow students to perfect skills as they practice. This new edition continues to feature numerous computer science applications-making this the ideal text for preparing students for advanced study.
Visa hela texten

Passar bra ihop

  1. Discrete and Combinatorial Mathematics: Pearson New International Edition
  2. +
  3. Numerical Analysis: Pearson New International Edition

De som köpt den här boken har ofta också köpt Numerical Analysis: Pearson New International E... av Timothy Sauer (häftad).

Köp båda 2 för 1488 kr

Kundrecensioner

Det finns 1 recension av Discrete and Combinatorial Mathematics: Pearson New International Edition. Har du också läst boken? Sätt ditt betyg »
  1. För lite introduktion till problemen. Inga...
    Rune Sven Karlsson, 8 november 2013

    För lite introduktion till problemen. Inga lösningsexempel!
    Saknar bra vägledning för att lösa svåra problem.
    Den enda som "kan" ha nytta av denna bok är de som redan kan ämnet => Ingen bra bok för att lära sig.

Visa alla 1 recensioner

Fler böcker av Ralph P Grimaldi

  • Discrete and Combinatorial Mathematics (Classic Version)

    Ralph P Grimaldi

    This title is part of the Pearson Modern Classics series. Pearson Modern Classics are acclaimed titles at a value price. Please visit  www.pearsonhighered.com/math-classics-series  for a complete list of titles. This 5th Edition continue...

  • Fibonacci and Catalan Numbers

    Ralph P Grimaldi

    Discover the properties and real-world applications of the Fibonacci and the Catalan numbers With clear explanations and easy-to-follow examples, Fibonacci and Catalan Numbers: An Introduction offers a fascinating overview of these topics that is ...

Bloggat om Discrete and Combinatorial Mathematics: P...

Innehållsförteckning

PART 1. FUNDAMENTALS OF DISCRETE MATHEMATICS.

1. Fundamental Principles of Counting.

 

The Rules of Sum and Product.

 

 

Permutations.

 

 

Combinations: The Binomial Theorem.

 

 

Combinations with Repetition.

 

 

The Catalan Numbers (Optional).

 

 

Summary and Historical Review.

 

2. Fundamentals of Logic.

 

Basic Connectives and Truth Tables.

 

 

Logical Equivalence: The Laws of Logic.

 

 

Logical Implication: Rules of Inference.

 

 

The Use of Quantifiers.

 

 

Quantifiers, Definitions, and the Proofs of Theorems.

 

 

Summary and Historical Review.

 

3. Set Theory.

 

Sets and Subsets.

 

 

Set Operations and the Laws of Set Theory.

 

 

Counting and Venn Diagrams.

 

 

A First Word on Probability.

 

 

The Axioms of Probability (Optional).

 

 

Conditional Probability: Independence (Optional).

 

 

Discrete Random Variables (Optional).

 

 

Summary and Historical Review.

 

4. Properties of the Integers: Mathematical Induction.

 

The Well-Ordering Principle: Mathematical Induction.

 

 

Recursive Definitions.

 

 

The Division Algorithm: Prime Numbers.

 

 

The Greatest Common Divisor: The Euclidean Algorithm.

 

 

The Fundamental Theorem of Arithmetic.

 

 

Summary and Historical Review.

 

5. Relations and Functions.

 

Cartesian Products and Relations.

 

 

Functions: Plain and One-to-One.

 

 

Onto Functions: Stirling Numbers of the Second Kind.

 

 

Special Functions.

 

 

The Pigeonhole Principle.

 

 

Function Composition and Inverse Functions.

 

 

Computational Complexity.

 

 

Analysis of Algorithms.

 

 

Summary and Historical Review.

 

6. Languages: Finite State Machines.

 

Language: The Set Theory of Strings.

 

 

Finite State Machines: A First Encounter.

 

 

Finite State Machines: A Second Encounter.

 

 

Summary and Historical Review.

 

7. Relations: The Second Time Around.

 

Relations Revisited: Properties of Relations.

 

 

Computer Recognition: Zero-One Matrices and Directed Graphs.

 

 

Partial Orders: Hasse Diagrams.

 

 

Equivalence Relations and Partitions.

 

 <...