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
This PDF covers the
following topics related to Computer Science : Data the raw
material—Representing information, Putting Computers to Work—Algorithms, Telling
Computers What To Do—Representing Procedures, Really hard
problems—Intractability, Sharing secrets and fighting crime-Cryptography, The
human face of computing-Interacting with computers.
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
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,
Second-Order Logic, Second-Order Quantifier Elimination, Modal Logics, Temporal
Logic, Logics of Programs, Fixpoint Calculus, Rough Concepts.
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
This course note explains
computer programming concepts includes object-oriented programming
techniques: class methods, wrapper classes for primitive types, inheritance,
abstract classes, events and listeners, packaging your code as a stand-alone
program or an applet, interfaces, garbage collection, introduction to
exceptions; structured programming techniques: switch statements, nested loops,
arrays (seaching, sorting, multidimensional).
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