Algorithms + Data Structures = Programs
- Algorithms + Data Structures = Programs
"Algorithms + Data Structures = Programs" is a book written by Niklaus Wirth covering some of the fundamental topics of computer programming. The book was published by Prentice-Hall in 1976 [ [http://portal.acm.org/citation.cfm?id=540029 Algorithms + Data Structures = Programs] ] and is one of the most influential computer science books of the time.
The successful Turbo Pascal compiler written by Anders Hejlsberg was largely inspired by the "Tiny Pascal" compiler in Niklaus Wirth's book.
Chapter outline
*Chapter 1 - Fundamental Data Structures
*Chapter 2 - Sorting
*Chapter 3 - Recursive Algorithms
*Chapter 4 - Dynamic Information Structures
*Chapter 5 - Language Structures and Compilers
References
External links
* [http://www.inf.ethz.ch/personal/wirth/books/AlgorithmE0/ ETH Zurich / N. Wirth / Books / Compilerbau: Algorithms + Data Structures = Programs]
Wikimedia Foundation.
2010.
Look at other dictionaries:
Data mining — Not to be confused with analytics, information extraction, or data analysis. Data mining (the analysis step of the knowledge discovery in databases process,[1] or KDD), a relatively young and interdisciplinary field of computer science[2][3] is… … Wikipedia
Data-centric programming language — defines a category of programming languages where the primary function is the management and manipulation of data. A data centric programming language includes built in processing primitives for accessing data stored in sets, tables, lists, and… … Wikipedia
Data structure — In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.[1][2] Different kinds of data structures are suited to different kinds of applications, and some are highly … Wikipedia
Data type — For other uses, see Data type (disambiguation). In computer programming, a data type is a classification identifying one of various types of data, such as floating point, integer, or Boolean, that determines the possible values for that type; the … Wikipedia
Data Encryption Standard — The Feistel function (F function) of DES General Designers IBM First publis … Wikipedia
Lock-free and wait-free algorithms — In contrast to algorithms that protect access to shared data with locks, lock free and wait free algorithms are specially designed to allow multiple threads to read and write shared data concurrently without corrupting it. Lock free refers to the … Wikipedia
Abstract data type — In computing, an abstract data type (ADT) is a specification of a set of data and the set of operations that can be performed on the data. Such a data type is abstract in the sense that it is independent of various concrete implementations. The… … Wikipedia
Stack (data structure) — In computer science, a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO) . Stacks are used extensively at every level of a modern computer system. For example, a modern PC uses stacks at the… … Wikipedia
Computer data storage — 1 GB of SDRAM mounted in a personal computer. An example of primary storage … Wikipedia
Queue (data structure) — A queue (pronounced /kjuː/) is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and… … Wikipedia
