The code below is given in c++, you need to convert it to C Please make sure after converting the code does the same thing as it did before. // C++ program // SCAN Disk Scheduling algorithm #include using namespace std; int size = 8; int disk_size = 200; void SCAN(int arr[], int head, string direction) { int seek_count = 0; int distance, cur_track; vector left, right; vector seek_sequence; // appending end values // which has to be visited // before reversing the direction if (direction == "left") left.push_back(0); else if (direction == "right") right.push_back(disk_size - 1); for (int i = 0; i< size; i++) { if (arrli) < head) left.push_back(arr[i)); if (arrli) > head) right.push_back(arr[i]); // sorting left and right vectors std:sort(left.begin(), left.end(); std:sort(right.begin(), right.end()); // run the while loop two times. // one by one scanning right // and left of the head int run = 2; while (run--){
The code below is given in c++, you need to convert it to C Please make sure after converting the code does the same thing as it did before. // C++ program // SCAN Disk Scheduling algorithm #include using namespace std; int size = 8; int disk_size = 200; void SCAN(int arr[], int head, string direction) { int seek_count = 0; int distance, cur_track; vector left, right; vector seek_sequence; // appending end values // which has to be visited // before reversing the direction if (direction == "left") left.push_back(0); else if (direction == "right") right.push_back(disk_size - 1); for (int i = 0; i< size; i++) { if (arrli) < head) left.push_back(arr[i)); if (arrli) > head) right.push_back(arr[i]); // sorting left and right vectors std:sort(left.begin(), left.end(); std:sort(right.begin(), right.end()); // run the while loop two times. // one by one scanning right // and left of the head int run = 2; while (run--){
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![The code below is given in c++ , you need to convert it to C
Please make sure after converting the code does the same thing as it did before.
// C++ program
// SCAN Disk Scheduling algorithm
#include <bits/stdc++.h>
using namespace std;
int size = 8;
int disk_size = 20%3;
void SCAN(int arr[], int head, string direction)
{
int seek_count = 0;
int distance, cur_track;
vector<int> left, right;
vector<int> seek_sequence;
// appending end values
// which has to be visited
// before reversing the direction
if (direction == "left")
left.push_back(0);
else if (direction == "right")
right.push_back(disk_size - 1);
for (int i = 0; i < size; i++) {
if (arrli) < head)
left.push_back(arr[i]);
if (arrli) > head)
right.push_back(arr[i]);
}
// sorting left and right vectors
std:sort(left.begin(), left.end());
std:sort(right.begin(), right.end());
// run the while loop two times.
// one by one scanning right
// and left of the head
int run = 2;
while (run--){](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc619c0a2-089e-4690-9176-544091848ea2%2F1c71ecf8-261b-4eec-9a99-c2c21033c154%2Fcz9nx0k_processed.jpeg&w=3840&q=75)
Transcribed Image Text:The code below is given in c++ , you need to convert it to C
Please make sure after converting the code does the same thing as it did before.
// C++ program
// SCAN Disk Scheduling algorithm
#include <bits/stdc++.h>
using namespace std;
int size = 8;
int disk_size = 20%3;
void SCAN(int arr[], int head, string direction)
{
int seek_count = 0;
int distance, cur_track;
vector<int> left, right;
vector<int> seek_sequence;
// appending end values
// which has to be visited
// before reversing the direction
if (direction == "left")
left.push_back(0);
else if (direction == "right")
right.push_back(disk_size - 1);
for (int i = 0; i < size; i++) {
if (arrli) < head)
left.push_back(arr[i]);
if (arrli) > head)
right.push_back(arr[i]);
}
// sorting left and right vectors
std:sort(left.begin(), left.end());
std:sort(right.begin(), right.end());
// run the while loop two times.
// one by one scanning right
// and left of the head
int run = 2;
while (run--){
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY