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
Introduction to Theoretical Computer Science by Boaz Barak provides an overview of some basic notions. This voluminous note starts with serious foundational mathematics needed to understand the intricacies of computation. Among several models of computation and their representations, he deals with finite and uniform computations. Key topics: It presents efficient algorithms which are essential in solving practical problems and randomized computation, one of whose important features is to bring probabilistic methods into the design of algorithms. Advanced topics broaden the knowledge further towards recent research and trends. This note is intended for students and professionals at large who wish to have a rigorous introduction to theoretical aspects and their practical applications in computer science.
Author(s): Boaz Barak
656 Pages
Overview of Computer Science by Phillip Barty Crouch Junior is broad but detailed in most key areas of computer science. It deals with algorithms, the prerequisite for problem-solving and data processing. Data representation and logic form the backbone through which computers understand and execute instructions and are thus discussed. It does also touch on the topics of machine organization and Moore's Law, referring to the exponential growth that has occurred in computing power. It also covers topics in computer security and algorithmic complexity, and software development practices. Python references and examples, with practical problems will enable readers to understand and apply the content by matching theory with hands-on programming.
Author(s): Phillip Barty Crouch Junior
238 Pages
CS Unplugged is an entertaining way to help learn about the basics of computer science, using snacks, sorting games, and puzzles-none of which require a computer. The PDF covers basic material like data representation, algorithms, and procedures through to advanced and specialized topics such as intractability, cryptography, and human-computer interaction. This is ideal for teachers and students alike who seek knowledge about concepts in computer science using interactives with no digital support; therefore, suitable for any environment where the learning process takes place.
Author(s): Tim Bell, Ian H. Witten, Mike Fellows
243 Pages
Computer Science by Dr. Chris Bourke
Dr. Chris Bourke's book provides an extended textbook introduction to many core areas of computer science. It covers the basics of programming: conditionals, loops, functions, and error handling. More advanced topics concern dynamic memory, collections, and file I/ using both procedural and object-oriented approaches. There are chapters on searching and sorting algorithms, graphical user interface design, and database connectivity. This resource serves well as a starting point, either for beginners or intermediate learners, in terms of providing overall depth regarding key concepts and best practices in the subject of programming.
Author(s): Dr. Chris Bourke, Department of Computer Science and Engineering, University of Nebraska
647 Pages
The book "Logic for Computer Science" by Andrzej Szalas provides an in-depth discussion of several logical systems located at the heart of computer science. This in-depth PDF gives the basics—introducing the reader to some logics—leading to a very solid foundation on the Propositional Calculus and the Predicate Calculus. It goes on to show the application of these logics to automated deduction as both Propositional and Predicate Calculus. The text by this token goes further to illustrate advanced topics, including Second-Order Logic, Second-Order Quantifier Elimination, and Modal Logics. This text also goes on to consider Temporal Logic, Logics of Programs, and Fixpoint Calculus and demonstrates how these notions are used both theoretically and practically in the area of computing. With its breadth, this resource is invaluable in understanding the theoretical underpinnings of computer science and their practical applications in the areas of software development and automated reasoning.
Author(s): Andrzej Szalas
125 Pages
Lecture Notes On High Performance Computing
The following Lecture Notes on High Performance Computing from VSS University of Technology deal in-depth with new computing paradigms aimed at the efficient execution of large computations. This PDF covers Cluster Computing, a form of parallel processing wherein a group of computers that are symmetrically linked work symptomatically as one system to enhance computation power. It looks at Scalable Parallel Computer Architectures, which can grow as demand for processing goes up. This discusses key components of clusters and the role of Cluster Middleware in creating a Single System Image. The notes describe the Evolution of Metacomputing, which covers development and integration aspects of distributed computing resources. Other topics that are considered in this regard include resource-sharing concepts like Load Sharing and Balancing. Furthermore, Grid Computing and Cloud Computing, concepts based on distributed resources and remote servers, will also be discussed. It also deals with the provisioning of Virtual Machines and Time and Space-shared provisioning in order to provide insight into some efficient resource management and virtualization issues in high-performance computing environments.
Author(s): VSS University of Technology
69 Pages
