Algorithms + Data Structures = Programs
E168963
"Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Algorithms + Data Structures = Programs canonical | 4 |
| Building Abstractions with Data | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1478597 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Algorithms + Data Structures = Programs Context triple: [Niklaus Wirth, authorOf, Algorithms + Data Structures = Programs]
-
A.
Programming Pearls
Programming Pearls is a classic computer science book by Jon Bentley that teaches practical problem-solving, algorithm design, and programming techniques through engaging essays and puzzles.
-
B.
The Art of Computer Programming
The Art of Computer Programming is Donald Knuth’s seminal multi-volume work that rigorously analyzes algorithms and data structures, widely regarded as one of the most influential and comprehensive texts in computer science.
-
C.
Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
-
D.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
-
E.
Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Algorithms + Data Structures = Programs Target entity description: "Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
-
A.
Programming Pearls
Programming Pearls is a classic computer science book by Jon Bentley that teaches practical problem-solving, algorithm design, and programming techniques through engaging essays and puzzles.
-
B.
The Art of Computer Programming
The Art of Computer Programming is Donald Knuth’s seminal multi-volume work that rigorously analyzes algorithms and data structures, widely regarded as one of the most influential and comprehensive texts in computer science.
-
C.
Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
-
D.
Structure and Interpretation of Computer Programs
Structure and Interpretation of Computer Programs is a seminal computer science textbook by Harold Abelson and Gerald Jay Sussman that uses the Scheme language to teach fundamental principles of programming and software design.
-
E.
Compilers: Principles, Techniques, and Tools
Compilers: Principles, Techniques, and Tools is a foundational computer science textbook that systematically covers the theory and practice of compiler design and implementation.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
book
ⓘ
computer science textbook ⓘ |
| author | Niklaus Wirth ⓘ |
| coreThesis | effective programs result from appropriate combinations of algorithms and data structures ⓘ |
| countryOfPublication |
United States of America
ⓘ
surface form:
United States
|
| field |
algorithms
ⓘ
computer science ⓘ data structures ⓘ programming ⓘ |
| hasEdition |
English edition
ⓘ
German edition ⓘ |
| hasISBN | 0-13-022418-9 ⓘ |
| influenced |
algorithm textbooks
ⓘ
computer science education ⓘ data structure textbooks ⓘ software engineering practices ⓘ |
| influencedBy |
Algol W
ⓘ
Pascal ⓘ
surface form:
Pascal programming language
structured programming ⓘ |
| languageOfPublication | English ⓘ |
| notableFor |
early systematic treatment of algorithms and data structures together
ⓘ
popularizing the formula 'Algorithms + Data Structures = Programs' ⓘ |
| originalLanguage | German ⓘ |
| pages | ~360 ⓘ |
| partOfSeries | Prentice Hall Series in Automatic Computation ⓘ |
| pedagogicalApproach |
emphasis on abstraction
ⓘ
example-driven ⓘ top-down program design ⓘ |
| publicationYear | 1976 ⓘ |
| publisher | Prentice Hall ⓘ |
| subtitle | A systematic approach to programming using algorithms and data structures ⓘ |
| targetAudience |
computer science students
ⓘ
software developers ⓘ |
| timePeriod | 1970s computer science literature ⓘ |
| title | Algorithms + Data Structures = Programs self-link ⓘ |
| topic |
complexity considerations
ⓘ
efficiency of programs ⓘ graphs ⓘ hashing ⓘ lists ⓘ program design ⓘ recursion ⓘ relationship between algorithms and data structures ⓘ searching algorithms ⓘ sorting algorithms ⓘ trees ⓘ |
| usesProgrammingLanguage | Pascal ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Algorithms + Data Structures = Programs Description of subject: "Algorithms + Data Structures = Programs" is a classic computer science textbook by Niklaus Wirth that systematically teaches how combining appropriate data structures with algorithms leads to effective and efficient programs.
Referenced by (5)
Full triples — surface form annotated when it differs from this entity's canonical label.
Structure and Interpretation of Computer Programs
→
chapter
→
Algorithms + Data Structures = Programs
ⓘ
this entity surface form:
Building Abstractions with Data
subject surface form:
Niklaus Wirth
Algorithms + Data Structures = Programs
→
title
→
Algorithms + Data Structures = Programs
self-link
ⓘ