Mathematical Structures for Computer Science (Mathematical Sciences)

Gersting, Judith L.; Gersting

ISBN 10: 0716782596 / ISBN 13: 9780716782599

Published by W H Freeman & Co, 1992

About this Item

Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.

Seller Inventory # OTV.0716782596.VG

Bibliographic Details

• Title: Mathematical Structures for Computer Science (Mathematical Sciences)
• Publisher: W H Freeman & Co
• Publication Date: 1992
• Language: English
• ISBN 10: 0716782596
• ISBN 13: 9780716782599
• Binding: Hardcover
• Edition: 3rd Edition
• Condition: very_good

About this title

Synopsis

Mathematical Structuresfor Computer Science has long been a leading textbook in its field. In this latest edition, judith Gersting 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. Thoroughly revised and streamlined the book now homes in on the fundamentals of discrete mathematics, providing clear explanations of basic topics such as predicate logic, program verification, and recursion. It features a number of new examples and applications that todav's computer science student will find particularly relevant and fascinating. Numerous new computer exercises, study aids, and 'practice problems' that help reinforce understanding through laboratory-srvle experimentation 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 tv es 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. An instructor's manual is also available.

About the Author

JUDITH L. GERSTING, University of Hawaii, Hilo