Data structure techniques (Record no. 191277)

000 -LEADER
fixed length control field 00601pam a2200181 i 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 781221s1980 maua b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 0201072564
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 001.642
Item number S8D2
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Standish, Thomas A.
9 (RLIN) 302200
245 10 - TITLE STATEMENT
Title Data structure techniques
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc Reading, Mass.
Name of publisher, distributor, etc Addison-Wesley Publishing Company
Date of publication, distribution, etc 1980
300 ## - PHYSICAL DESCRIPTION
Extent xvi, 447 p.
Other physical details ill.
Dimensions 24 cm.
490 0# - SERIES STATEMENT
Series statement Addison-Wesley Series in Computer Science
500 ## - GENERAL NOTE
General note Includes index.
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Bibliography: p. [409]-434.
520 ## - SUMMARY, ETC.
Summary, etc This book is about the creation and analysis of efficient data structures. It covers: the primitive node structure; asymptotic notation for mathematically discussing performance characteristics; built-in arrays; list structures built from either nodes or arrays; iterators as an abstract model of enumerating the items in a sequence; stacks and queues for computing with last-in/first-out and first-in/first-out orderings; binary and general tree structures for searching or representing hierarchical relationships; min and max heaps for representing ordering based on priorities; graph structures for representing more general relationships between data elements; hash tables for the efficient retrieval of strings and other objects; and finally trade-offs between the structures, and strategies for picking the most appropriate ones. To understand the material in this book you should be comfortable enough in a programming language to be able to work with and write your own variables, arithmetic expressions, if-else conditions, loops, subroutines (also known as functions), pointers (also known as references or object handles), structures (also known as records or classes), simple input and output, and simple recursion. Because many different languages approach the construction of data structures differently, we use pseudo-code so that you can translate the code into your own language.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data structures (Computer science)
9 (RLIN) 302201
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Item type Books
Holdings
Withdrawn status Lost status Damaged status Not for loan Collection code Permanent location Current location Shelving location Date acquired Source of acquisition Full call number Barcode Date last seen Koha item type
        Non-fiction Vikram Sarabhai Library Vikram Sarabhai Library General Stacks 20/10/2014 Recd. as gratis from Computer Centre Library 001.642 S8D2 186082 20/10/2014 Books

Powered by Koha