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
g100num [7]
2 years ago
8

Which of the following formats can algorithms NOT be written in:

Computers and Technology
2 answers:
umka2103 [35]2 years ago
5 0
Hello there.

Which of the following formats can algorithms NOT be written in:

Answers: Flow Chart 
babymother [125]2 years ago
3 0
I believe the answer is "Structured English" I'll let you know
You might be interested in
A user reports that a file they shared out on their computer for another network user is not accessible to the third party. The
muminat

Answer:

i think it's going to be c

Explanation:

3 0
3 years ago
What does PRAM stand for?
Nana76 [90]
<span>PRAM- Phase-Change Random Access Memory</span>
7 0
3 years ago
Read 2 more answers
The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is
gavmur [86]

Answer:

False

Explanation:

The scheme where you can find the greatest common divisor (GCD) of two integers by repetitive application of the division algorithm is known as Euclidean Algorithm.

The Euclidean Algorithm for calculating GCD of two numbers X and Y can be given as follows:

  • If X=0 then GCD(X, Y)=Y since the Greatest Common Divisor of 0 and Y is Y.
  • If Y=0 then GCD(X, Y)=X since the Greates Common Divisor of 0 and X is X.
  • Let R be the remainder of dividing X by Y assuming X > Y. (R = X % Y)
  • Find GCD( Y, R ) because GCD( X, Y ) = GCD(Y, R ).
  • Repeat the above steps again till R = 0.

4 0
3 years ago
Write a program that creates a Date object, sets its elapsed time to 10000, 100000, 1000000, 10000000, 100000000, 1000000000, 10
Lady bird [3.3K]

Answer:

Explanation:

The following Java program creates various Date objects for each one of the provided milliseconds in the question. Then it calls the toString() method on each one. The last two milliseconds were not included because as a long variable they are too big for the Date object to accept. The code has been tested and the output is shown in the image below.

import java.util.Date;

class Brainly {

   public static void main(String[] args) {

       Date date = new Date();

       date.setTime(10000);

       System.out.println(date.toString());

       Date date2 = new Date();

       date2.setTime(100000);

       System.out.println(date2.toString());

       Date date3 = new Date();

       date3.setTime(1000000);

       System.out.println(date3.toString());

       Date date4 = new Date();

       date4.setTime(10000000);

       System.out.println(date4.toString());

       Date date5 = new Date();

       date5.setTime(100000000);

       System.out.println(date5.toString());

       Date date6 = new Date();

       date6.setTime(1000000000);

       System.out.println(date6.toString());

   }

}

3 0
3 years ago
The outstanding disk requests are for tracks 6,10,4,20,36,8, and 40 in that order. Assume that the seek time speed is 5 msec/tra
kirill [66]

Answer:

a. FCFS

seek: 9+4+6+16+16+28+32 = 111 cylinders, 555 ms

b. SSTF

seek: 5+16+4+30+2+2+2 = 61 cylinders, 305 ms

c. C-LOOK

seek: 5+16+4+30+2+2+2 = 61 cylinders, 305 ms

Explanation:

a. FCFS: requests are served in the order they are received. It is used when load is low and has long waiting time for long requests queues.

order: (15), 6, 10, 4, 20, 36, 8, 40

seek: 9+4+6+16+16+28+32 = 111 cylinders, 555 ms

b. SSTF: requests are served using shortest seek time first. It minimizes arm movement, and maximizes request rate

order: (15), 20, 36, 40, 10, 8, 6, 4   15 10 8 6 4 40 36 20

seek: 5+16+4+30+2+2+2 = 61 cylinders, 305 ms

c. C-LOOK: requests are served in one direction until when done then reverses. It does not go to end of disk.

Assume maximum track is 50 then reverses

order: (15), 20, 36, 40, (50), 10, 8, 6, 4

seek: 5+16+4+30+2+2+2 = 61 cylinders, 305 ms

4 0
3 years ago
Other questions:
  • A Web ____ is a software program that retrieves the page and displays it. Select one:
    5·1 answer
  • Because you do not know every possible future use for the data TerramEarth collects, you have decided to build a system that cap
    15·1 answer
  • Which of these symbols is a special character that is accessible only from the Symbol dialog box? A. © B. + C. é D.
    13·2 answers
  • Write structured pseudocode to show the following: print “Reorder” when the quantity is less than 20; otherwise print “OK”.
    15·1 answer
  • Order the following routine maintenance tasks from most to least important when securing a computer. a. Verify anti-malware sett
    15·1 answer
  • Concerning Structured Cabling, select the statement that is true, or select, "All statements are false."
    5·1 answer
  • Code written by computer programmers is translated to binary code, so computers can understand the instructions. True or False
    7·1 answer
  • me pueden ayudar con mi trabajo sii porfss si me dan la respuesta correcta y les doy la mejor coronita si​
    12·1 answer
  • Please help me I need a help
    13·1 answer
  • Create a file name that to ensure the that the file is easy to find
    12·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!