The Design Patterns Java Companion
The term “design patterns” sounds a bit formal to the uninitiated and can be
somewhat off-putting when you first encounter it. But, in fact, design patterns
are just convenient ways of reusing object-oriented code between projects and
between programmers. The idea behind design patterns is simple-- write
down and catalog common interactions between objects that programmers
have frequently found useful.
http://www.patterndepot.com/put/8/JavaPatterns.htm
created by fabia on 2008-04-06 07:12:52
|
|
|
Understanding User and Kernel Mode
CPU usage is generally represented as a simple percentage of CPU time spent on non-idle tasks. But this is a bit of a simplification. In any modern operating system, the CPU is actually spending time in two very distinct modes:
http://www.codinghorror.com/blog/archives/001029.h
created by san on 2008-01-14 21:45:49
|
|
|
AVERAGE CASE ANALYSIS OF ALGORITHMS ON SEQUENCES
This book includes chapters on algorithms and data structures on words, probabilistic and analytical models, inclusion-exclusion principles, first and second moment methods, subadditive ergodic theorem and large deviations, elements of information theory, generating functions, complex asymptotic methods, Mellin transform and its applications, and analytic poissonization and depoissonization
http://www.cs.purdue.edu/homes/spa/book.html
created by fab on 2007-12-17 23:19:46
|
|
|
Data Structures and Algorithms with Object-Oriented Design Patterns in C++
The primary goal of this book is to promote object-oriented design using C++ and to illustrate the use of the emerging object-oriented design patterns. Experienced object-oriented programmers find that certain ways of doing things work best and that these ways occur over and over again. The book shows how these patterns are used to create good software designs. In particular, the following design patterns are used throughout the text: singleton, container, iterator, adapter and visitor.
http://www.brpreiss.com/books/opus4/html/book.html
created by fab on 2007-12-17 23:13:41
|
|
|
Algorithms in the Real World: Lecture Notes
This document contains the lecture notes taken by the students in the course Algorithms in the Real World taught at UC Berkeley during the Fall semester, 1997.
http://www.cs.cmu.edu/afs/cs/project/pscico-guyb/2
created by fab on 2007-12-17 23:22:15
|
|
|
Data Structures and Algorithms
This book is about the fundamentals of data structures and algorithms
http://www.brpreiss.com/books/opus5/body.html
created by fab on 2007-12-17 23:12:06
|
|
|
Design and Analysis of Algorithms: Course Notes
This is a compilation of lecture notes, used by the author to teach CMSC 651: Design and Analysis of Algorithms at Dept. of Computer Science, University of Maryland. This course has been taught several times and each time the coverage of the topics differs slightly.
http://www.cs.umd.edu/users/samir/cs651.ps
created by fab on 2007-12-17 23:11:06
|
|
|
Art of Programming Contest
This book is designed to serve as a textbook for an algorithm course focusing on programming as well as a programming course focusing on algorithms. The book is specially designed to train students to participate in competitions, especially the ACM International Collegiate Programming Contest.
http://acm.uva.es/problemset/Art_of_Programming_Co
created by fab on 2007-12-17 23:21:20
|
|
|
Design and Analysis of Computer Algorithms
The focus of this course is on how to design good algorithms, and how to analyze their efficiency. This is among the most basic aspects of good programming.
http://www.cs.umd.edu/~mount/451/Lects/451lects.pd
created by fab on 2007-12-17 23:10:25
|
|
|
CS 373: Combinatorial Algorithms
These lecture notes is about algorithms, especially combinatorial algorithms.
http://compgeom.cs.uiuc.edu/~jeffe/teaching/373/
created by fab on 2007-12-17 23:18:31
|
|
|
Submit Link Here
