A Mathematical Foundation for Computer Science by DAVID BARRINGTON
Requirements: .PDF reader, 65 MB
Overview: A Mathematical Foundation for Computer Science introduces the mathematical method using examples from computer science, often illustrated by Java-like code. It begins with propositional and predicate logic, introduces number theory, and deals thoroughly with mathematical induction as it relates to recursive definition and recursive algorithms. Later chapters cover combinatorics, probability, graphs and searching, finite-state machines, and a brief introduction to formal language theory.
Genre: Non-Fiction > Educational
Download Instructions:
https://ouo.io/fKOwiQ
https://ouo.io/Q65Yy9
Trouble downloading? Read This.
