Mathematical Foundations of Computer Science
by Susan Rodger
Publisher: Duke University 1998
These lecture notes present an introduction to theoretical computer science including studies of abstract machines, the language hierarchy from regular languages to recursively enumerable languages, noncomputability and complexity theory.
Home page url
Download or read it online for free here:
(multiple PDF, PS files)
by Allen B. Downey
This book teaches you to think like a computer scientist - to combine the best features of mathematics, natural science, and engineering, to use formal languages to denote ideas, to observe the behavior of complex systems, form hypotheses, etc.
by Max Hailperin, Barbara Kaiser, Karl Knight - Course Technology
The book Concrete Abstractions covers the programming and data structures basics. It will give first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well.
by David Reed - Prentice Hall
The book covers concepts in computing that are most relevant to the beginning student, including computer terminology, the Internet and World Wide Web, the history of computing, the organization and manufacture of computer technology, etc.
by Margaret M. Fleck - University of Illinois, Urbana-Champaign
This book provides a survey of basic mathematical objects, notation, and techniques useful in later computer science courses. It gives a brief introduction to some key topics: algorithm analysis and complexity, automata theory, and computability.