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

csc306 final

QuestionAnswer
________ is the dynamic storage-allocation algorithm which results in the largest leftover hole in memory. Best fit
Consider a logical address with a page size of 8 KB. How many bits must be used to represent the page offset in the logical address? 13
Consider a logical address with 18 bits used to represent an entry in a conventional page table. How many entries are in the conventional page table? 262144
Given the logical address 0xAEF9 (in hexadecimal) with a page size of 256 bytes, what is the page number? 0xAE
Consider a 32-bit address for a two-level paging system with an 8 KB page size. The outer page table has 1024 entries. How many bits are used to represent the second-level page table? 9
In systems that support virtual memory, ____. physical memory is separated from logical memory.
Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string? 8
1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string? 3,4,2
A mount point is _____. the location within the file structure where the file system is to be attached.
The surface of a magnetic disk platter is divided into ____. tracks
The SSTF scheduling algorithm ____. services the request with the minimum seek time
116, 22, 3, 11, 75, 185, 100, 87. Using the SCAN scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders? 100 - 116 - 185 - 87 - 75 - 22 - 11 - 3
116, 22, 3, 11, 75, 185, 100, 87. Using the FCFS scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders? 116 - 22 - 3 - 11 - 75 - 185 - 100 - 87
116, 22, 3, 11, 75, 185, 100, 87. Using the SSTF scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders? 87 - 75 - 100 - 116 - 185 - 22 - 11 - 3
116, 22, 3, 11, 75, 185, 100, 87. Using the C-SCAN scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders? 100 - 116 - 185 - 3 - 11 - 22 - 75 - 87
Low-level formatting ____. divides a disk into sections that the disk controller can read and write
Host-attached storage is ____. accessed via local I/O ports
Which of the following disk head scheduling algorithms does not take into account the current position of the disk head? FCFS
What are the two components of positioning time? seek time + rotational latency
A RAID structure ____. is primarily used to ensure higher data reliability
Created by: 532001743
 

 



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