Ask question

Ask question

All categories

3 years ago

13

Marcus just created a new folder specifically for his buisness records so he would like to move last months business transaction

file into the folder which of the following ways could marcus relocate this file into his new folder without creating a new copy

Computers and Technology

2 answers:

andreyandreev [35.5K]3 years ago

8 0

Marcus can cut and paste last month's business transaction file into the folder

grandymaker [24]3 years ago

8 0

He can cut and put it to file.

You might be interested in

Consider the two computers A and B with the clock cycle times 100 ps and 150 ps respectively for some program. The number of cyc

Kipish [7]

Answer:

Option d) B is 1.33 times faster than A

Given:

Clock time, $t_{A} = 100 ps$

$t_{A} = 150 ps$

No. of cycles per instructions, $n_{A} = 2.0$

$n_{B} = 1.0$

Solution:

Let I be the no. of instructions for the program.

CPU clock cycle, $f_{A}$ = 2.0 I

CPU clock cycle, $f_{B}$ = 1.0 I

Now,

CPU time for each can be calculated as:

CPU time, T = $CPU clock cycle\times clock time$

$T_{A} = f_{A}\times t_{A} = 2.0 I\times 100 = 200 I ps$

$T_{B} = f_{B}\times t_{B} = 1.0 I\times 100 = 150 I ps$

Thus B is faster than A

Now,

$\frac{Performance of A}{Performance of B} = \frac{T_{A}}{T_{B}}$

$\frac{Performance of A}{Performance of B} = \frac{200}{150}$

Performance of B is 1.33 times that of A

7 0

3 years ago

Read 2 more answers

Which component is a part of the central processing unit (CPU) of a computer

suter [353]

The arithmetic logic unit (ALU), which performs arithmetic and logical operations.

The control unit (CU), which extracts instructions from memory and decodes and executes them, calling on the ALU when necessary.

6 0

3 years ago

Read 2 more answers

What are entity-relationship diagrams and how are they used? What symbol is used for a relationship? What is an associative enti

castortr0y [4]

Answer:

The definition including its given problem is outlined in the following segment on the clarification.

Explanation:

Entity-relationship (ER) diagram describes how mechanical stored procedures are constructed and demonstrate the overarching representation of the situation. It also describes the connections between some of the entities of the framework and even the comparison with standard measurements.
For something like an individual relationship structure, the normal representation of connections seems to be a diamond. Associative institutions have several to many partnerships to communicate with. It's indeed the verb throughout a diamond-shaped form that holds two organizations around each other. This verb is in fact an entity on its own, therefore it must be termed an associative entity.
An illustration of such might be if a participant were to register for a class. Multiple individuals will be registered for several courses, and there have been many to several relationships; thus, the associative object will indeed register.

4 0

3 years ago

Ksivusya [100]

True
You can only do it ascending because you will get confused

7 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