a. Known that a disk drive has 256 cylinders, with the number cylinder starts at 0 and ends at 255. The needle position on the disk drive currently stops at point 128. It is also known that the needle is always “to the cylinder with the higher number” small first." The order of the positions visited sequentially is: 254, 64, 32, 100, 50, 70. Of the 3 choices of algorithms below, which one is the best algorithm? Make each one the image and specify seektime. i. SCAN ii. C-SCAN iii. FIFO b. Sky Connectiva Company has 300 branches all over the world Indonesian archipelago, therefore the company decided to build a RAID system on the Sky Connectiva system database. You are asked to analyze: i. What is the difference between mirroring, parallel access, and independent access? ii. If the company can only have a maximum of 3 disks, and the information must spread over all those disks, what RAID would you suggest?

a. Known that a disk drive has 256 cylinders, with the number cylinder starts at 0 and ends at 255. The needle position on the disk drive currently stops at point 128. It is also known that the needle is always “to the cylinder with the higher number” small first." The order of the positions visited sequentially is: 254, 64, 32, 100, 50, 70. Of the 3 choices of algorithms below, which one is the best algorithm? Make each one the image and specify seektime. i. SCAN ii. C-SCAN iii. FIFO b. Sky Connectiva Company has 300 branches all over the world Indonesian archipelago, therefore the company decided to build a RAID system on the Sky Connectiva system database. You are asked to analyze: i. What is the difference between mirroring, parallel access, and independent access? ii. If the company can only have a maximum of 3 disks, and the information must spread over all those disks, what RAID would you suggest?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.4: Arithmetic Operations

Problem 6E

See similar textbooks

Similar questions

Let two words be given. At least how many steps must be taken to make one of these two words like the other? Each step can be one of the following 3 steps: 1- Drop a letter 2- Changing a letter 3- Add a letter (anywhere) Solve the question using only a brute force algorithm. Explain your solution and question write program in java language and calculate time complexity?
10- Which of the following statements about time complexity analysis is true? a. It is impossible for a correct algorithm to have a time complexity so high that it is impractical to use, but the program may feel "sluggish". b. When there are multiple possible input values with the same size, we usually only care about the input values which would cause the algorithm to run the fastest. c. Two different algorithms that solve a particular program correctly can have different time complexities. d. We usually only care about the behaviour of the algorithm as the input size gets small.
please answer question #33 to answer the question. please use (Algorithm 5.7) for the Backtracking Algorithm for the 0-1 Knapsack Problem please use java language for coding java file - should start with your Last Name, Like SmithClubApp, PetrowskiTravelLogApp, for your class short paragraph should include- please label the question with the answer as well -description of the java file -what it does? -what is the input data? expected output, samples of both
43- Suppose that you implement an algorithm to solve a problem. It works correctly and quickly for small inputs, but you notice that your program runs much slower as the input size grows (to the point of becoming unusable). In fact, each time you increase the input size by one the execution time of your program roughly doubles! Which of the following options is the most effective way of addressing this issue? You may assume that program outputs which are close to optimal are acceptable. a. Purchase a faster computer---this is a worthwhile investment as a programmer and will resolve this kind of issue. b. Design a new approximate algorithm with lower time complexity. c. Remove comments and any other non-essential elements in your source code that may be slowing things down. d. Switch to a more efficient programming language, such as machine code, because although Python is readable it is also too slow. e. Invoke Python with the --linear-time option to force…
A disk drive has 256 cylinders, with the numberThe cylinder starts at 0 and ends at 255. The position of the needle on the disk drive is currently stoppedat point 128. It is also known that the needle is always "to the cylinder with more numbers"Small first." The order of the positions visited in sequence is:254, 64, 32, 100, 50, 70. From the 3 algorithm options below, which is the best algorithm? Make each onedraw it and specify seektime. i. SCANii.C-SCANiii. FIFO
calculate number of operations in this algorithm void my_dgemv(int n, double* A, double* x, double* y) { double alpha=1.0, beta=1.0; int lda=n, incx=1, incy=1; cblas_dgemv(CblasRowMajor, CblasNoTrans, n, n, alpha, A, lda, x, incx, beta, y, incy); }
Create a single tape Turing machine that has the alphabet a, b, c and null. Submit a .jff file of your solution. This Turing machine begins with (a+b+c)* and ends with a tape content of (abc)* e.g. abcabcabc... if there are extra characters, for example extra b's, erase them. Maximize the number of abc substrings.
Consider the following snippets of code. Then, identify and describe thesorting algorithm used.num scores[5] = 90,85,65,95,75sort()x = 1while x < SIZEtemp = scores[x]y = x – 1while y >= 0 AND scores[y]>tempscores[y+1] = scores[y]y = y – 1endwhilescores[y+1] = tempx = x + 1endwhilereturn
A computer science student designed two candidate algorithms for a problem while working on his part-time job The time complexity of these two algorithms are?1(?) = 3 ? log ? and ?2(?) = ?6/5. a) Which algorithm is better? Why?b) If we run both algorithms at the same time with an input size of 105, which algorithm produces results faster than the other one? Why?
Derive rules of thumb that apply when the new input size is the square root of the original input size for each scenario below. Be sure to show the mathematical result and give an English sentence for the rule of thumb, in the usual style e.g. “If the new size is the square root of the original size then the runtime is divided by the original size.” (Don't use variables like "n" in your sentence, say "the original size" or "the new size".) a. T(n) = kn b. T(n) = klogn c. T(n) = kn2 d. T(n) = knlogn
Check these two codes and then answer these questions please: 1) Empirically, show the performance curve of the algorithm using time measurements 2) Using the basics of the theoretical analysis, write the complexity of its worst-casetime. 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>=…
c. How many times is the basic operation executed?d. What is the efficiency class of this algorithm?e. Suggest an improvement, or a better algorithm altogether, and indicate itsefficiency class. If you cannot do it, try to prove that, in fact, it cannot bedone.