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 con- structed 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 con- structed 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 contained 40 tracks , each of which is divided into sectors capa- ble of holding 256 characters . How many char- acters would the disk hold if each track were divided into 10 sectors ? What if each track con- tained 16 sectors ...
... disk contained 40 tracks , each of which is divided into sectors capa- ble of holding 256 characters . How many char- acters would the disk hold if each track were divided into 10 sectors ? What if each track con- tained 16 sectors ...
Contents
PART | 1 |
Chapter 2 | 61 |
PART TWO The HumanMachine Interface | 95 |
Copyright | |
9 other sections not shown
Other editions - View all
Common terms and phrases
activities actually algorithm Alice allow application application software ASCII assign bit patterns block bottom pointer bulk storage called Carol Chapter COBOL computer science concept consider consists contains current entry database declare search disk employee example execution Figure goal hexadecimal identified implemented input insertion sort instruction integer key field linked list machine language machine's main memory memory cells modified module move node notation operating system parity bit password perform pivot entry position problem produce program counter programming languages pseudocode Questions/Exercises queue quick sort record recursive represented request resource result retrieve routine schedule search a failure search a success search tree Section segment sequence sequential file solution solving sort algorithm stack statement step stored string subprogram syntax tape target value task technique time-sharing top pointer Turing machine two's complement