Data structures for business programming / Judith Knapp
Material type:
- 394390768
- QA 76.9 .K53 1989

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Annex Relegation Room | Information Technology | GC QA 76.9 .K53 1989 (Browse shelf(Opens below)) | c.1 | Available | NULIB000002569 |
Includes bibliographical references and index.
1. Introducing data structure -- 2. Files and their structures -- 3. Arrays, sorting and searching -- 4. Linked lists -- 5. Stacks, queues, and deques -- 6. Directories, inverted files and hashing -- 7. Binary trees, multi-way trees and b-trees.
This text attempts to simplify the complex topic of data structures and the corresponding algorithms used for programming applications. Since CIS students can usually elect to take one or several programming languages- such as COBOL, PASCAL, FORTRAN, or BASIC-this text does not include language-specific examples beyond those few shown in the first chapter.
There are no comments on this title.