All categories

2 years ago

Select all the correct answers.

Computers and Technology

2 answers:

Grace [21]2 years ago

4 0

Answer:

resistors reduce current flow and divide voltages, so 2 & 3!

oksano4ka [1.4K]2 years ago

3 0

Explanation: 2 and 5

You might be interested in

How long would it take a 8 bit computer to calculate π to the thousandth place?

allochka39001 [22]

The average speed of an 8 bit computer is 0.50 MIPS or million instructions per second. There are three thousand instructions per digit of the number in <span>π, the thousandth place needs 4 x 3 = 12 thousand instructions. The time it takes to do this is 12000 / (0.5 x 1000) = 24 seconds.

</span>

7 0

3 years ago

2. Consider a 2 GHz processor where two important programs, A and B, take one second each to execute. Each program has a CPI of

allsm [11]

Answer:

program A runs in 1 sec in the original processor and 0.88 sec in the new processor.

So, the new processor out-perform the original processor on program A.

Program B runs in 1 sec in the original processor and 1.12 sec in the new processor.

So, the original processor is better then the new processor for program B.

Explanation:

Finding number of instructions in A and B using time taken by the original processor :

The clock speed of the original processor is 2 GHz.

which means each clock takes, 1/clockspeed

= 1 / 2GH = 0.5ns

Now, the CPI for this processor is 1.5 for both programs A and B. therefore each instruction takes 1.5 clock cycles.

Let's say there are n instructions in each program.

therefore time taken to execute n instructions

= n * CPI * cycletime = n * 1.5 * 0.5ns

from the question, each program takes 1 sec to execute in the original processor.

therefore

n * 1.5 * 0.5ns = 1sec

n = 1.3333 * 10^9

So, number of instructions in each program is 1.3333 * 10^9

the new processor :

The cycle time for the new processor is 0.6 ns.

Time taken by program A = time taken to execute n instructions

= n * CPI * cycletime

= 1.3333 * 10^9 * 1.1 * 0.6ns

= 0.88 sec

Time taken by program B = time taken to execute n instructions

= n * CPI * cycletime

= 1.3333 * 10^9 * 1.4 * 0.6

= 1.12 sec

Now, program A runs in 1 sec in the original processor and 0.88 sec in the new processor.

So, the new processor out-perform the original processor on program A.

Program B runs in 1 sec in the original processor and 1.12 sec in the new processor.

So, the original processor is better then the new processor for program B.

5 0

2 years ago

There are generally two ways of implementing dynamic programming solutions to problems, which have equal asymptotic time complex

san4es73 [151]

Answer:

1) Bottom-up

2) Top-down

Explanation:

In general dynamic programming is a divide and conquer strategy which can be implemented using bottom up approach or top down approach.

Bottom-up approach in dynamic programming will solve a relatively simple sub-problem first and then use the solution to build and arrive at solutions to a bigger sub-problem.

Top down approach is reversed to bottom-up approach and is also known as Memoization Method. Instead of solving a problem started from the base state sub-problem, the top down approach break a problem into a smaller problems from the top most destination state until it reaches the bottom most base state.

8 0

3 years ago

Write a program that include a method that returns the sum of all the elements of a Linked List of Integers. Allow the user to e

Illusion [34]

Answer:

static void Main(string[] args)

{

//declare a blank linked list

LinkedList<int> numList = new LinkedList<int>();

Console.WriteLine("Enter the Numbers");

//check if the size of the linkedlist is 10

while(numList.Count < 10)

{

//read the input supplied by the user

string val = Console.ReadLine();

//check if the input is integer

if(int.TryParse(val, out _) == false)

{

//if not integer, display error message and prompt for new number

Console.WriteLine("Invalid number");

continue;

}

//add the inputted number to the linkedlist

numList.AddLast(int.Parse(val));

}

//call the method for linkedlist sum and display it

Console.WriteLine(SumLinkedList(numList));

Console.Read();

}

//method for linkedlist summation

private static int SumLinkedList(LinkedList<int> val)

{

//declare sum as zero

int sum = 0;

//loop through the linkedlist to display the num and sum all numbers

foreach(int item in val)

{

Console.Write(item + " ");

sum += item;

}

return sum;

}

Explanation:

program written with c#

8 0

2 years ago

Tell four permanent icons on the desktop

Alex777 [14]

Answer:

Desktop icons include Computer, your personal folder, Network, the Recycle Bin, Internet Explorer, and Control Panel. 1. Right-click an empty area of the desktop, and then click Personalize.

To arrange icons by name, type, date, or size, right-click a blank area on the desktop, and then click Arrange Icons. Click the command that indicates how you want to arrange the icons (by Name, by Type, and so on).

5 0

2 years ago