Discrete Mathematics 4th Edition by John A Dossey, Albert D Otto, Lawrence E Spence, Charles Vanden Eynden ISBN 0321079124 9780321079121

Discrete Mathematics 4th Edition by John A Dossey, Albert D Otto, Lawrence E Spence, Charles Vanden Eynde – Ebook PDF Instant Download/Delivery: 0321079124, 9780321079121
Full download Discrete Mathematics 4th Edition after payment

Product details:

ISBN 10: 0321079124 
ISBN 13: 9780321079121
Author: John A Dossey, Albert D Otto, Lawrence E Spence, Charles Vanden Eynde

The strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students.

Algorithms are presented in English, eliminating the need for knowledge of a particular programming language. Computational and algorithmic exercise sets follow each chapter section and supplementary exercises and computer projects are included in the end-of-chapter material. This Fifth Edition features a new Chapter 3 covering matrix codes, error correcting codes, congruence, Euclidean algorithm and Diophantine equations, and the RSA algorithm.

MARKET: Intended for use in a one-semester introductory course in discrete mathematics.

Discrete Mathematics 4th Table of contents:

Part 1: Introduction to Combinatorial Problems and Techniques

• Chapter 1: An Introduction to Combinatorial Problems and Techniques

  • The Time to Complete a Project (Possible introductory problem)
  • Algorithms and Their Efficiency (Possible introductory topic)
  • (Likely includes basic counting principles as an introduction to the field)

• Chapter 2: Sets, Relations, and Functions

  • Introduction
  • Sets and Elements, Subsets
  • Venn Diagrams
  • Set Operations
  • Algebra of Sets, Duality
  • Finite Sets, Counting Principle
  • Classes of Sets, Power Sets, Partitions
  • Relations
  • Product Sets
  • Pictorial Representatives of Relations
  • Composition of Relations
  • Types of Relations
  • Closure Properties
  • Equivalence Relations
  • Congruence
  • Partial Ordering Relations
  • Functions
  • Mathematical Induction
  • Applications
  • One-to-One, Onto, and Invertible Functions
  • Mathematical Functions, Exponential and Logarithmic Functions
  • Sequences, Indexed Classes of Sets
  • Recursively Defined Functions
  • Cardinality
  • Algorithms and Functions
  • Complexity of Algorithms

• Chapter 3: Coding Theory (This chapter is a notable inclusion, not always in every discrete math text)

• Chapter 4: Graphs

  • Introduction, Data Structures
  • Graphs and Multigraphs
  • Subgraphs, Isomorphic and Homeomorphic Graphs
  • Paths, Connectivity
  • Traversable and Eulerian Graphs, Bridges of Königsberg
  • Labeled and Weighted Graphs
  • Complete, Regular, and Bipartite Graphs

  • Planar Graphs
  • Graph Colorings
  • Representing Graphs in Computer Memory
  • Graph Algorithms
  • Traveling-Salesman Problem
  • Paths and Circuits
  • Shortest Paths and Distance
  • Coloring a Graph
  • Directed Graphs and Multi Graphs

• Chapter 5: Trees

  • Properties of Trees
  • Spanning Trees
  • Depth-First Search
  • Rooted Trees
  • Binary Trees and Traversals
  • Optimal Binary Trees and Binary Search Trees

• Chapter 6: Matching

  • Systems of Distinct Representatives
  • Matching in Graphs
  • A Matching Algorithm
  • Applications of the Algorithm
  • The Hungarian Method

• Chapter 7: Network Flows

  • Flows and Cuts
  • A Flow Augmentation Algorithm
  • The Max-Flow Min-Cut Theorem
  • Flows and Matchings

• Chapter 8: Counting Techniques

  • Pascal’s Triangle and the Binomial Theorem
  • Three Fundamental Principles (Sum, Product, Subtraction Principles)
  • Permutations and Combinations
  • Arrangements and Selections with Repetitions
  • Probability
  • The Pigeonhole Principle
  • The Inclusion-Exclusion Principle
  • Tree Diagrams
  • *The Principle of Inclusion-Exclusion
  • *Generating Permutations and r-Combinations

• Chapter 9: Recurrence Relations and Generating Functions

  • Recurrence Relations
  • The Method of Iteration
  • Linear Difference Equations with Constant Coefficients
  • *Analyzing the Efficiency of Algorithms with Recurrence Relations
  • Counting with Generating Functions
  • The Algebra of Generating Functions

• Chapter 10: Combinatorial Circuits and Finite State Machines

  • Logical Gates
  • Creating Combinatorial Circuits
  • Languages, Automata, Grammars
  • Alphabet, Words, Free Semigroup
  • Languages
  • Regular Expressions, Regular Languages
  • Finite State Automata
  • Grammars

People also search for Discrete Mathematics 4th:

discrete mathematics
    
discrete mathematics in computer science
    
discrete mathematics in hindi
    
discrete mathematics in arabic
    
discrete mathematics in engineering

Tags: John A Dossey, Albert D Otto, Lawrence E Spence, Charles Vanden Eynde, Discrete