In the C-SCAN disk scheduling algorithm, the disk arm is required to move in one direction only until it reaches the last track
1 answer:
You might be interested in
Answer:
Table for Area codes are not missing;
See Attachment for area codes and major city I used
This program will be implemented using c++ programming language.
// Comments are used for explanatory purposes
// Program starts here
#include <iostream>
using namespace std;
int main( )
{
// Declare Variable area_code
int area_code;
// Prompt response from user
cout<<Enter your area code: ";
cin<<"area_code;
// Start switch statement
switch (area_code) {
// Major city Albany has 1 area code: 229...
case 229:
cout<<"Albany\n";
break;
// Major city Atlanta has 4 area codes: 404, 470 678 and 770
case 404:
case 470:
case 678:
case 770:
cout<<"Atlanta\n";
break;
//Major city Columbus has 2 area code:706 and 762...
case 706:
case 762:
cout<<"Columbus\n";
break;
//Major city Macon has 1 area code: 478...
case 478:
cout<<"Macon\n";
break;
//Major city Savannah has 1 area code: 912..
case 912:
cout<<"Savannah\n";
break;
default:
cout<<"Area code not recognized\n";
}
return 0;
}
// End of Program
The syntax used for the above program is; om
