FreeComputerBooks.com
Links to Free Computer, Mathematics, Technical Books all over the World


 Title Discrete Mathematics with Algorithms
 Author(s) Charles A. Cusack
 Publisher: Hope College (2024); eBook (GNU Free Documentation Licensed)
 License(s): GNU Free Documentation License (GNU FDL)
 Hardcover 560 pages
 eBook PDF (570 pages0
 Language: English
 ISBN10/ASIN: 0471849022
 ISBN13: 9780471849025
 Share This:
Book Description
The approach stresses finding efficient algorithms, rather than existential results. Provides an introduction to constructing proofs (especially by induction), and an introduction to algorithmic problemsolving. All algorithms are presented in a format compatible with the in several common programming languages.
About the Authors Charles A. Cusack is a Professor at Department of Computer Science and Department of Mathematics & Statistics, Hope College.
 Discrete and Finite Mathematics
 Algorithms and Data Structures
 Computer Programming
 Introduction to Computer Science
 Functional Programming
 Computer and Programming Languages
 An Active Introduction to Discrete Mathematics and Algorithms (Charles Cusack)
 The Mirror Site (1)  PDF
 The Mirror Site (2)  PDF

A Cool Brisk Walk Through Discrete Mathematics (Stephen Davies)
This is a completely and forever free and open source educational materials dedicated to the mathematics that budding computer science practitioners actually need to know. They feature the fun and addictive teaching of awardwinning lecturer!

Mathematics for Computer Science (Eric Lehman, et al)
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. explores the topics of basic combinatorics, number and graph theory, logic and proof techniques.

Discrete Mathematics: An Open Introduction (Oscar Levin)
This is a gentle introduction to discrete mathematics. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.

Isomorphism  Mathematics of Programming (Xinyu Liu)
This book introduces the mathematics behind computer programming. It intents to tell: programming is isomorphic to mathematics. Just like in art and music, there are interesting stories and mathematicians behind the great minds.

Applied Discrete Structures, Fundamentals (Al Doerr, et al)
This book contains most of the fundamental concepts taught in a one semester course in discrete mathematics which is a required course for students in Computer Science, Mathematics and Information Technology.

Advances in Discrete Differential Geometry (Alexander I. Bobenko)
It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics and is illustrated to convince readers it's both beautiful and useful.

Mathematical Foundations and Aspects of Discrete Mathematics
This is a book about discrete mathematics which also discusses mathematical reasoning and logic. It offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics.

A Spiral Workbook for Discrete Mathematics (Harris Kwong)
This is a book on discrete mathematics with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a final polished form.

Discrete Structures for Computer Science: Counting, Recursion
This book provides a broad introduction to some of the most fascinating and beautiful areas of discrete mathematical structures with examples in logic, applications of the principle of inclusion and exclusion and finally the pigeonhole principal.

Mathematics for Computer Scientists (Gareth J. Janacek, et al)
The aim of this book is to present some the basic mathematics that is needed by computer scientists. The reader is not expected to be a mathematician and we hope will find what follows useful.

Lists, Decisions and Graphs  With an Introduction to Probability
In this book, four basic areas of discrete mathematics are presented: Counting and Listing (Unit CL), Functions (Unit Fn), Decision Trees and Recursion (Unit DT), and Basic Concepts in Graph Theory (Unit GT).

Programming and Mathematical Thinking: Discrete Math & Python
Starting at an elementary level, this book teaches about fundamental structures of discrete mathematics and many simple but powerful programming techniques using those structures.

Discrete Mathematics for Computer Science (Jean Gallier)
This book gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics. Many examples of formal and informal proofs are given.

Discrete Mathematics for Computer Science Students
This book gives thorough coverage to topics that have great importance to computer scientists and provides a motivating computer science example for each math topic. Contents: Counting; Cryptography and Number Theory; Reflections on Logic and Proof.
:






















