Advertisement
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 
Computer Science by Dr. Chris Bourke
The PDF covers the following topics related to Computer Science : Introduction, Basics, Conditionals, Loops, Functions, Error Handling, Arrays, Collections and Dynamic Memory, Strings, File Input/Output, Encapsulation and Objects, Recursion, Searching and Sorting, Graphical User Interfaces and Event Driven Programming, Introduction to Databases and Database Connectivity, Basics, Conditionals, Loops, Functions, Error Handling, Arrays, Strings, File I/O, Structures, Recursion, Searching and Sorting, The Java Programming Language, Conditionals, Loops, Methods, Error Handling and Exceptions, Arrays, Strings , File Input, Objects, Searching and Sorting, etc.
Author(s): Dr. Chris Bourke, Department of Computer Science and Engineering, University of Nebraska
647 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
Mathematics for Computer Science
This 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.
Author(s): Eric Lehman, F Thomson Leighton and Albert R Meyer
1006 Pages
Grids and GridTechnologies for Wide Area Distributed Computing
This paper aims to present the state-of-the-art of Grid computing and attempts to survey the major international efforts in developing this emerging technology.
Author(s): Mark Baker, Rajkumar Buyya and Domenico Laforenza
30 Pages
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
Templates forthe Solution of Linear Systems Building Blocks for the Iterative Methods
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):
Pages
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
PagesAdvertisement
