An edition of Algorithms + data structures=programs (1976)

Algorithms + data structures=programs

by

  • ★★★★★ 5.0 (1 rating)
  • 31 Want to read
  • 1 Have read
Cover of: Algorithms + data structures=programs by Niklaus Wirth, Niklaus Wirth
Preview Only

My Reading Lists:

Create a new list
Notes
  • ★★★★★ 5.0 (1 rating)
  • 31 Want to read
  • 1 Have read
Notes

Check nearby libraries

Buy this book

Last edited by MARC Bot
February 14, 2020 | History
Edit
An edition of Algorithms + data structures=programs (1976)

Algorithms + data structures=programs

by

  • ★★★★★ 5.0 (1 rating)
  • 31 Want to read
  • 1 Have read

This work doesn't have a description yet. Can you add one?

Publish Date
Publisher
Prentice-Hall
Language
/languages/eng
Pages
366

Check nearby libraries

Buy this book

Previews available in: /languages/eng

Subjects

Computer programming, Data structures (Computer science), Computer algorithms, Algorithms, Electronic digital computers, Computers, Programming
Edition Availability
Cover of: Algorithms + data structures=programs
Algorithms + data structures=programs
1976, Prentice-Hall
in /languages/eng
Cover of: Algorithms + data structures=programs.
Algorithms + data structures=programs.
1976, Prentice-Hall
in /languages/eng

Add another edition?

Book Details

Table of Contents

Preface
Page x
Declaration
Page xv
1. Fundamental Data Structures
Page 1
1.1. Introduction
Page 1
1.2. The Concept of Data Type
Page 4
1.3. Primitive Data Types
Page 6
1.4. Standard Primitive Types
Page 8
1.5. Subrange Types
Page 10
1.6. The Array Structure
Page 11
1.7. The Record Structure
Page 16
1.8. Variants of Record Structures
Page 20
1.9. The Set Structure
Page 23
1.10. Representation of Array, Record, and Set Structures
Page 29
1.10.1. Representation of Arrays
Page 30
1.10.2. Representation of Record Structures
Page 32
1.10.3. Representation of Sets
Page 33
1.11. The Sequential File Structure
Page 34
1.11.1. Elementary File Operators
Page 37
1.11.2. Files with Substructure
Page 39
1.11.3. Texts
Page 41
1.11.4. A File Editing Program
Page 49
2. Sorting
Page 56
2.1. Introduction
Page 56
2.2. Sorting Arrays
Page 59
2.2.1. Sorting by Straight Insertion
Page 60
2.2.2. Sorting by Straight Selection
Page 63
2.2.3. Sorting by Straight Exchange
Page 65
2.2.4. Insertion Sort by Diminishing Increment
Page 68
2.2.5. Tree Sort
Page 70
2.2.6. Partition Sort
Page 76
2.2.7. Finding the Median
Page 82
2.2.8. A Comparison of Array Sorting Methods
Page 84
2.3. Sorting Sequential Files
Page 87
2.3.1. Straight Merging
Page 87
2.3.2. Natural Merging
Page 92
2.3.3. Balanced Multiway Merging
Page 99
2.3.4. Polyphase Sort
Page 104
2.3.5. Distribution of Initial Runs
Page 116
3. Recursive Algorithms
Page 125
3.1. Introduction
Page 125
3.2. When Not to Use Recursion
Page 127
3.3. Two Examples of Recursive Programs
Page 130
3.4. Backtracking Algorithms
Page 137
3.5. The Eight Queens Problem
Page 143
3.6. The Stable Marriage Problem
Page 148
3.7. The Optimal Selection Problem
Page 154
4. Dynamic Information Structures
Page 162
4.1. Recursive Data Types
Page 162
4.2. Pointers or References
Page 166
4.3. Linear Lists
Page 171
4.3.1. Basic Operations
Page 171
4.3.2. Ordered Lists and Re-organizing Lists
Page 174
4.3.3. An Application: Topological Sorting
Page 182
4.4. Tree Structures
Page 189
4.4.1. Basic Concepts and Definitions
Page 189
4.4.2. Basic Operations on Binary Trees
Page 198
4.4.3. Tree Search and Insertion
Page 201
4.4.4. Tree Deletion
Page 210
4.4.5. Analysis of Tree Search and Insertion
Page 211
4.4.6. Balanced Trees
Page 215
4.4.7. Balanced Tree Insertion
Page 216
4.4.8. Balanced Tree Deletion
Page 222
4.4.9. Optimal Search Trees
Page 226
4.4.10. Displaying a Tree Structure
Page 232
4.5. Multiway Trees
Page 242
4.5.1. B-Trees
Page 245
4.5.2. Binary B-Trees
Page 257
4.6. Key Transformations (Hashing)
Page 264
4.6.1. Choice of a Transformation Function
Page 266
4.6.2. Collision Handling
Page 266
4.6.3. Analysis of Key Transformation
Page 271
5. Language Structures and Compilers
Page 280
5.1. Language Definition and Structure
Page 280
5.2. Sentence Analysis
Page 283
5.3. Constructing a Syntax Graph
Page 288
5.4. Constructing a Parser for a Given Syntax
Page 291
5.5. Constructing a Table-Driven Parsing Program
Page 295
5.6. A Translator from BNF into Parser-Driving Data Structures
Page 299
5.7. The Programming Language PL/0
Page 307
5.8. A Parser for PL/0
Page 311
5.9. Recovering from Syntactic Errors
Page 320
5.10. A PL/0 Processor
Page 331
5.11. Code Generation
Page 344
Appendices
A. The ASCII Character Set
Page 351
B. Pascal Syntax Diagrams
Page 352
Subject Index
Page 359
Index of Programs
Page 365

Edition Notes

Includes bibliographies and indexes.

Published in
Englewood Cliffs, N.J
Series
Prentice-Hall series in automatic computation.

Classifications

Dewey Decimal Class
001.6/42
Library of Congress
QA76.6 .W56, QA76.6

The Physical Object

Pagination
xvii, 366 p. :
Number of pages
366

Edition Identifiers

Open Library
OL5191055M
ISBN 10
0130224189
LCCN
75011599
OCLC/WorldCat
1324351
Wikidata
Q56740511
LibraryThing
282853
Goodreads
300093

Work Identifiers

Work ID
OL2589587W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Loading indicator
Loading carousel
Loading indicator
Loading carousel

History

Download catalog record: RDF / JSON
February 14, 2020 Edited by MARC Bot remove fake subjects
October 25, 2012 Edited by ImportBot Added subject 'In library'
December 13, 2011 Edited by ImportBot import new book
April 28, 2010 Edited by Open Library Bot Linked existing covers to the work.
December 10, 2009 Created by WorkBot add works page