| Home : Concepts : Data Structure |
| Click "Subscribe" if you want to be notified of new or updated links in this category. | Subscribe |
|
|
Data Structure Listings
|
|
Total:
60 | Displaying: 11 - 20 | Pages: << 1 2 3 4 5 6 >> |
|
|
|
DDK is a framework for writing the interpreters discussed in the book. The binaries are fully working versions of the interpreters, but the source distribution is simply the framework with a dummy implementation of the interpreters. The source distrubition is released under the same license as the book. The binaries may be downloaded and freely used, but we reserve all rights to the binaries themselves and the source code from which they were produced.
Updated: 02/20/2005
|
|
|
This is powerpoint tutorial on Object Oriented Programming
Updated: 02/20/2005
|
|
|
The main theme of this book is to describe complex phenomena as structures of interacting objects. Object technology is applicable to a wide range of phenomena on many different levels. Examples are work procedures on the enterprise level; large-scale applications on the systems level; and small, technical details on the program design level.
Updated: 02/20/2005
|
|
|
This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information.
Updated: 02/20/2005
|
|
|
This handbook was written with the intention of making available to the computer scientist, instructor or programmer the wealth of information which the field has generated in the last 20 years.
Updated: 02/20/2005
|
|
|
This course will have two main sections. The first, shorter section will introduce inheritance and polymorphism in object oriented programming. This is material that you will need in the third year, and which makes the implementation of some datastructures more elegant and more re-useable. However this section of the course is fairly independent of the next. The second, longer section will look at different sorts of algorithms, and in particular string processing algorithms and graph algorithms.A. Cawsey)
Updated: 02/20/2005
|
|
|
This book explores some of the more important terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages; theories that are interesting also in their own right. These theories provide abstract models that are easier to explore, because their formalisms avoid irrelevant details
Updated: 02/20/2005
|
|
|
Introduction to Computer Science I
Updated: 02/20/2005
|
|
|
Mathematical Foundations of Computer Science
Updated: 02/20/2005
|
|
|
Introduction to Finite Mathematics
Updated: 02/20/2005
|
|
|
Data Structure Listings
|
|
Total:
60 | Displaying: 11 - 20 | Pages: << 1 2 3 4 5 6 >> |
|
|
