xiv
Preface
choose from, according to your interests and the interests of your students. Yes,
students will probably see most of these topics in more detail in later computer
science courses, but a quick introduction now can keep their interest and make
your claim of relevance more credible.
Section 1.5
Logic programming
Sections 1.6 and 2.3 Proof of correctness
Section 3.3
Analysis of algorithms
Section 5.3
Relations and databases
Section 5.6
The mighty mod function
Section 6.4
Huffman codes
Section 8.2
Logic networks
Section 9.2
Coding theory
In addition, there is a Special Interest Page in each chapter that highlights
interesting applications culled from “the real world.”
n E w i n T H E S E v E n T H E d i T i O n
• The former Chapters 2 and 3 have been reorganized as Chapters 2, 3, and
4 for better clarity and sequencing
• New sections or subsections have been added:
probability
• Bayes’ Theorem
• Binomial Distribution
order of Magnitude (new section)
• The Master Theorem
• Proof of the Master Theorem
Matrices
• Gaussian Elimination
coding theory (new section)
• Introduction
• Background: Homomorphisms and Cosets
• Generating Group Codes
• Decoding Group Codes
• “Special interest pages”—one per chapter—have been introduced to add
relevance and interest to the material being presented.
• Answers to all odd-numbered exercises, as opposed to answers to fewer,
selected exercises, appear in the back of the book. When an exercise asks