Discrete Mathematics for Computing
Autor Peter Grossmanen Limba Engleză Paperback – 16 dec 2008
This new edition includes:
- An expanded section on encryption
- Additional examples of the ways in which theory can be applied to problems in computing
- Many more exercises covering a range of levels, from the basic to the more advanced
This book is ideal for students taking a one-semester introductory course in discrete mathematics - particularly for first year undergraduates studying Computing and Information Systems.
PETER GROSSMAN has worked in both academic and industrial roles as a mathematician and computing professional. As a lecturer in mathematics, he was responsible for coordinating and developing mathematics courses for Computing students. He has also applied his skills in areas as diverse as calculator design, irrigation systems and underground mine layouts. He lives and works in Melbourne, Australia.
Preț: 421.89 lei
Preț vechi: 474.04 lei
-11% Nou
Puncte Express: 633
Preț estimativ în valută:
74.66€ • 87.26$ • 64.82£
74.66€ • 87.26$ • 64.82£
Carte tipărită la comandă
Livrare economică 18 februarie-04 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780230216112
ISBN-10: 0230216110
Pagini: 328
Ilustrații: figures
Dimensiuni: 184 x 244 x 22 mm
Greutate: 0.64 kg
Ediția:Revizuită
Editura: Bloomsbury Publishing
Colecția Red Globe Press
Locul publicării:London, United Kingdom
ISBN-10: 0230216110
Pagini: 328
Ilustrații: figures
Dimensiuni: 184 x 244 x 22 mm
Greutate: 0.64 kg
Ediția:Revizuită
Editura: Bloomsbury Publishing
Colecția Red Globe Press
Locul publicării:London, United Kingdom
Cuprins
List of symbols
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.
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.