Research Catalog

Reusable data structures for C

Title
Reusable data structures for C / Roger Sessions.
Author
Sessions, Roger.
Publication
  • Englewood Cliffs, N.J. : Prentice Hall, [1989]
  • ©1989.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
Request for On-site UseRequest Scan
How do I pick up this item and when will it be ready?
TextUse in library QA76.73.C15 S45 1989Off-site

Details

Description
vii, 166 pages : illustrations; 24 cm.
Summary
This book shows how common data structures can be generalized and implemented as reusable and highly reliable code packages. The data structures are explained in depth and implemented as generalized packages, which are used to solve problems typical of those faced by professional programmers. Readers should have a familiarity with C, but no background in data structures is required.
Series Statement
Prentice Hall software series
Uniform Title
Prentice-Hall software series
Subject
  • C (Computer program language)
  • Data structures (Computer science)
  • Programming languages (Electronic computers)
  • Computer programming
  • computer programming
  • C Programmiersprache
  • Datenstruktur
  • Softwarewiederverwendung
Note
  • Includes index.
Bibliography (note)
  • Includes index.
Contents
Introduction -- Program correctness -- Introduction to package programming -- Run time context resolution -- Run time structure resolution -- Performance -- More on linked lists -- Caches revisited -- Queues -- Stacks -- Recursives -- Implementation notes -- Package design rules.
ISBN
  • 0137790341
  • 9780137790340
LCCN
88038498
OCLC
  • ocm18878390
  • 18878390
  • SCSB-1732815
Owning Institutions
Princeton University Library