Home : Book details : Book description

Description of  A Mathematical Foundation for Computer Science

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. Feel Free to contact me for book requests, informations or feedbacks. Without You And Your Support We Cant Continue Thanks For Buying Premium From My Links For Support