|
|
|
|
| LEADER |
00000cam a2200000 i 4500 |
| 001 |
SCIDIR_ocn892068779 |
| 003 |
OCoLC |
| 005 |
20231120111802.0 |
| 006 |
m o d |
| 007 |
cr cnu---unuuu |
| 008 |
141003s1971 nyua ob 000 0 eng d |
| 040 |
|
|
|a OPELS
|b eng
|e rda
|e pn
|c OPELS
|d N$T
|d E7B
|d EBLCP
|d DEBSZ
|d OCLCQ
|d YDXCP
|d MERUC
|d OCLCQ
|d OCLCO
|d OCLCQ
|d UKAHL
|d OCLCQ
|d INARC
|d LUN
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|
| 015 |
|
|
|a GB7116886
|2 bnb
|
| 019 |
|
|
|a 898771740
|a 961490131
|a 1148788678
|
| 020 |
|
|
|a 9781483264721
|q (electronic bk.)
|
| 020 |
|
|
|a 1483264726
|q (electronic bk.)
|
| 020 |
|
|
|z 0120935503
|
| 020 |
|
|
|z 9780120935505
|
| 035 |
|
|
|a (OCoLC)892068779
|z (OCoLC)898771740
|z (OCoLC)961490131
|z (OCoLC)1148788678
|
| 050 |
|
4 |
|a QA76.5
|b .B46 1971eb
|
| 072 |
|
7 |
|a REF
|x 018000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 001.6/42
|2 22
|
| 084 |
|
|
|a 54.10
|2 bcl
|
| 084 |
|
|
|a SK 940
|2 rvk
|
| 084 |
|
|
|a ST 270
|2 rvk
|
| 084 |
|
|
|a ST 265
|2 rvk
|
| 100 |
1 |
|
|a Berztiss, Alfs T.
|
| 245 |
1 |
0 |
|a Data structures :
|b theory and practice /
|c A.T. Berztiss.
|
| 264 |
|
1 |
|a New York :
|b Academic Press,
|c [1971]
|
| 300 |
|
|
|a 1 online resource (xiii, 442 pages) :
|b illustrations
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Computer science and applied mathematics.
|
| 504 |
|
|
|a Includes bibliographical references (pages 415-429).
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a Front Cover; Data Structures: Theory and Practice; Copyright Page; Table of Contents; Preface; Acknowledgments; Part I: DISCRETE STRUCTURES IN MATHEMATICS; Chapter 1. Set Theory; 1a. Basic Definitions; 1b. Indexed Sets; 1c. Complement of a Set; 1d. Algebra of Sets; 1e. Algebra of Sets as an Axiomatic Theory; 1f. Venn Diagrams; 1g. The Ordered Pair and Related Concepts; 1h. Permutations and Combinations; Notes; Exercises; Chapter 2. Functions and Relations; 2a. Functions; 2b. Boolean Functions and Forms; 2c. Applications of Boolean Functions; 2d. Relations; 2e. The Equivalence Relation.
|
| 505 |
8 |
|
|a 2f. Ordering Relations2g. Lattices; 2h. Abstract Algebras; Notes; Exercises; Chapter 3. Graph Theory; 3a. Diagrams and Graphs; 3b. Basic Definitions in the Theory of Digraphs; 3c. Digraphs, Matrices, and Relations; 3d. Connectedness in a Digraph; 3e. Linear Formulas of Digraphs; 3f. Trees; 3g. Isomorphism of Digraphs; 3h. Planar Graphs; Notes; Exercises; Chapter 4. Strings; 4a. Algebraic Structures; 4b. Algebra of Strings; 4c. Markov Algorithms; 4d. Languages and Grammars; 4e. Languages and Automata; Notes; Exercises; Part II: APPLICATIONS OF STRUCTURES; Chapter 5. Trees.
|
| 505 |
8 |
|
|a 5a. Trees as Grammatic Markers5b. Representation of Prefix Formulas; 5c. Sort Trees and Dictionaries; 5d. Decision Trees and Decision Tables; Notes; Exercises; Chapter 6. Paths and Cycles in Digraphs; 6a. Shortest Path Problems; 6b. Cycles; 6c. A Scheduling Problem; 6d. Critical Path Scheduling; Notes; Exercises; Chapter 7. Digraphs of Programs; 7a. Flowchart Digraphs; 7b. Detection of Programming Errors; 7c. Segmentation of Programs; 7d. Automatic Flowcharting; Notes; Exercises; Chapter 8. Other Applications of Graphs; 8a. Flow Problems; 8b. Graphs in Chemistry.
|
| 505 |
8 |
|
|a 8c. Graphs in Information RetrievalNotes; Exercises; Part III: COMPUTER REPRESENTATION OF STRUCTURES; Chapter 9. Arrays; 9a. Storage Media and Their Properties; 9b. Storage of Arrays; 9c. Sparse Matrices; 9d. Storage Allocation at Execution Time; Notes; Exercises; Chapter 10. Pushdown Stores, Lists and List Structures; 10a. Pushdown Stores; 10b. Prefix, Postfix, and Infix Formulas; 10c. Storage Levels for a Pushdown Store; 10d. Lists-Introductory Concepts; 10e. Formats of List Elements; 10f. List Structures; 10g. Threaded and Symmetric Lists; 10h. Representation of Digraphs as List Structures.
|
| 505 |
8 |
|
|a 10i. Multiword List Elements10j. Management of List Stores; 10k. PL/I-Type Data Structures; Notes; Exercises; Chapter 11. Organization of Files; 11a. Records and Files; 11b. Indexed Files; 11e. Scatter Storage Techniques; 11d. Sorting; 11e. Files and Secondary Storage; Notes; Exercises; Chapter 12. Programming Languages for Information Structures; 12a. List Processing Languages; 12b. String Processing Languages; 12c. Extension of General Purpose Languages; Notes; Solutions to Selected Exercises; Bibliography; Index.
|
| 650 |
|
0 |
|a Data structures (Computer science)
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
6 |
|a Structures de donn�ees (Informatique)
|0 (CaQQLa)201-0051595
|
| 650 |
|
6 |
|a Programmation (Informatique)
|0 (CaQQLa)201-0002014
|
| 650 |
|
7 |
|a computer programming.
|2 aat
|0 (CStmoGRI)aat300054641
|
| 650 |
|
7 |
|a REFERENCE
|x Questions & Answers.
|2 bisacsh
|
| 650 |
|
7 |
|a Computer programming
|2 fast
|0 (OCoLC)fst00872390
|
| 650 |
|
7 |
|a Data structures (Computer science)
|2 fast
|0 (OCoLC)fst00887978
|
| 650 |
|
7 |
|a Datenstruktur
|2 gnd
|0 (DE-588)4011146-5
|
| 650 |
1 |
7 |
|a Data-analyse.
|2 gtt
|
| 650 |
1 |
7 |
|a Wiskundige methoden.
|2 gtt
|
| 650 |
1 |
7 |
|a Sociale wetenschappen.
|2 gtt
|
| 650 |
|
7 |
|a Ordinateurs.
|x Programmation.
|2 ram
|
| 650 |
|
7 |
|a Structures de donn�ees (informatique)
|2 ram
|
| 776 |
0 |
8 |
|i Print version:
|a Berztiss, Alfs T.
|t Data structures
|z 0120935503
|w (DLC) 75137603
|w (OCoLC)153220
|
| 830 |
|
0 |
|a Computer science and applied mathematics.
|
| 856 |
4 |
0 |
|u https://sciencedirect.uam.elogim.com/science/book/9780120935505
|z Texto completo
|
