Computer Science: An OverviewGeneral literature -- Introductory and Survey. |
From inside the book
Results 1-3 of 40
Page 32
... disk units in which a thin continuously spinning disk with a magnetic coating , rather than a long strip of tape , is used to hold the data . Read / write heads are placed above and / or below the disk so that as the disk spins , the ...
... disk units in which a thin continuously spinning disk with a magnetic coating , rather than a long strip of tape , is used to hold the data . Read / write heads are placed above and / or below the disk so that as the disk spins , the ...
Page 33
... disks providing a total of 20 surfaces for data storage . Some disk packs are constructed to be easily removed from the disk units , while others are permanently mounted in the disk device . This permanent mounting reduces flexibility ...
... disks providing a total of 20 surfaces for data storage . Some disk packs are constructed to be easily removed from the disk units , while others are permanently mounted in the disk device . This permanent mounting reduces flexibility ...
Page 58
... disk pack with could you store on the tape ? a total of 16,650 tracks , each having a capacity 9. Suppose 1000 employee records , each consisting of 20,000 characters ? of 2000 characters , are to be stored on a 2400- 16. Here is a ...
... disk pack with could you store on the tape ? a total of 16,650 tracks , each having a capacity 9. Suppose 1000 employee records , each consisting of 20,000 characters ? of 2000 characters , are to be stored on a 2400- 16. Here is a ...
Contents
Introduction | 1 |
PART ONE Machine Architecture | 19 |
Data Manipulation | 61 |
Copyright | |
11 other sections not shown
Other editions - View all
Common terms and phrases
activities actually addition algorithm allow appear application approach assign associated begin binary block called cell Chapter characters collection communication complete consider consists contains contents database described devices discussed employee entry example execution expressed fact field Figure function given identified implemented indicated input insertion instruction involved language linked loop machine machine's major means memory memory cells module move node notation Note object obtain operating system organization original particular pattern perform pivot pointer position problem produce record refers relation represented request result retrieve routine sequence sequential single solution solving sort stack statement step storage stored string structure subprogram Suppose tape task technique terminal translator tree unit write