Andere Kunden interessierten sich auch für
![Explaining the Success of Nearest Neighbor Methods in Prediction]( "Explaining the Success of Nearest Neighbor Methods in Prediction")
Explaining the Success of Nearest Neighbor Methods in Prediction117,99 €![Introduction to Multi-Armed Bandits]( "Introduction to Multi-Armed Bandits")
Introduction to Multi-Armed Bandits116,99 €![Elements of Sequential Monte Carlo]( "Elements of Sequential Monte Carlo")
Elements of Sequential Monte Carlo105,99 €![An Introduction to Deep Reinforcement Learning]( "An Introduction to Deep Reinforcement Learning")
An Introduction to Deep Reinforcement Learning116,99 €![An Introduction to Wishart Matrix Moments]( "An Introduction to Wishart Matrix Moments")
An Introduction to Wishart Matrix Moments107,99 €![A Practical Approach for Machine Learning and Deep Learning Algorithms]( "A Practical Approach for Machine Learning and Deep Learning Algorithms")
A Practical Approach for Machine Learning and Deep Learning Algorithms22,99 €![A Tutorial on Thompson Sampling]( "A Tutorial on Thompson Sampling")
A Tutorial on Thompson Sampling94,99 €
Computing developed as a branch of mathematics, only to drift away from this home as computer science diverged towards more general topics such as the theory of how a computer works. Recently the emphasis has become more mathematical and the new disciplines of software engineering and information technology have emerged. This book is designed to form the basis of a one year course in discrete mathematics for first year computer scientists or software engineers. The material presented covers much of undergraduate algebra with a particular bias towards the computing applications. Topics covered include mathematical logic, set theory, finite and infinite relations and mappings, graphs, graphical algorithms and axiom systems. It concludes with implementations of many of the algorithms in Modula-2 to illustrate how the mathematics may be turned into concrete calculations. Numerous examples and exercises are included with selected solutions to the problems appearing in the appendix. Discrete mathematics is the basic language which every student of computing should take pride in mastering and this book should prove an essential tool in this aim.
Table of contents:
1. Introduction; 2. Logic; 3. Set theory; 4. Relations; 5. Mappings; 6. Graphs; 7. Graph algorithms; 8. Abstract algebra; Appendices.
This book is designed to form the basis of a one-year course in discrete mathematics for first-year computer scientists and software engineers. It covers much of undergraduate algebra with a bias towards computing applications. It includes: mathematical logic; set theory, finite and infinite relations and mappings; graphs; graphical algorithms and axiom systems.
Discrete mathematics is the basic language which every student of computing should take pride in mastering and this book should prove an essential tool in this aim.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Table of contents:
1. Introduction; 2. Logic; 3. Set theory; 4. Relations; 5. Mappings; 6. Graphs; 7. Graph algorithms; 8. Abstract algebra; Appendices.
This book is designed to form the basis of a one-year course in discrete mathematics for first-year computer scientists and software engineers. It covers much of undergraduate algebra with a bias towards computing applications. It includes: mathematical logic; set theory, finite and infinite relations and mappings; graphs; graphical algorithms and axiom systems.
Discrete mathematics is the basic language which every student of computing should take pride in mastering and this book should prove an essential tool in this aim.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.