Foundations of Computer Science by Lawrence C Paulson
This note has two objectives. First is to teach programming. Second is to present some fundamental principles of computer science, especially algorithm design. Major topics covered includes: Recursive Functions, O Notation: Estimating Costs in the Limit, Lists, Sorting, Datatypes and Trees, Dictionaries and Functional Arrays, Queues and Search Strategies, Functions as Values, List Functionals, Polynomial Arithmetic, Sequences, or Lazy Lists, Elements of Procedural Programming, and Linked Data Structures.
Author(s): Lawrence C Paulson
155 Pages 
Introduction to Theoretical Computer Science
This note covers Mathematical background, Computation and representation, Finite computation, Uniform computation, Efficient algorithms, Randomized computation and advanced topics.
Author(s): Boaz Barak
656 Pages
This PDF covers the following topics related to Computer Science, Data the raw materialRepresenting information, Putting Computers to WorkAlgorithms, Telling Computers What To DoRepresenting Procedures, Really hard problemsIntractability, Sharing secrets and fighting crimeCryptography, The human face of computingInteracting with computers.
Author(s): Tim Bell, Ian H. Witten, Mike Fellows
243 Pages
Mathematics for Computer Science
This PDF covers the following topics related to Computer Science,Intro to Proofs, Well Ordering Principle, Logical Formulas, Mathematical Data Types, Induction, Recursive Data Types, Infinite Sets, Number Theory, Directed Graphs and Partial Orders, Communication Networks, Simple Graphs, Planar Graphs, Sums and Asymptotics, Cardinality Rules, Generating Functions, Events and Probability Spaces, Conditional Probability, Random Variables, Deviation From the Mean, Random Walks.
Author(s): Eric Lehman, F. Thomson Leighton, Alberty R. Meyer
427 Pages
The PDF covers the following topics related to Computer Science, Introduction to Logics, Propositional Calculus, Predicate Calculus, Applications of Predicate Calculus, Automated Deduction in Propositional Calculus, Automated Deduction in Predicate Calculus, SecondOrder Logic, SecondOrder Quantifier Elimination, Modal Logics, Temporal Logic, Logics of Programs, Fixpoint Calculus, Rough Concepts.
Author(s): Andrzej Szalas
125 Pages
