Concrete Abstractions: An Introduction to Computer Science Using Scheme
by Max Hailperin, Barbara Kaiser, Karl Knight
Publisher: Course Technology 1998
ISBN/ASIN: 0534952119
ISBN-13: 9780534952112
Number of pages: 670
Description:
This text covers the basics of programming and data structures, and gives first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well.
Download or read it online for free here:
Download link
(2.5MB, PDF)
Similar books
Mathematical Foundations of Computer Science
by Susan Rodger - Duke University
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.
(16517 views)
by Susan Rodger - Duke University
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.
(16517 views)
Essentials of Theoretical Computer Science
by F. D. Lewis - University of Kentucky
This text is a broad introduction to the field, presented from a computer science viewpoint for computer scientists. This was designed to be used in a one-semester course for senior computer science majors or first year masters students.
(14364 views)
by F. D. Lewis - University of Kentucky
This text is a broad introduction to the field, presented from a computer science viewpoint for computer scientists. This was designed to be used in a one-semester course for senior computer science majors or first year masters students.
(14364 views)
Building Blocks for Theoretical Computer Science
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.
(12126 views)
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.
(12126 views)
Computer Science I
by Chris Bourke - University of Nebraska - Lincoln
A draft of text book for Computer Science I, covering CS1 topics in a generic manner using psuedocode with supplemental parts for specific languages. Computer Science is not programming. Programming is a necessary skill, but it is only the beginning.
(9798 views)
by Chris Bourke - University of Nebraska - Lincoln
A draft of text book for Computer Science I, covering CS1 topics in a generic manner using psuedocode with supplemental parts for specific languages. Computer Science is not programming. Programming is a necessary skill, but it is only the beginning.
(9798 views)