Discrete Mathematical Structures - Hardcover

Kolman, Bernard

Hardcover

ISBN 10: 0133209121 ISBN 13: 9780133209129

Publisher: Prentice Hall, 1996

Synopsis

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. A student solutions manual (0-13-515917-2) and instructor's manual (0-13-375064-7) are available.

About this title

From the Publisher:

More than any other text in this field, this text ties together discrete topics with a theme. Written at an appropriate level of rigor -- with a strong pedagogical focus -- it limits depth of coverage and areas covered to topics of genuine use in computer science. It stresses both basic theory and applications -- providing students with a firm foundation for more advanced courses.

From the Back Cover:

This is the only discrete math that has a thread developed through the text holding these various topics together. New to this edition: stronger coverage of logic, graphs, and trees.

About this edition

• Publisher: Prentice Hall
• Publication date: 1996
• ISBN 10: 0133209121
• ISBN 13: 9780133209129
• Binding: Hardcover
• Edition number: 3
• Number of pages: 524