Foundations of Computer Science by Lawrence C PaulsonLawrence C PaulsonPDF  155 Pages  EnglishThis
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.

Mathematics for Computer ScienceEric Lehman, F Thomson Leighton and Albert R
MeyerPDF  1006 Pages  EnglishThis text explains how to use mathematical models and methods to analyze
problems that arise in computer science. Topics covered includes: Proofs , The Well
Ordering Principle, Logical Formulas, Mathematical Data Types, Induction,
Recursive Data Types, Infinite Sets, Structures, Number Theory, Directed graphs
and Partial Orders, Communication Networks, Simple Graphs, Planar Graphs,
Counting.

Computer Operation IIDr. A. S. SodiyaPDF  139 Pages  EnglishThis note explains the following
topics: Files system, memory management, job management and mathematical theory
of jobs scheduling operating systems implementation techniques, modular and
abstraction: synchronization, PSV operation, detailed studies of some operating
systems.

Foundations of Computer ScienceJeff UllmanOnline  NA Pages  EnglishFoundations of
Computer Science covers subjects that are often found split between a discrete
mathematics course and a sophomorelevel sequence in computer science in data
structure. So here the author's intention is to select the
mathematical foundations with an eye toward what the computer user really needs,
rather than what a mathematician might choose.

Computer Science IIPete NordquistOnline  NA Pages  EnglishThis course note explains
computer programming concepts includes objectoriented programming
techniques: class methods, wrapper classes for primitive types, inheritance,
abstract classes, events and listeners, packaging your code as a standalone
program or an applet, interfaces, garbage collection, introduction to
exceptions; structured programming techniques: switch statements, nested loops,
arrays (seaching, sorting, multidimensional).

ComputerAids for VLSI Design 
InformationRetrieval (C.J. van Rijsgergen 
Introduction toComputer Science 
The ZNotation a Reference Manual (by J. M. Spivey) 
Formal Specification andDocumentation using Z A Case Study Approach (by Jonathan Bowen) 
Logicfor Computer Science Foundations of Automatic Theorem Proving (Jean Gallier 
The Chaos Hypertextbook 
CommunicatingSequential Processes (CSP) 
Tree AutomataTechniques and Applications 
How to ThinkLike a Computer Scientist 
ComputerAnimation Algorithms and Techniques 
Foundations ofComputer Science 
StackComputers The New Wave 
Templates forthe Solution of Linear Systems Building Blocks for the Iterative Methods 
DesigningComputers and Digital Systems 
Patternsfor Adaptive Programming (AP) 
Categories,Types and Structures An introduction to Category Theory for the ComputerScientist (Giuseppe Longo) 