Discrete mathematics for computing / Peter Grossman.
By: Grossman, Peter (Peter Alexander)
.
Material type: ![materialTypeLabel](/opac-tmpl/lib/famfamfam/BK.png)
![](/opac-tmpl/bootstrap/images/filefind.png)
Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
General Lending | MTU Bishopstown Library Lending | 004.0151 (Browse shelf(Opens below)) | 1 | Available | 00074331 | ||
General Lending | MTU Bishopstown Library Store Item | 004.0151 (Browse shelf(Opens below)) | 1 | Available | 00074334 | ||
General Lending | MTU Bishopstown Library Lending | 004.0151 (Browse shelf(Opens below)) | 1 | Available | 00074336 | ||
General Lending | MTU Bishopstown Library Lending | 004.0151 (Browse shelf(Opens below)) | 1 | Available | 00074337 |
Browsing MTU Bishopstown Library shelves, Shelving location: Store Item Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
004.014 Computing terminology / | 004.014 Computing terminology / | 004.014 Computing terminology / | 004.0151 Discrete mathematics for computing / | 004.0151 The MATLAB 5 handbook / | 004.0151 Mathematical foundations of programming / | 004.0151 Mathematical foundations of programming / |
Enhanced descriptions from Syndetics:
Tertiary text which provides an introduction to discrete mathematics and the material that forms the essential mathematical background for studies in computing and information systems. Topics covered include number systems, logic, relations, functions, induction, recursion, Boolean algebra, combinatories, graph theory and number theory. The text contains many examples of applications of the theory to problems in computing. Includes revision exercises and challenging problems at the end of each chapter. Answers provided. Includes an index. Also available in hardback. The author is a lecturer in the department of mathematics at Monash University.
Includes index.
Introduction to Algorithms -- Bases and Number Representation -- Computer Representation and Arithmetic -- Logic -- Sets and Relations -- Functions -- Induction and Recursion -- Boolean Algebra and digital circuits -- Combinatorics -- Introduction to graph theory -- Trees -- Number theory -- Algorithms and Computational complexity.