Data structures : (Record no. 4170)

MARC details
000 -LEADER
fixed length control field 03793 am a22002893i 4500
001 - CONTROL NUMBER
control field 007678283
003 - CONTROL NUMBER IDENTIFIER
control field ‫‪EG-GaU‬‬
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20220306113951.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 710804s1971 enka | 000 | eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0120935503 :
Terms of availability £6.75
040 ## - CATALOGING SOURCE
Original cataloging agency Uk
Transcribing agency Uk
Modifying agency ‫‪EG-GaU‬‬
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 001.64044
Edition number 22
Item number B.A.D
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Berztiss, Alfs Teodors.
Relator term author
9 (RLIN) 25475
245 10 - TITLE STATEMENT
Title Data structures :
Remainder of title theory and practice /
Statement of responsibility, etc. A.T. Berztiss.
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture New York ;
-- London :
Name of producer, publisher, distributor, manufacturer Academic Press,
Date of production, publication, distribution, manufacture, or copyright notice 1971.
300 ## - PHYSICAL DESCRIPTION
Extent xiii,442 pages :
Other physical details illustrations ;
Dimensions 24cm.
336 ## - CONTENT TYPE
Content type term text
Source rdacontent
337 ## - MEDIA TYPE
Media type term unmediated
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term volume
Source rdacarrier
490 0# - SERIES STATEMENT
Series statement Computer science and applied mathematics
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note bibl p415-429.
505 #0 - FORMATTED CONTENTS NOTE
Formatted contents note 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. 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. 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. 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. 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.<br/>
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Data structures (Computer science)
9 (RLIN) 1256
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer programming.
9 (RLIN) 1286
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term Digital computer systems
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Dewey Decimal Classification
Koha item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Current library Date acquired Source of acquisition Total Checkouts Full call number Barcode Date last seen Date last checked out Price effective from Koha item type
    Dewey Decimal Classification     Media and mass communication Library Media and mass communication Library 03/06/2022 Donation 1 001.64044 B.A.D E0000645 11/29/2023 10/31/2023 03/06/2022 Books