Advertisement
Lecture Notes On High Performance Computing
This lecture note explains the following topics: Cluster Computing, Scalable Parallel Computer Architectures, Components for Clusters, Cluster Middleware and Single System Image, Evolution of Metacomputing, Load Sharing and Balancing, Grid Computing, Cloud Computing, Virtual Machine and its Provisioning, Time and Space-shared Provisioning.
Author(s): VSS University of Technology
69 Pages 
Introduction to General Computer Science
This Book contents provides a thorough exploration of computer science, algorithms, discrete mathematics, number systems, Boolean algebra, computer architecture, system software, and software correctness. Covering topics from maze generation algorithms to software verification, the document serves as a comprehensive guide to fundamental concepts in the field.
Author(s): Jorgen Schonwalder
255 Pages
Logic for Computer Science Lecture Notes
This lecture note covers introduction, Informal Propositional Logic, The Formal Syntax of Propositional Logic,Functions Defined Recursively on PL, Semantics of Propositional Logic, Logical Connectives, Natural Deduction, Normal Forms and Resolution in Propositional Logic.
Author(s): Alexandru Ioan Cuza University
84 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
Introduction to Computer Science
This note covers the following topics: Computing: The Functional Way, Computing Tool, Algorithms: Design and Refinement, Technical Completeness and Algorithms, Introducing Reals, Correctness, Termination and Complexity, Compound Data, Higher Order Functions and Structured Data, Imperative Programming.
Author(s): S. Arun-Kumar
710 Pages
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
Foundations of Computer Science
Foundations of Computer Science covers subjects that are often found split between a discrete mathematics course and a sophomore-level 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.
Author(s): Jeff Ullman
NA Pages
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
Pages
Foundations ofComputer Science
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
Pages
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
Pages
DesigningComputers and Digital Systems
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
PagesAdvertisement
