|Categories||Free Downloadable Misc. IT Books eBooks!|
|Imperative to Functional Programming Succinctly
Functional programming is fundamentally different from imperative programming. As such, it provides a unique approach to solving problems�one that requires developers to transform how they think about software design and implementation.
Computational Physics and Scientific Computing
This book is an introduction to the computational methods used in physics, but also in other scientific fields. It is addressed to an audience that has already been exposed to the introductory level of college physics, usually taught during the first two years of an undergraduate program in science and engineering.
Computer Desktop Encyclopedia
This desktop encyclopedia contains more than 10,000 terms, which are explained accurately and lucidly. There 800 illustrations that are used to show devices and clarify concepts. The expansive, "encyclopedic" format of the book makes it possible to explain concepts and historical background at whatever length is necessary, as opposed to abbreviated and dictionary definitions.
Dynamic Programming and Bayesian Inference, Concepts and Applications
This is a book on the far-ranging algorithmic methododogy of Dynamic Programming. It presents a comprehensive and rigorous treatment of dynamic programming.
Introduction to Theory of Computation
This is a textbook on formal languages, automata theory, and computational complexity. This text strikes a good balance between rigor and an intuitive approach to computer theory.
Models of Computation: Exploring the Power of Computing
The focus of this book is on finite problems and concrete computational models. It covers the traditional topics of formal languages, automata and complexity classes, as well as an introduction to the more modern topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity. These topics are integrated throughout the book as illustrated by the early introduction of P-complete and NP-complete problems.
O'Reilly� Mastering Bitcoin: Unlocking Digital Crypto-Currencies
Mastering Bitcoin tells you everything you need to know about joining one of the most exciting revolutions since the invention of the web: digital money. Bitcoin is the first successful digital currency. It's instant, global, frictionless and it is changing money forever. Bitcoin is still in its infancy, and yet it has already spawned an economy valued at nearly $2 billion that is growing exponentially. Established companies like PayPal are considering adding bitcoin as a payment method, and investors are funding a flurry of new startups aiming to stake claims in a new industry that may rival the Internet in terms of scale and impact on daily life.
Business Information Systems: Design an App for That
This book is designed to help students get a feel for what a career in Management Information System (MIS) would be like. Our students report that they learn more about information systems from their internships than from their IS courses. Consequently, we designed a course that looks very much like an internship�an introduction to the field followed by a substantial project.
Foundations of Computation
This is a textbook for a one-semester course in theoretical computer science. The course has no prerequisites other than introductory computer programming. The first half of the course covers material on logic, sets, and functions that would often be taught in a course in discrete mathematics. The second part covers material on automata, formal languages, and grammar that would ordinarily be encountered in an upper level course in theoretical computer science.
Building Blocks for Theoretical Computer Science
For all readers interested in the basics of computer science. This book teaches you how to read and write mathematical proofs. It provides a survey of basic mathematical objects, notation, and techniques which will be useful in later computer science courses. And, finally, it gives a brief introduction to some key topics in theoretical computer science: algorithm analysis and complexity, automata theory, and computability.