Discrete Mathematical Structures

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. More than any other book in this field, this book ties together discrete topics with a theme. Written at an appropriate level of understanding for those new to the world of abstract mathematics, it limits depth of coverage and areas covered to topics of genuine use in computer science. Chapter topics include fundamentals, logic, counting, relations and digraphs, trees, topics in graph theory, languages and finite-state machines, and groups and coding. For individuals interested in computer science and other related fields — looking for an introduction to discrete mathematics, or a bridge to more advanced material on the subject. This is the only discrete math text that has a thread holding the various topics together. One of the shortest books on the market. New to this edition: stronger coverage of logic, graphs, and trees. Also includes special student projects. Bernard Kolman, Robert C. Busby, Sharon Ross. Previous Eds. Published Under Title: Discrete Mathematical Structures For Computer Science. Includes Index.