Discrete Mathematics

John A. Dossey , Albert D. Otto , Lawrence E. Spence , Charles Vanden Eynden

Editura: Pearson
An ever-increasing percentage of mathematic applications involve discrete rather than continuous models. Driving this trend is the integration of the computer into virtually every aspect of modern society. Intended for a one-semester introductory course, 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.
  • Limba : Engleza
  • Cuprins :

    (Each Chapter concludes with "Historical Notes," "Supplementary Exercises," "Computer Projects," and "Suggested Readings.").

    1: An Introduction to Combinatorial Problems and Techniques


    Section 1.1 The Time to Complete a Project

    Section 1.2 A Matching Problem

    Section 1.3 A Knapsack Problem

    Section 1.4 Algorithms and Their Efficiency

    Historical Notes

    Supplementary Exercises

    Computer Projects

    Suggested Readings


    2: Sets, Relations, and Functions


    Section 2.1 Set Operations

    Section 2.2 Equivalence Relations

    Section 2.3_ Partial Ordering Relations

    Section 2.4 Functions

    Section 2.5 Mathematical Induction

    Section 2.6 Applications

    Historical Notes

    Supplementary Exercises

    Computer Projects

    Suggested Readings


    3: Coding Theory


    Section 3.1 Congruence

    Section 3.2 The Euclidean Algorithm and Diophantine Equations

  • Data Publicarii : 2006
  • Editie : 5
  • Format : Paperback
  • Numar pagini : 688
  • ISBN : 9780321383280
523.99 Lei
Disponibilitate : La comanda

Stocul este limitat la furnizorii nostri. Disponibilitatea si termenul de livrare va vor fi comunicate telefonic in maxim 48 de ore. Puteti anula comanda in cazul in care informatiile furnizate nu va sunt convenabile.