1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Step2247 [10]
3 years ago
9

Technology is the tool, but without proper IG policies and a culture of compliance that supports the knowledge workers following

IG policies, any effort to secure confidential information assets will fail. Why is that? With an old IT adage in mind, even a perfect IT program ………………………...?
Computers and Technology
1 answer:
creativ13 [48]3 years ago
5 0

Answer:

Option B Is correct. It will fail without user commitment.

Explanation:

In the modern world, technology occupies an essential place. The technological tools in the industry today facilitate and expedite a huge amount of tasks, allowing automated work, mass production, software analysis, quality control, among others.

However, these tools can only work effectively when they are under the observation and supervision of trained human personnel, otherwise, a program designed to make 3D prints can fail, and without anyone to take action, it will cause a great waste of material, time and money.

You might be interested in
Compare and contrats the vain digestive system from the human digestive system.​
alina1380 [7]
No need to get political
4 0
3 years ago
Besides earning money why do people work​
vovangra [49]

Answer:

to make a name for themselves

Explanation:

6 0
3 years ago
Read 2 more answers
What is an instruction set architecture​
morpeh [17]

Answer:

Instruction set architecture is the abstract model of a computer and is the part of the processor that is visible to the programmer or compiler writer

Explanation:

6 0
3 years ago
Read 2 more answers
Disk requests come in to the disk driver for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. A seek takes 6 msec per cyli
oksano4ka [1.4K]

Answer:

For  FCFS = 876msec For SSTF = 360msec For SCAN(elevator) = 348msec

Explanation:

Considering FCFS algorithm.

In FCFS, the requests are addressed in the order they arrive in the disk queue, this means that the number of cylinders traveled becomes equal to the total of disk requests. With the arm initially at 20, the first request is to read cylinder 10.

Therefore the cylinders traversed for the first request = 20 – 10 = 10  

For the second request i.e. a movement from cylinder 10 to cylinder 22, the number of cylinders traversed is = 22 - 10 = 12.

Similarly, for the third request seek arm will return to 20 from 22 so, cylinders traversed through would be = 22-20 = 2.    

Also for the fourth request, cylinders traversed would be = 20 – 2 = 18.

For the fifth request, cylinders traversed = 40 – 2 = 38.

Now for the sixth request cylinders traversed = 40 – 6 = 34.

For the seventh and last request, cylinders traversed = 38 – 6 = 32.

So now to get the how much seek time is required for Disk scheduling algorithm  

First we would add the total cylinders traversed = 10 + 12 + 2+ 18+ 38 + 34 + 32

     = 146 cylinders  

So therefore the total seek time = number of cylinders traversed X seek time per cylinder

               = 146 X 6

   = 876msec

Considering SSTF algorithm.

In SSTF (Shortest Seek Time First), requests having shortest seek time are executed first. So, the seek time of every request is calculated in advance in the queue and then they are scheduled according to their calculated seek time. What this means is that the closest disk (cylinder) next to the position of the seek arm is attended to first. With   the arm at 20 initially, the first request is to read cylinder 22 (i.e. the closest cylinder to the seek arm)

Therefore the cylinders traversed for the first request = 22-20 = 2

For the second request, the disk to focus on is disk 20 and the cylinders traversed = 22-20 = 2

Similarly for the third request the seek arm will move to 10 from 20 so, cylinder traversed = 20-10 =10

For fourth request, cylinder traversed = 10 – 6 = 4

For the fifth request, cylinder traversed = 6 – 2 = 4

For sixth request, since all other disk request closer to it has been attended to the seek arm will move to disk 38 to attend to that disk request So, the cylinder traversed = 38 – 2 = 36

For the last request, cylinder traversed = 40 -38 = 2

So now to get the how much seek time is required for Disk scheduling algorithm  

First we would add the total cylinders traversed = 2 + 2 +10 + 4 + 4 + 36 + 2  

     = 60 cylinders

So therefore the total seek time = number of cylinders traversed X seek time per cylinder

     = 60 X 6 = 360msec

From Here we see that SSTF is better or an improvement to FCFS as it decrease the average response time (Average Response time is the response time of the all requests).

Considering SCAN (elevator) algorithm  

In SCAN algorithm the disk arm moves into a particular direction and services the requests coming in its path and after reaching the end of disk, it reverses its direction and again services the request arriving in its path. So, this algorithm works as an elevator and hence also known as elevator algorithm. Therefore the number of cylinder traveled becomes equal to the total of disk request. With the arm at 20 initially

The first request is to read cylinder 22 i.e. the first cylinder on the upward movement  

Therefore the cylinders traversed would be  =   20 – 22 = 2

For the second request is to read cylinder 38, and the cylinders traversed would be   = 38 – 22 =16

For the third request, seek arm will move to 40 So, the cylinders traversed would be = 40 – 38 = 2

For the fourth request, seek arm will return to 20 since from 40 since 40 is the highest in this upward elevator movement So, cylinders traversed would be = 40 -20 = 20  

For the fifth request, cylinder traversed would be = 20 – 10 = 10

For the sixth request, cylinder traversed would be   = 10 – 6 = 4

For the seventh and last request, cylinder traversed = 6 – 2 = 4

So now to get the how much seek time is required for Disk scheduling algorithm  

First we would add the total cylinders traversed = 2 + 16 + 2 + 20 +10+ 4 + 4 = 58 cylinders

So therefore the total seek time = number of cylinders traversed X seek time per cylinder

   = 58 X 6

          = 348msec

From Here we see that SCAN is better or an improvement to FCFS and SSTF as it decrease the average response time (Average Response time is the response time of the all requests).

6 0
3 years ago
What is the missing line of code? >>> >>> math.sqrt(16) 4.0 >>> math.ceil(5.20) 6
Blababa [14]

Answer:

A math.pow reference

Explanation:

3 0
3 years ago
Read 2 more answers
Other questions:
  • How can investors receive compounding returns? A: by selecting a savings account that has a higher interest rate B: by investing
    9·2 answers
  • Header and Footer options are located in the _____ tab.
    7·1 answer
  • Proper numeric keyboarding technique includes:
    15·1 answer
  • A computerized spreadsheet program is useful for
    6·2 answers
  • Molly, an end-user, connects an external monitor, external keyboard and mouse, and a wired network cable to her laptop while wor
    5·2 answers
  • After a chart has been inserted and formatted, is it possible to change the data range it refers to or to add new rows of data?
    14·1 answer
  • Microsoft windows malicious software removal tool fake or real
    8·1 answer
  • Which of the following is not hardware? wireless network router X-box 360 game controller virus scanner flat-panel monitor
    5·2 answers
  • You wrote a program to find the factorial of a number. In mathematics, the factorial operation is used for positive integers and
    14·2 answers
  • Write a pseudocode for the logic of a program that accepts five numbers from a user and displays one of the following messages:-
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!