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 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