The CPU clock is 1 GHz. One OP requires 5 clock cycles (for example arithmetic instruction and conditional). Each memory access (read or write) requires 100 clock cycles and the problem size is 1 million or n = 1,000,000. There is no memory access cost of loop index variable: don't count any arithmetic instructions for initializing or incrementing the loop index value. Assume the loop index variable is free of charge. There is an arithmetic operation involved in updating the accumulator variable. Algorithm Sum = 0 For i in range (0, n); Sum += i; Print (“sum =, sum) How many memory accesses and clocks are required by this algorithm?

The CPU clock is 1 GHz. One OP requires 5 clock cycles (for example arithmetic instruction and conditional). Each memory access (read or write) requires 100 clock cycles and the problem size is 1 million or n = 1,000,000. There is no memory access cost of loop index variable: don't count any arithmetic instructions for initializing or incrementing the loop index value. Assume the loop index variable is free of charge. There is an arithmetic operation involved in updating the accumulator variable. Algorithm Sum = 0 For i in range (0, n); Sum += i; Print (“sum =, sum) How many memory accesses and clocks are required by this algorithm?

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter5: Looping

Section: Chapter Questions

Problem 3RQ

See similar textbooks

Similar questions

Process Scheduling: Select all statements below that are true The CPU burst is the amount of time a process obtains the services of a processor as a whole. Arbitration becomes necessary when two processes with equal priority are to be scheduled. Since resource sharing is the main focus of multi-programming, it essential to allow the scheduler to remove (pre-empt) processes from the CPU in response to changing circumstances. 0 When preemptive scheduling is applied, a process is allocated the CPU until it releases it again. The service time is also known as the turnaround time. The short-term scheduler selects which of the ready, in-memory processes is to be executed next.
AIM- Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. PROBLEM STATEMENT- The pressure of two boilers is monitored and controlled by a microcomputer works based on microprocessor programming. A set of 6 readings of first boiler, recorded by six pressure sensors, which are stored in the memory location starting from 2050H. A corresponding set of 6 reading from the second boiler is stored at the memory location starting from 2060H. Each reading from the first set is expected to be higher than the corresponding position in the second set of readings. Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. If all the readings of first set is higher than the second set, store 00 in the 'D' register. If any one of the readings is lower than the corresponding reading of second set, stop the process and store FF in the register 'D'. Data (H): First set: 78, 89, 6A, 80, 90, 85 Second Set:71, 78,…
Programinf language is C
Please fix the code see picture for error. Thank you
The code box below defines a variable route as a list of directions to navigate a maze. Each instruction is one of the following four basic commands: • higher. move one step in the positive y direction • lower: move one step in the negative y direction • left: move one step in the negative x direction right: move one step in the positive x direction ● Define a function move that takes two arguments, a location (as a tuple of x and y coordinates) and an instruction (higher, lower, left, right) as a string. Given the provided location, it should return the new location (as a tuple of x and y coordinates) when following the specified instruction. If the instruction is invalid, the old location should be returned. Use the function move to determine the final position when starting from the point (-2, -1) and following all instructions in the list route. Assign this final position to the variable final_location. Reset answer 1 route = ['right', 'higher', 'left', 'lower', 'higher', 'left',…
Question 5You are required to write a program that performs matrix multiplication and addition on two matrices. The program should take as input two matrices of the same size and perform the following operations:-Matrix Addition: The program should add the two matrices and return the resulting matrix. If the matrices are not of the same size, the program should print an error message and exit.-Matrix Multiplication: The program should multiply the two matrices and return the resulting matrix. If the matrices are not compatible for multiplication (i.e., the number of columns in the first matrix is not equal to the number of rows in the second matrix), the program should print an error message and exit.Your program should have the following functions:-A function to input the matrices from the user. The user should enter the dimensions of the matrices and then enter the elements of the matrices.-A function to add two matrices. This function should take as input the two matrices and return…
I have seen some programs for these has been assignment but can this Assignment be programmed any other way? Thank you Memory Management Programming Assignment implement and test the GET-MEMORY algorithm This algorithm uses the Next-Fit(First-Fit-With-A-Roving-Pointer) technique. implement and test the FREE-MOMORY algorithm Implement the “GET_MEMORY” and “FREE_MEMORY” algorithms. Comprehensive testing must be done for each algorithm. Following are sample run results for each: GET_MEMORY IS RUNNING……… Initial FSB list FSB# Location Size 1 7 4 2 14 10 3 30 20 . . . . . . Rover is 14 ---------------------------------------------------------------------------- Allocation request for 5 words Allocation was successful Allocation was in location 14 FSB# Location Size 1 7 4 2 19 5 3 30 20 . . . . . . Rover is 30 ---------------------------------------------------------------------------- Allocation request for 150 words Allocation was not successful . . .…
please follow the instruction and see the sample run of the program (use python language)
In C Language Please
The code box below defines a variable route as a list of directions to navigate a maze. Each instruction is one of the following four basic commands: higher move one step in the positive y direction • lower. move one step in the negative y direction • left: move one step in the negative x direction • right: move one step in the positive x direction Define a function step that takes two arguments, a location (as a tuple of x and y coordinates) and an instruction (higher, lower, left, right) as a string. Given the provided location, it should return the new location (as a tuple of x and y coordinates) when following the specified instruction. If the instruction is invalid, the old location should be returned. Use the function step to determine the final position when starting from the point (0, -4) and following all instructions in the list route. Assign this final position to the variable final_point.
link - https://docs.python.org/3/library/time.html for time module Code - def long_running_task(n): num = 0 for x in range(n): for y in range(n): for z in range(n): num += x + y + z return num print(long_running_task(500))
PROBLEM: Repetition Control Structure (while, do-while) SHOW THE CODES IN ANY JAVA APPLICATION LIKE JCRATOR AND ECLIPSE. OUTPUT SHOULD BE LIKE IN THE TABLE.