This book is in good used condition. Spine is a little loose. There is no writing or underlining. ISBN 0-7167-8259-6. 757 pages. Copyright 1993.

A book Computer Science Majors can truly call their own!

Mathematical Structures for Computer Science has long been a leading textbook in its field. In this latest edition, Judith Gerstring takes a fresh new approach to communicating the often elusive concepts of discrete mathematics - one that is particularly appropriate for beginning students of computer science.

Throughly revised and streamlined. the book now zeros in on the fundamentals of discrete mathematics, providing cleay, entry-level explanations of basic topics such as predicate logic, program verification, and recursion. It features a number of new examples and applications that today's computer science student will find particularly relevant and fascinating. Numerous new computer exercises, study aids, and 'practical problems' that help reinforce understanding through laboratory-style experimentations have been added.

New for this edition:

• Expanded treatment of predicate logic
• Expanded discussion of recursion
• Fuller treatment of program verification
• New systematic solution strategies for certain types of recurrence relations
• Thorough coverage of complete induction
• Discussions of set implementations in programming languages, object-oriented programming, and relational database operations
• Separate sections on inclusion/exclusion and the pigeonhole principle
• New coverage of entity/relationship database design and topological sorting
• Additional graph theory algorithms