Date post: | 15-Jan-2016 |
Category: |
Documents |
Upload: | gerald-crabb |
View: | 221 times |
Download: | 2 times |
Slide 8-1 Copyright © 2003 Pearson Education, Inc.
Figure:
Computer Sciencean overview
EDITION 7
J. Glenn Brookshear
Slide 8-3 Copyright © 2003 Pearson Education, Inc.
Figure 8.1: The role of an operating system when accessing a file
Slide 8-4 Copyright © 2003 Pearson Education, Inc.
Figure 8.2: Maintaining a file’s order by means of a file allocation table
Slide 8-5 Copyright © 2003 Pearson Education, Inc.
Figure 8.3: A procedure for merging two sequential files
Slide 8-6 Copyright © 2003 Pearson Education, Inc.
Figure 8.4: Applying the merge algorithm (Letters are used to represent entire records. The particular letter indicates the value of the record’s key field.) (continued)
Slide 8-7 Copyright © 2003 Pearson Education, Inc.
Figure 8.4: Applying the merge algorithm (Letters are used to represent entire records. The particular letter indicates the value of the record’s key field.)
Slide 8-8 Copyright © 2003 Pearson Education, Inc.
Figure 8.5: The structure of a simple employee file implemented as a text file
Slide 8-9 Copyright © 2003 Pearson Education, Inc.
Figure 8.6: The first two bars of Beethoven’s Fifth Symphony
Slide 8-10 Copyright © 2003 Pearson Education, Inc.
Figure 8.7: Converting data from two’s complement notation into ASCII for storage in a text file (continued)
Slide 8-11 Copyright © 2003 Pearson Education, Inc.
Figure 8.7: Converting data from two’s complement notation into ASCII for storage in a text file
Slide 8-15 Copyright © 2003 Pearson Education, Inc.
Figure 8.11: The rudiments of a hashing system, in which each bucket holds those records that hash to that bucket number (continued)
Slide 8-16 Copyright © 2003 Pearson Education, Inc.
Figure 8.11: The rudiments of a hashing system, in which each bucket holds those records that hash to that bucket number
Slide 8-17 Copyright © 2003 Pearson Education, Inc.
Figure 8.12: Hashing the key field value 25X3Zto one of 40 buckets