Vhat is the result when you run the following program?

What are the 5 characteristics of flowchart<br>

olchik [2.2K]

Answer:

Here's ur answer

Explanation:

(i) Should consist of standardized and acceptable symbols. (ii) The symbols should be correctly used according to flowcharts rules. (iii) Should have short, clear and readable statements written inside the symbols. (iv) It must have clear one starting point and one ending point.

3 0

3 years ago

Cache memory is a special group of very fast memory circuitry located on or close to the CPU that is used to speed up processing

antoniya [11.8K]

Answer:

TRUE

Explanation:

Cache memory is a computer component that help to retrieve data from the computer's memory by acting as a temporary storage area where the computer's processor can retrieve data easily. The temporary storage area is known as cache and is more readily available to the processor than the computer's main memory source.

Although Cache memory is a smaller type of a computer memory that provides high-speed data access to a processor and stores which frequently used computer programs, applications and data.

Cache memory is used to reduce the average time to access data from the Main memory and they stores data so that future requests for that data can be served faster.

5 0

3 years ago

________ are viruses that masquerade as useful programs or files. hydras spyware programs worms adware programs trojan horses

Harrizon [31]

Trojan horse is the correct answer

5 0

3 years ago

Directions: On the line before each item, write ”I” if the substance is an electric insulator or “C” if the substance is an elec

Studentka2010 [4]

Answer:

___I__22. paper

___I__23. glass

___C__24. iron

___I__25. plastic

___C__26. gold

__C___27. copper

___I__28. wood

___I__29. Rubber

___C__30. Aluminum

Materials which do not allow current to flow easily are called insulators.

Materials which allows current to flow easily are called Conductors.

8 0

4 years ago

A computing company is running a set of processes every day. Each process has its own start time and finish time, during which i

Helga [31]

Answer:

Above all else, let us show that this issue has the greedy choice property.

This implies that worldwide ideal arrangement can be gotten by choosing local ideal arrangements. Presently notice the following:

The global optimal solution of the issue requests us to track down the minimum number of times process_check module should be run.

It is likewise referenced that during each running interaction, process_check module should be called atleast once. Along these lines, the minimum possible number of process_check calls happens when process_check is made close to the quantity of the processes that are run.

Along these lines, we see that the global optimal solution is shaped by choosing optimal answer for the nearby advances.

Along these lines, the issue shows greedy choice property. Thus, we can utilize a greedy algorithm for this issue.

The greedy step in this calculation is to postpone the process_check as far as might be feasible. Thus, it should be run towards the finish of each interaction. So the following algorithm can be utilized:

Sort the cycles by utilizing the completion times.

Towards the finish of the 1st process in the arranged list, run the process_check module. Right now any process that is now running is removed the arranged rundown. The main interaction is additionally removed from the sorted list.

Now repeat stage 2, till all processes are finished.

In the above mentioned algorithm, the costliest advance is the step of sorting. By utilizing the optimal sorting algorithm, for example, merge sort, we can achieve it in O(n log n) asymptotic time.

Along these lines, this greedy algorithm additionally takes O(n log n) asymptotic time complexity.

5 0

3 years ago