Here is a first-year course in discrete mathematics, requiring no calculus or computer programming experience, for students on computer science and mathematics courses. The approach stresses finding efficient algorithms, rather than existential results. It provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problem solving. All algorithms are presented in English, in a format compatible with the PASCAL programming language. The text contains many exercises, with answers at the back of the book (detailed solutions being supplied for difficult problems).
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Illustrationen
Maße
Höhe: 230 mm
Breite: 150 mm
Gewicht
ISBN-13
978-0-471-61278-0 (9780471612780)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Part 1 Sets and algorithms - an introduction: binary arithmetic and the magic track revisited; algorithms; set theory and the magic trick; set cardinality and counting. Part 2 Arithmetic: exponentiation: a first look; three inductive proofs; how good is fast exponentiation? - the "big oh" notation. Part 3 Arithmetic of sets: binomial coefficients; permutations; the binomial theorem. Part 4 Number theory: greatest common divisors; the Euclidean algorithm; Fibonacci numbers; congruences and equivalence relations; an application - public key encryption schemes. Part 5 Graph theory: building the LAN; graphs; threes and the LAN; graphical highlights. (Partial contents).
