Computer Science: Abstraction to Implementation
by Robert M. Keller
Publisher: Harvey Mudd College 2001
Number of pages: 627
This book is intended for a broad second course in computer science, one emphasizing principles wherever it seems possible at this level. While this course builds and amplifies what the student already knows about programming, it is not limited to programming. Instead, it attempts to use various programming models to explicate principles of computational systems.
Home page url
Download or read it online for free here:
by Stephen Muggleton, Luc de Raedt - ScienceDirect
Inductive Logic Programming is a new discipline which investigates the inductive construction of first-order clausal theories from examples and background knowledge. The authors survey the most important theories and methods of this new field.
by Allen Cypher - The MIT Press
Programming by Demonstration is a method that allows users to create programs by demonstrating what the program should do. The book describes 18 implementations of Programming by Demonstration, and discusses the problems for this method.
by John C. Reynolds - Prentice Hall
Read this book if you need a much deeper understanding of programming: the need to carefully structure a program to avoid being overwhelmed by its complexity, or the need to insure reliability beyond what can he achieved by debugging.
by Karthik Naidu - GitBook
These are engineer's notes on problem solving. They are ideally suited as practice material for coding interviews. Each post has 5 sections: problem statement, examples, algorithm, code, test cases, and a discussion on time-complexity.