03101nam a2200349 a 45000010005000000030009000050050017000140080041000310100012000720200015000840200018000990350021001170400028001380410008001660500022001740820023001961000030002192450072002492500012003212600048003333000047003815001431004285040020018595050362018795260008022416500023022496500031022726500047023038560292023509420014026429520095026561259BD-DhEWU20190310160716.0971103s1993 nyua 001 0 eng d a4867196 a0716782596 a9780716782599 a(OCoLC) 25165087 aDLCcDLCdBD-DhEWUbeng aeng00aQA39.2b.G47 199300a004.0151bGEM 19931 aGersting, Judith L.9141610aMathematical structures for computer science /cJudith L. Gersting. a3rd ed. aNew York :bComputer Science Press,cc1993. axxiv, 757 p. :bill. (some col.) ;c25 cm. aMathematical 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. aIncludes index. tTOCa 1. Formal Logic --
2. Proofs, Recursion, and Analysis of Algorithms --
3. Sets and Combinatorics --
4. Relations, Functions, and Matrices --
5. Graphs and Trees --
6. Graph Algorithms --
7. Boolean Algebra and Computer Logic --
8. Modeling Arithmetic, Computation, and Languages --
Appendix A: Summation Notation --
Appendix B: The Logarithm Function aCSE 0aMathematics.91417 0aMathematical models.91418 0aComputer sciencexMathematics.2SLSH91419423WorldCat detailsuhttp://www.worldcat.org/title/mathematical-structures-for-computer-science/oclc/25165087&referer=brief_resultsuhttp://www.amazon.com/Mathematical-Structures-Computer-Science-Sciences/dp/0716782596/ref=sr_1_1?s=books&ie=UTF8&qid=1365053711&sr=1-1&keywords=9780716782599 2ddccTEXT 00102ddc40718NFICaEWUbEWUcREVd1997-11-03g0.00o004.0151 GEM 1993p2380tC-1yTEXT