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
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.
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,
Author(s): Eric Lehman, F Thomson Leighton and Albert R
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).