Prentice Hall, 1996. - 524 pages.
Tying together discrete mathematical topics with a theme, this text stresses both basic theory and applications, offering students a firm foundation for more advanced courses. It limits the mathematics required (no calculus), and explains the small amount of linear algebra that is needed.
The book uses algorithms and pseudocode to illustrate techniques, provides coding exercises and features sections on mathematical structures, the predicate calculus, recurrence relations, functions for computer science, growth of functions and minimal spanning trees.
Tying together discrete mathematical topics with a theme, this text stresses both basic theory and applications, offering students a firm foundation for more advanced courses. It limits the mathematics required (no calculus), and explains the small amount of linear algebra that is needed.
The book uses algorithms and pseudocode to illustrate techniques, provides coding exercises and features sections on mathematical structures, the predicate calculus, recurrence relations, functions for computer science, growth of functions and minimal spanning trees.