Save
Upgrade to remove ads
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account. Your email address is only used to allow you to reset your password. See our Privacy Policy and Terms of Service.

Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't Know
Remaining cards (0)
Know
0:00
edit
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

OS Mod 5

QuestionAnswer
The main requirement of secondary storage to store a very large amount of data permanently Secondary Storage
An early secondary-storage medium with slow access time, currently used mainly for backup or transferring information Magnetic tape
Rigid metal or glass flat circular shapes covered with magnetic recording material in a disk system Platters
The logical division of a disk surface forming concentric circles Tracks
The subdivisions of a track on a magnetic disk Sectors
All the tracks on one drive that can be accessed without moving the heads in a movable-head system Cylinder
A problem that occurs if the read-write head contacts the disk surface, scraping the recording medium and destroying data Head crash
A structure indicating which files are on the disk, listing file names, lengths, locations, and other details Device directory
The smallest unit of transfer in a modern disk, usually 512 bytes Logical block
A reading/writing method where the density of bits per track is uniform, causing the drive to increase rotation speed as the head moves to inner tracks Constant Linear Velocity (CLV)
A reading/writing method where the number of bits per track is uniform, meaning the disk rotation stays constant Constant Angular Velocity (CAV)
The time it takes to move the read-write head to the correct track Seek time
The time it takes for the sector to rotate under the read-write head Latency time
The time it takes to actually move data between the disk and main memory Transfer time
The process of breaking a disk into the sectors that the computer can understand Physical formatting
The initial program that initializes all aspects of the system when a computer is powered up or rebooted Bootstrap program (or Boot block)
Areas on a disk that have become unreadable and not writable due to moving parts and small tolerances Bad blocks
A list maintained by the system to reuse space from deleted files for new files Free-space list
A free-space management technique where a single bit represents whether each block is free (0) or allocated (1) Bit Vector
A free-space management technique that links all free disk blocks together, keeping a pointer to the first free block Linked List
A modification of the free-list approach that stores the addresses of n free blocks in the first free block to find many free blocks quickly Grouping
A free-space approach that keeps the address of the first free block and the number of contiguous free blocks that follow it Counting
An allocation method requiring each file to occupy a set of sequential addresses on the disk Contiguous Allocation
An allocation method where each file is a linked list of scattered disk blocks, with the directory containing a pointer to the first and last blocks Linked-List Allocation
An important variation on the linked allocation method that uses a table with one entry for each disk block, indexed by block number File-Allocation Table (FAT)
An allocation method where pointers to a file's blocks are not scattered but are grouped in one location Indexed Allocation
An array of disk-block addresses specific to a file used in indexed allocation Index block
The simplest form of disk scheduling where requests are serviced in the exact order they arrive First-Come First-Served (FCFS) Scheduling
A disk scheduling algorithm that selects the request with the minimum seek time from the current head position Shortest Seek Time First (SSTF) Scheduling
A problem caused by SSTF scheduling where requests for farther tracks wait indefinitely due to a stream of closer requests Starvation
A scheduling algorithm where the head moves from one end of the disk to the other and reverses, also known as the elevator algorithm SCAN Scheduling
A variant of SCAN scheduling that moves the head from one end to the other, but immediately returns to the beginning without servicing requests on the return trip Circular-SCAN (C-SCAN) Scheduling
Versions of SCAN and C-SCAN scheduling where the head only moves as far as the last request in each direction before reversing LOOK and C-LOOK Scheduling
Created by: user-1931754
 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!
"Know" box contains:
Time elapsed:
Retries:
restart all cards