Mathematical structures for computer science / Judith L. Gersting.
Material type:
TextLanguage: English Publication details: New York : Computer Science Press, c1993. Edition: 3rd edDescription: xxiv, 757 p. : ill. (some col.) ; 25 cmISBN: 0716782596; 9780716782599Subject(s): Mathematics | Mathematical models | Computer science -- MathematicsDDC classification: 004.0151 LOC classification: QA39.2 | .G47 1993Online resources: WorldCat details | Item type | Current library | Collection | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|---|
Text
|
Dr. S. R. Lasker Library, EWU Reserve Section | Non-fiction | 004.0151 GEM 1993 (Browse shelf(Opens below)) | C-1 | Not For Loan | 2380 |
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.
Includes index.
TOC 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
CSE
Tahur Ahmed
Click on an image to view it in the image viewer
There are no comments on this title.