Answered: Consider the following loop construct:… | bartleby

Related questions

Question

Consider the following loop construct:
X : = 1
repeat
Y = N
while Y> 0 do
Y := Y 1
endwhile
X = X + X
until X > N * N
// something (the ellipsis)
Categorize its Big-0 efficiency. Also, assume that the statements
represented by the ellipsis take 4 milliseconds to execute. Express
in milliseconds the amount of time to execute this construct for
N = 2000.

Expert Solution

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

Need help with this. Write a program named RepeatedDigits.java that asks the user to enter a number to be tested forrepeated digits. For each input number from user, the program prints a table showing how manytimes each digit appears in the number. Let’s assume that the appearance of a digit will not beover 1000 times in the input. Make sure your table printout can align well.The program should terminate when the user enters a number that is less than or equal to 0.
The following is a high level description for a luring machine M. List the first four elements of L(M) in lexicographic order (shortest first, then alphabetically if same length). 1. Move right. 2. Loop: 2.1. If the current symbol is x, change it to $ and move right. Otherwise exit loop. 2.2. Scan rightwards, past x's and #'s to find y. 2.3. If y found, change it to # and move right. Otherwise reject. 2.4. Scan rightwards, past y's and %'s to find z. 2.5. If z found, change it to % and move left. Otherwise reject. 2.6. Scan leftwards, past x's, y's, #'s and %'s to find $. 2.7. When finding the first $, move right, and go back to 2.1. 3. If the current symbol is #, more right. Otherwise reject. 4. Scan rightwards, past #'s and %'s, to find the blank symbol. 5. When finding the first blank symbol, move right and accept. €, xyz, xxyyzz, xxxyyyzzz xyz, xxyyzz, xxxyyyzzz, xxxxyyyyzzzz €, ZyX, ZZYYXX, ZZZYYYXXX zYX, ZZYYXX, ZZZYYYXXX, ZZZZYYYYXXXX
Write a program that is given two doubles for comparison and a third double that is a difference threshold, called epsilon. Output one of three phrases: • output "equal" if the doubles are within 0.001(exclusively) of each other output "close enough" if the doubles are within epsilon (exclusively) of each other • output "not close" if doubles are not within epsilon ●
Create an algorithm that prints all possible arrangements for eight queens on an 8x8 chess board so that no two queens share the same row, column, or diagonal. In this example, "diagonal" refers to all diagonals, not simply the two that cut the board in half.
Are all of my answers correct?
n-1 Geometric (n) = i=1 i=1 1 1 * n-1 П %3D Harmonic (n) = i=1 n Let's look at examples. If we use n = 4, the geometric progression would be 1 * 2 * 3 * 4 = 24, and the harmonic 1.1.1 1 progression would be 1* -= 0.04166. 2 3 4 24 Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println ("Method call -- " + "calculating " "Factorial of: " + n); + Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return (factorial (n - 1) * n); c. Add these lines in the recursive section: temp = factorial (n - 1); System.out.println ("Factorial of: " (n - 1) + " is " temp); return (temp * n); 3. Rerun the program and note how the recursive calls…
Help writing a Java program (please provide photos it works so I'm not studying a nonworking program) Write a complete version of the Bresenham Midpoint algorithm to handle ALL slope values. Include appropriate tests for ‘special case’ conditions. Instead of “WritePixel” write to the screen the coordinates of the pixel that would be drawn. Your program must implement the algorithm given in class with modifications to handle the special cases. Different slope values: m = 0, m = 1, m = > 1, m = infinity (needs special test case) , m < 0 (swap x and y) The user should be able to enter coordinates and it should output the coordinates it takes to draw from the first point to the last point
Please help me with the last three small boxes!!
Describe the running time in terms of the variable n. it would be better to say That loop will run 2*n + 1 times instead of That loop will run O(n) times. public int mysterious(int n, int sum) { int i = 0; while (i < n) { i = i + 1; for (int k = 0; k < 25; k++) { sum = sum + i; } } return sum; }
Use Java language and the last digit of ID is a 7
Consider an algorithm that contains a loop that can be expressed with the following pseudocode: for( i = 1 through n ){Task T} If Task T requires t time units, how many time units (in terms of t) does the entire loop require? options: a) i b) n c) n * t d) n^2 e) n^2 * t
It is a python program. Make sure it works and run in IDLE 3.10. Please show the code screenshot and output screenshot.