Suppose you have a disk that has 400 cylinders numbered 0 to 399. The disk head is currently at cylinder 154 NOTE: the previous serviced request was at 28, that should tell you the direction!) (note: C-SCAN is implemented to service requests in the direction from 0-> 399) The queue for requests to be serviced looks as follows: 94, 283, 38, 112, 14, 324, 65, 267, Given this information, for the following algorithms:a) SSTFb) C-SCANC) FCFSD) SCANGive the order which the requests in the queue will be processed for each algorithm and calculate the TOTAL distance in cylinders that the read head traveled to satisfy all

Suppose you have a disk that has 400 cylinders numbered 0 to 399. The disk head is currently at cylinder 154 NOTE: the previous serviced request was at 28, that should tell you the direction!) (note: C-SCAN is implemented to service requests in the direction from 0-> 399) The queue for requests to be serviced looks as follows: 94, 283, 38, 112, 14, 324, 65, 267, Given this information, for the following algorithms:a) SSTFb) C-SCANC) FCFSD) SCANGive the order which the requests in the queue will be processed for each algorithm and calculate the TOTAL distance in cylinders that the read head traveled to satisfy all

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Suppose there is a circular queue, CQ of size 6 elements. For each of the following circular queue…

A: The below are the outputs of a series of operations on a circular queue along with the front index,…

Q: Suppose you are given a partially-filled sorted linked list and a partially-filled unsorted linked…

A: Linked list is a linear data structure where there are nodes which contain data and a pointer to the…

Q: What will be the time complexity (A or B) for the usual operations on a Queue, if we will implement…

A: The First-In-First-Out (FIFO) principle governs the linear data structure known as a queue, in which…

Q: Therefore, I want to find out how long it takes to enqueue and dequeue a queue that consists of two…

A: (Introduction): Two stack-based queue mechanisms exist: Costing push operation I'll respond by…

Q: Implement the three self-organizing list heuristics: Count – Whenever a record is accessed it may…

A: Answer: main.cpp#include <iostream>#include <string>#include <fstream>#include…

Q: Combining sorted queues (2.2.14). Make a static function that takes two sorted queues as input and…

A: This problem essentially involves implementing two tasks using queues: 1. A function to merge two…

Q: 4. Write a recursive algorithm in pseudocode that finds the lowest common ancestor (LCA) of two…

A: The given below program is in java using the function lowest_common_ancestor(Node p, Node q).

Q: If you have a stack that contains 3000 integers, and you need to see if it contains the number 5678,…

A: This is based on linear data structure. Stack follows last in first out method.

Q: 10. Given a doubly linked list. Reverse it using recursion. Here we assume, we keep self.head…

A: In this question we have to implement a python code for given doubly linked list to reverse it using…

Q: Suppose we need to write an efficient program to store N employee records for ABC Inc where each…

A: This inquiry examines how effectively various data structures store and retrieve employee records…

Q: What is the worse case run time for following algorithm? CountDuplicatePairs This algorithm counts…

A: Algorithm: An algorithm would be characterized as a process used to carry out…

Q: Apply algorithm 4.3.2 in P.155 with n=6 and A=(3,5,4,1,3,2). Draw only the right half of the…

A: I'm providing the answer for the above question. I hope this will be helpful for you.

Q: return result (a) Assume that you have Y cores on a multicore processor to run Mergesort. Assuming…

A: The given problem delves into the analysis of the Mergesort algorithm, a classic divide-and-conquer…

Q: n=6 and A=(3,5,4,1,3,2). Draw only the right half of the corresponding walkthrough as shown in…

A: n=6 and A=(3,5,4,1,3,2). Draw only the right half of the corresponding walkthrough as shown in…

Question

Suppose you have a disk that has 400 cylinders numbered 0 to 399. The disk
head is currently at cylinder 154 NOTE: the previous serviced request was at 28,
that should tell you the direction!) (note: C-SCAN is implemented to service
requests in the direction from 0 -> 399) The queue for requests to be serviced
looks as follows: 94, 283, 38, 112, 14, 324, 65, 267, Given this information, for
the following algorithms:a) SSTFb) C-SCANC) FCFSD) SCANGive the order
which the requests in the queue will be processed for each algorithm and
calculate the TOTAL distance in cylinders that the read head traveled to satisfy all
of the remaining requests.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Define scheduling algorithm:

VIEW

Step 2: Answer:

VIEW

Solution

VIEW

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

A group of students writes their names and unique student ID numbers on sheets of paper. The sheets are then randomly placed in a stack. Their teacher is looking to see if a specific ID number is included in the stack. Which of the following best describes whether their teacher should use a linear or a binary search? a. The teacher could use either type of search though the binary search is likely to be faster b. The teacher could use either type of search though the linear search is likely to be faster c. Neither type of search will work since the data is numeric d. Only the linear search will work since the data has not been sorted
Write a BCPL program that reads a sequence of strings typed by the user and creates a linked list containing them all. The numbers will all be positive. An input of END will be used to mark the end of the input sequence. Once the whole linked list has been read, print out its contents, one string per line. Remember you will need to implement and use strdup() Include a transcript showing a successful run of your program.
Please answer this question- Implement Floyd's algorithm for the Shortest Path on your system, and study its performance using different graphs. Side note- Below I have attached Floyd's Algorithm for Shortest Paths. please use java language for coding java file - should start with your Last Name, Like SmithClubApp, PetrowskiTravelLogApp, for your class short paragraph should include- -description of the java file -what it does? -what is the input data? expected output, samples of both
Write a BCPL program that reads a sequence of strings typed by the user and creates a linked list containing them all. But there will be some special command words. These should be obeyed but not inserted into the list An input of END will be used to mark the end of the input sequence. The progrm should stop. An input of ALL means that the whole list should be printed. It is perfectly OK for the list to come out backwards. An input of DELETE means that the next word is to be removed from the list and its memory (for the link object and for the string) must be recycled with freevec (even though freevec doesn't do anything yet). Remember you will need to implement and use strdup(). Remember that strings are packed, four bytes per word, into an array. You use the "byte N of S" syntax to access the individual bytes. Also remember that an extra 0 byte is added to mark the end of the string. Example run: $ run hw4 Enter the strings and deletions: > hello > this > program > works…
Build a Binary Search Tree with the given input order. You must show step by step process of inserting the inputs including both recursive calls and tree diagrams for each step. [ refer to the Insertitem function of Lecture 10 slides to get an idea of doing this.] N.B: Unique Input orders for each student to build the tree are given on a separate file. Write down the input order on your answer script before answering the question. You must use the assigned input order. Do not change the order. TREE INPUT: 4,1,9,3,2,5,6,8,7
Implement MERGE-SORT() algorithm that reads from a file named “inputHW02.txt” a list of double numbers (max =3,000,000 numbers), sorts those numbers and indicates time consumption. This programming question will address theadvantage of using iteration loops over recursive calls as well as using INSERTION-SORT() as a procedure in MERGESORT().Your program must perform the following actions:1. Opens the given file name and reads all double numbers. For simplicity, we assume this file only containsnumbers and nothing else.2. Implements the function INSERTION-SORT() that only sort an array of maximum 25 numbers. The idea is thatINSERTION-SORT() will be used as a sub-procedure to sort any sub-array when its size is small enough.3. Four versions of MERGE-SORT() namelya. MERGE-SORT-A(): Using recursive calls and NO INSERTION-SORT() as a sub-procedureb. MERGE-SORT-B(): Using ITERATIVE loops (i.e, NO recursion) and NO INSERTION-SORT() as a subprocedure.c. MERGE-SORT-C(): Using recursive calls…
Apply quicksort to sort the list E, X, E, R, C, I, S, E in alphabetical order.Draw the tree of the recursive calls made.
Implement the following algorithms in Java:The pseudocode for QUICKSORT introduced in (slide 14), includingprocedure PARTITION implementing right-most element pivot selection (slide 13). Slide 13:PARTITION(A,p,r) x := A[r] i := p – 1 for j = p to r - 1 if A[j]  x i := i + 1 SWAP(A[i],A[j]) SWAP(A[i+1],A[r]) return i + 1 Slide 14:QUICKSORT(A,p,r) if p < r q := PARTITION(A,p,r) QUICKSORT(A,p,q-1) QUICKSORT(A,q+1,r)
Consider the following variation on MergeSort: instead of dividing a list (say, of integers) evenly (that is, half and half or half and half plus 1) at all levels of recursion, we choose to divide a list this way - a left list that consists of exactly one integer and a right list that consists of the remaining integers. The time-complexity of this variation of MergeSort is: (a) O(n log n) (b) O(n²) (c) O(n) (d) none of the above