Data structures, algorithms, and program style using C / James F. Korsh, Leonard J. Garrett.
By: Korsh, James F
.
Contributor(s): Garrett, Leonard J.
Material type: 
BookPublisher: Boston : PWS-KENT Pub. Co., c1988Description: xvi, 590 p. : ill. ; 24 cm. + hbk.ISBN: 087150099X.Subject(s): C (Computer program language) | Data structures (Computer science) | Computer algorithmsDDC classification: 005.133 KOR | Item type | Current library | Call number | Copy number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
| General Lending | MTU Bishopstown Library Lending | 005.133 KOR (Browse shelf(Opens below)) | 1 | Available | 00156424 |
Browsing MTU Bishopstown Library shelves, Shelving location: Lending Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 005.133 KIN C programming : a modern approach / | 005.133 KOC PPK on JavaScript / | 005.133 KOE Ruminations on C++ : a decade of programming insight and experience / | 005.133 KOR Data structures, algorithms, and program style using C / | 005.133 KRU Data structures and program design in C / | 005.133 KRU Data structures and program design in C / | 005.133 LAF Advanced Java : idioms, pitfalls, styles, and programming tips / |
Enhanced descriptions from Syndetics:
Textbook for undergraduate students familiar with a high-level language such as Pascal. A course in discrete mathematics is desirable, but relevant background in relations, probability, and other topics is summarized in the appendixes for those who need it. A textbook for a college course in programming as well as data structures. Annotation copyrighted by Book News, Inc., Portland, OR
Bibliography: (pages 580-583) and indexes.
Fundamentals -- Programming structure -- Records, arrays and pointers -- Lists -- Introduction to recursion, stacks and queues -- Packaging data abstractions -- More complete lists -- Trees -- Applications -- Introduction to searching and sorting -- More searching, insertion and deletion -- Files -- Topological sorting an archetypal solution -- Huffman coding and optimal and nearly optimal binary search trees -- Some pointers on storage management.