| Preface |
| Acknowledgments |
| Discrete Structures in Mathematics / Part I： |
| Set Theory / Chapter 1.： |
| Basic Definitions / 1a.： |
| Indexed Sets / 1b.： |
| Complement of a Set / 1c.： |
| Algebra of Sets / 1d.： |
| Algebra of Sets as an Axiomatic Theory / 1e.： |
| Venn Diagrams / 1f.： |
| The Ordered Pair and Related Concepts / 1g.： |
| Permutations and Combinations / 1h.： |
| Notes |
| Exercises |
| Functions and Relations / Chapter 2.： |
| Functions / 2a.： |
| Boolean Functions and Forms / 2b.： |
| Applications of Boolean Functions / 2c.： |
| Relations / 2d.： |
| The Equivalence Relation / 2e.： |
| Ordering Relations / 2f.： |
| Lattices / 2g.： |
| Abstract Algebras / 2h.： |
| Graph Theory / Chapter 3.： |
| Diagrams and Graphs / 3a.： |
| Basic Definitions in the Theory of Digraphs / 3b.： |
| Digraphs, Matrices, and Relations / 3c.： |
| Connectedness in a Digraph / 3d.： |
| Trees / 3e.： |
| Linear Formulas of Digraphs / 3f.： |
| Isomorphism of Digraphs / 3g.： |
| Planar Graphs / 3h.： |
| Algebras and Strings / Chapter 4.： |
| Algebraic Structures / 4a.： |
| Group Codes / 4b.： |
| Algebra of Strings / 4c.： |
| Markov Algorithms / 4d.： |
| Languages and Grammars / 4e.： |
| Languages and Automata / 4f.： |
| Applications of Structures / Part II： |
| Trees as Grammatic Markers / Chapter 5.： |
| Pushdown Stores / 5b.： |
| Traversal of B-Trees / 5c.： |
| Subtree Isomorphism / 5d.： |
| Prefix, Postfix, and Infix Formulas / 5e.： |
| Sort Trees and Dictionaries / 5f.： |
| Decision Trees and Decision Tables / 5g.： |
| Paths and Cycles in Digraphs / Chapter 6： |
| Shortest Path Problems / 6a.： |
| Cycles / 6b.： |
| A Scheduling Problem / 6c.： |
| Critical Path Scheduling / 6d.： |
| Digraphs of Programs / Chapter 7.： |
| Flowchart Digraphs / 7a.： |
| Detection of Programming Errors / 7b.： |
| Segmentation of Programs / 7c.： |
| Automatic Flowcharting / 7d.： |
| Other Applications of Graphs / Chapter 8.： |
| Flow Problems / 8a.： |
| Graphs in Chemistry / 8b.： |
| Graphs in Information Retrieval / 8c.： |
| Computer Representation of Structures / Part III： |
| Arrays / Chapter 9.： |
| Storage Media and Their Properties / 9a.： |
| Storage of Arrays / 9b.： |
| Sparse Matrices / 9c.： |
| Storage Allocation at Execution Time / 9d.： |
| Lists and List Structures / Chapter 10.： |
| Lists--Introductory Concepts / 10a.： |
| Sparse Matrices and Cross-Lists / 10b.： |
| Formats of List Elements / 10c.： |
| List Structures / 10d.： |
| Threaded and Symmetric Lists / 10e.： |
| Representation of Digraphs as List Structures / 10f.： |
| Variable Length List Elements / 10g.： |
| Management of List Stores / 10h.： |
| PL/1-Type Data Structures / 10i.： |
| Organization of Files / Chapter 11.： |
| Records and Files / 11a.： |
| Indexed Files / 11b.： |
| Scatter Storage Techniques / 11c.： |
| Sorting / 11d.： |
| Magnetic Tape Files / 11e.： |
| Tape Sorting / 11f.： |
| Files and Disks / 11g.： |
| Application Studies / Chapter 12.： |
| Precedence Grammars / 12a.： |
| Radix Sorting / 12b.： |
| Symbolic Differentiation / 12c.： |
| K-Trees and Cycles / 12d.： |
| Scheduling Networks / 12e.： |
| Solutions to Selected Exercises |
| Bibliography |
| Index |
| Preface |
| Acknowledgments |
| Discrete Structures in Mathematics / Part I： |
図書
