(a) Suppose a disk drive has 3,000 cylinders, numbered 0 to 2,999. The drive is currently serving a request at cylinder 500 and the previous request was at cylinder 600. You are required to construct a queue of random pending requests in FIFO order (of minimum 10 inputs). Starting from the current head position, what is the difference between the total distance (in cylinders) that the disk are moves to satisfy all the pending requests for FCFS and SSTF.

I need the answer as soon as possible

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.

Please solve using C++

A JPJ department wants to maintain a database of up to 1800 license-plate numbers of people who receive frequent tickets so that it can be determined very quickly whether or not a given license plate is in the database. Speed of response is very important; efficient use of memory is also important, but not as important as speed of response. Which of the following data structures would be most appropriate for this task? A) a sorted linked list B) sorted array with 1800 entries hash table using open addressing with 1800 entries O D) a hash table using open addressing with 3600 entries

RC4 has a secret internal state which is a permutation of all the possible values of the vector S and the two indices i and j a. Using a straightforward scheme to store the internal state, how many bits are used? b. Suppose we think of it from the point of view of how much information is represented by the state. In that case, we need to determine how may different states there are, then take the log to the base 2 to find out how many bits of information this represents. Using this approach, how many bits would be needed to represent the state?

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

We can generalize two-pass multiway merge-sort to use more than two passes. On the first pass, we divide the file into as many groups as we can merge in one pass. Then, recursively sort each group, using as many passes as necessary, and finally merge the sorted groups.A file of 1000 blocks is to be externally sorted, using 40 main-memory buffers. How many passes are needed? How many runs remain at the last pass? Find the correct number in the list below. a) The number of passes required is 2.b) The number of passes required is 3.c) The number of runs at the last pass is 10.d) The number of passes required is 1.

1. The performance of hash table O A Related to the method of handling conflicts, not the length of the table O B It has nothing to do with the method of handling conflicts, but with the length of the table OC It is related to the conflict handling method and table length OD It has nothing to do with conflict handling methods and table length 2 When using binary search, the linear list must be A Store in Sequential List B Store in linked List OC Store in Sequential List, and the list is ordered by keywords OD Store in linked List, and the list is ordered by keywords

Question 2: The game of "FastestPath" consists of a path (a 1-D array) with n positive integers to represent n cities in a path (except the first index which has always value 0). The aim of the game is to move from the source city (located at index 0) to destination (located at last index) in the shortest time. The value at each index shows the travel time to enter the city located in the corresponding index. Here is a sample path where there are 6 cities (n is 6): 0 5 90 7 61 12 Always start the game from the first city and there are two types of moves. You can either move to the adjacent city or jump over the adjacent city to land two cities over. The total travel time of a game is the sum of the travel times of the visited cities. In the path shown above, there are several ways to get to the end. Starting in the first city, our time so far is 0. We could travel to city 2, then travel to city 4, then travel to last city for a total travel time of 90 + 61 + 12 = 163. However, a…