- We will send in 10–14 business days.
/images/books/3590176/9780471605218.jpg)
- Author: Alan L Tharp
- Publisher: John Wiley & Sons, Inc.
- ISBN-10: 0471605212
- ISBN-13: 9780471605218
- Format: 19.3 x 23.4 x 2.4 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
Introduces the many and powerful data structures for representing information physically (in contrast to a database management system that represents information with logical structures). Covers specialized data structures, and explains how to choose the appropriate algorithm or data structure for the job at hand. The four sections treat primary file organizations, bit level and related structures, tree structures, and file sorting. Opening chapters cover sequential file organization, direct file organization, indexed sequential file organization, bits of information, secondary key retrieval, and bits and hashing. Following chapters cover binary tree structures, B-trees and derivatives, hashing techniques for expandable files, other tree structures, more on secondary key retrieval, sorting, and applying file structures. Contains pseudocode, or an outline in English, for most algorithms. Includes end-of-section questions, with answers to some. Extensively illustrated.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 22d.13:04:18
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Alan L Tharp
- Publisher: John Wiley & Sons, Inc.
- ISBN-10: 0471605212
- ISBN-13: 9780471605218
- Format: 19.3 x 23.4 x 2.4 cm, minkšti viršeliai
- Language: English English
Introduces the many and powerful data structures for representing information physically (in contrast to a database management system that represents information with logical structures). Covers specialized data structures, and explains how to choose the appropriate algorithm or data structure for the job at hand. The four sections treat primary file organizations, bit level and related structures, tree structures, and file sorting. Opening chapters cover sequential file organization, direct file organization, indexed sequential file organization, bits of information, secondary key retrieval, and bits and hashing. Following chapters cover binary tree structures, B-trees and derivatives, hashing techniques for expandable files, other tree structures, more on secondary key retrieval, sorting, and applying file structures. Contains pseudocode, or an outline in English, for most algorithms. Includes end-of-section questions, with answers to some. Extensively illustrated.
Reviews