Data structures : theory and practice / A. T. Berztiss.

Format:

Book

Author/Creator:

Berztiss, Alfs T.

Series:

Computer science and applied mathematics

Language:

English

Subjects (All):

Data structures (Computer science).

Computer programming.

Physical Description:

xv, 586 pages : illustrations ; 24 cm.

Edition:

Second edition.

Place of Publication:

New York : Academic Press, [1975]

Contents:

Part I Discrete Structures in Mathematics

Chapter 1. Set Theory

1a. Basic Definitions 3

1b. Indexed Sets 7

1c. Complement of a Set 10

1d. Algebra of Sets 13

1e. Algebra of Sets as an Axiomatic Theory 15

1f. Venn Diagrams 23

1g. The Ordered Pair and Related Concepts 25

1h. Permutations and Combinations 28

Chapter 2. Functions and Relations

2a. Functions 49

2b. Boolean Functions and Forms 53

2c. Applications of Boolean Functions 63

2d. Relations 83

2e. The Equivalence Relation 86

2f. Ordering Relations 89

2g. Lattices 95

2h. Abstract Algebras 100

Chapter 3. Graph Theory

3a. Diagrams and Graphs 119

3b. Basic Definitions in the Theory of Digraphs 122

3c. Digraphs, Matrices, and Relations 129

3d. Connectedness in a Digraph 138

3e. Trees 141

3f. Linear Formulas of Digraphs 146

3g. Isomorphism of Digraphs 153

3h. Planar Graphs 157

Chapter 4. Algebras and Strings

4a. Algebraic Structures 169

4b. Group Codes 176

4c. Algebra of Strings 184

4d. Markov Algorithms 187

4e. Languages and Grammars 193

4f. Languages and Automata 199

Part II Applications of Structures

Chapter 5. Trees

5a. Trees as Grammatic Markers 213

5b. Pushdown Stores 219

5c. Traversal of B-Trees 225

5d. Subtree Isomorphism 230

5e. Prefix, Postfix, and Infix Formulas 232

5f. Sort Trees and Dictionaries 239

5g. Decision Trees and Decision Tables 252

Chapter 6 Paths and Cycles in Digraphs

6a. Shortest Path Problems 269

6b. Cycles 284

6c. A Scheduling Problem 300

6d. Critical Path Scheduling 303

Chapter 7. Digraphs of Programs

7a. Flowchart Digraphs 315

7b. Detection of Programming Errors 319

7c. Segmentation of Programs 320

7d. Automatic Flowcharting 323

Chapter 8. Other Applications of Graphs

8a. Flow Problems 331

8b. Graphs in Chemistry 339

8c. Graphs in Information Retrieval 344

Part III Computer Representation of Structures

Chapter 9. Arrays

9a. Storage Media and Their Properties 353

9b. Storage of Arrays 357

9c. Sparse Matrices 359

9d. Storage Allocation at Execution Time 365

Chapter 10. Lists and List Structures

10a. Lists

Introductory Concepts 377

10b. Sparse Matrices and Cross-Lists 388

10c. Formats of List Elements 391

10d. List Structures 396

10e. Threaded and Symmetric Lists 404

10f. Representation of Digraphs as List Structures 413

10g. Variable Length List Elements 415

10h. Management of List Stores 416

10i. PL/1-Type Data Structures 420

Chapter 11. Organization of Files

11a. Records and Files 431

11b. Indexed Files 435

11c. Scatter Storage Techniques 438

11d. Sorting 456

11e. Magnetic Tape Files 473

11f. Tape Sorting 475

11g. Files and Disks 485

Chapter 12. Application Studies

12a. Precedence Grammars 501

12b. Radix Sorting 506

12c. Symbolic Differentiation 509

12d. K-Trees and Cycles 517

12e. Scheduling Networks 524.

Notes:

Includes index.

Bibliography: pages 555-572.

ISBN:

012093552X

OCLC:

1144661