Consider the following nested loop construct. Categorize its efficiency in terms of the variable n using “big-o” notation. Suppose the statements represented by the ellipsis (...) require four main memory accesses (each requiring one microsecond) and two disk file accesses (each requiring one millisecond). Express in milliseconds the amount of time this construct would require to execute if n = 1024. x = 1; do { y = n; while (y > 0) { ... y--; } x *= 2; } while (x < n*n);

Consider the following nested loop construct. Categorize its efficiency in terms of the variable n using “big-o” notation. Suppose the statements represented by the ellipsis (...) require four main memory accesses (each requiring one microsecond) and two disk file accesses (each requiring one millisecond). Express in milliseconds the amount of time this construct would require to execute if n = 1024. x = 1; do { y = n; while (y > 0) { ... y--; } x = 2; } while (x < nn);

Name: Consider the following nested loop construct. Categorize its efficienc
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Consider the following nested loop construct. Categorize its efficiency in terms of the variable n using “big-o” notation. Suppose the statements represented by the ellipsis (...) require four main memory accesses (each requiring one microsecond) and

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

Computer science
Case Study Assume a computer system has a main memory of 256 Bytes. The following is a memory byte-access trace history of a program run on this system. For example, as it is shown, the program first accesses memory address 0000 0000, and then it accesses memory address 0000 0001 and so on. Note the memory addresses are represented in binary: 00000000, 00000001, 00000010, 00000011, 00001000, 00010000, 00010001, 00000100, 00000101, 00000110, 00000111, 00001001, 00001010, 00001011, 00001100, 00001000, 00001001, 00001010, 00011100, 00011101. Q3. Assume the system has a 16-Byte direct mapped unified L1 cache with a block size of 2 Bytes. The following table shows how the cache looks like after the first access to the memory is finished. Please show; in the provided table, how it looks like after the 20th access is finished. You could ignore the "Data" Column. (Add or remove Rows/Columns in the provided table for your answer, as you see fit). Cache contents after the 1st access: Cache Index…
Given the following: Logical Memory size of 1000 Physical Memory size of 2000 Page (and frame) size of 100 Block A contains data for a program Select Block A’s size and its starting point in both memories. Then write the page table for Block A based on your selections. See below for the layout of both memories and an example of Block A of size 200. Logical Memory Physical Memory location/ page location/frame 0 to 99/ 0 0 to 99/ 0 100 to 199 /1 Block A 100 to 199/ 1 200 to 299/ 2 Block A 200 to 299/ 2 300 to 399/ 3 300 to 399/ 3 400 to 499/ 4 400 to 499/ 4 500 to 599/ 5 500 to 599/ 5 600 to 699/ 6 600 to 699/ 6 700 to 799/ 7 700 to 799/ 7 800 to 899/ 8 800 to 899/ 8 900 to 999/ 9 900 to 999/ 9 1000 to 1099/ 10 1100 to 1199/ 11 1200 to 1299/ 12 1300 to 1399/ 13 Block A 1400 to 1499/ 14 Block…
using python to write the program. The Towers of Hanoi is a classic puzzle that consists of 3 towers, and n disks of different sizes that can slide onto any tower. The puzzle starts with the disks sorted in ascending order of size from top to bottom. It has the following constraints:a. Only one disk can be moved at a time.b. A disk can only be moved from the top of one tower to another tower.c. A disk can only be placed on top of a larger disk.Write a pseudo-code and program to move the disks from the first tower to the last using stacks.
Consider a memory system which only allows you to do sequential search. For example a read/write tapedrive. If you want to look for a file you have to search sequentially looking at the first file, then the secondfile and so on until you find the file. A reasonable strategy would be place the most recently retrieved fileat the front (imagine that the tape system can magically do this). This way the files that are accessed moreoften will be ”at the front” and require less searching time in the long run. Consider the case with only 3files A, B, and C.1. Let Xn denote the sequence of the memory system after the nth search. For example, if the files wereordered A and then B followed by C, then X0 = ABC. Enumerate the state space.2. If X0 = ABC, list all possible states of X1.3. If pA, pB, and pC = 1 − pA − pB are the probabilities with which files A, B, and C are accessed,respectively, determine the one-step state transition matrix.4. If pA = 0.6, pB = 0.10, pC = 0.3, determine the steady…
When translating conditionals or loops, the generated low-level code contains jumps. For the CPU to be able to execute a jump, the target of a jump must be a valid memory address. However, code generators typically generate jumps to symbolic addresses (labels). For example: beq exit Answer the following questions about symbolic addresses. i. What are the advantages of using symbolic addresses? ii. Which programs are responsible for translating such symbolic addresses to actual memory addresses? iii. How do code generators create symbolic addresses?
Suppose that a 2 MB file consisting of 512-byte logical blocks is stored on a disk drive with the following characteristics: Parameter Value Rotational rate 15,000 RPMTavg seek 4 msAverage number of sectors/track 1,000Surfaces 8Sector size 512 bytes For each case below, suppose that a program reads the logical blocksof the file sequentially, one after the other, and that the time to positionthe head over the first block is Tavg seek + Tavg rotation .A. Best case: Estimate the optimal time (in ms) required to readthe file over all possible mappings of logical blocks to disksectors. B. Random case: Estimate the time (in ms) required to read thefile if blocks are mapped randomly to disk sectors.
In programming, a pass through a loop is a(n)? A. Scan B. Iteration C. Execution D. None of the above Justify your answer with explanations The number of address lines required to address a memory of size 32k is? A. 15 B. 16 C. 18 D. 14 Justify your answer with explanations
The Subject is Microprocessor Systems.
code in java or c language
Write a C program to Implement a system of three processes which read and write numbers to a file. Each of the three processes P1, P2, and P3 must obtain an integer from the file (these instructions must be executed 200 times). The file only holds one integer at any given time. Given a file F, containing a single integer N, each process must perform the following steps 1. Fork two processes For 200 times: 2. Open F 3. Read the integer N from the file 4. Close F 5. Output N and the process' PID (On the screen) 6. Increment N by 1 7. Open F 8. Write N to F (overwriting the current value in F) 9. Close F b) Briefly describe why the processes P1, P2, and P3 obtain/read duplicates of numbers (why does a particular integer x appear in the output of more than one process)? Suggest a solution (you do not need to implement it) to guarantee that no duplicate numbers are ever obtained by the processes. In other words, each time the file is read by any process, that process reads a distinct…
4. The Single Instruction Computer (SIC) has only one instruction that can do all operations our RISC-V does (you did a homework problem). The instruction has the following format sbn a, b, c # Mem[a]=Mem[a]- Mem[b]; if (Mem[a]- Mem[b]<0) go to PC+c For example, here is the program to copy a number from location a to location b: sbn temp, temp, 1 sbn temp, a, 1 sbn b,b, 1 sbn b, temp 1 Start: Design a single cycle datapath and control for this instruction set architecture.