1) How many times does this loop? L1 : Mον οχ,4 DEC CX Loop L1 a.2 b.4 c. forever (infinity loop) d.3 2) Given the following psudo code: Ax =DX; if(AX is even) AX= Ax+2; else AX = A+1; Complete the blanks in the following Assembly code to be equivalent to the given (psudo code)high-level code. mov Ax.Dx mov d,2 Div d cmp0 _ next add Ax,2 imp endif next: add ax,1 endif: a. AH je b. AL je C. AH ine. d.AL ine.

1) How many times does this loop? L1 : Mον οχ,4 DEC CX Loop L1 a.2 b.4 c. forever (infinity loop) d.3 2) Given the following psudo code: Ax =DX; if(AX is even) AX= Ax+2; else AX = A+1; Complete the blanks in the following Assembly code to be equivalent to the given (psudo code)high-level code. mov Ax.Dx mov d,2 Div d cmp0 _ next add Ax,2 imp endif next: add ax,1 endif: a. AH je b. AL je C. AH ine. d.AL ine.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 9E: (Practice) Although the total number of bytes varies from computer to computer, memory sizes of...

See similar textbooks

Similar questions

In <sys/param.h>, MAXPATHLEN is defined to be 1024 bytes.The for()loop here correctly bounds variable i to < 1023, such that when the loop hasended, no byte past npath[1023] may be written with \0. However, since i is alsoincremented in the nested statements here as ++i, it can become equal to 1024,and npath[1024] is past the end of the allocated buffer space.Then a null byte iswritten into npath[1024], overwriting the least significant byte of EBP.This canbe exploited as a off-by-one overflow.The bug was fixed by Which changing the logic?
Suppose that the following code is run on a machine that has a maximum integer value of32,767.int A, B, C, DA = 20,000B = 25,000C = -20,000D = A + B + CIs the add operator above associative? Explain the reason.
A. The original Caesar cypher shifts each character by one: a becomes b, z becomes a, and so on. Let's make it a bit harder, and allow the shifted value to come from the range 1..25 inclusive. Moreover, let the code preserve the letters' case (lower-case letters will remain lower-case) and all non-alphabetical characters should remain untouched. Your task is to write a program which: asks the user for one line of text to encrypt; asks the user for a shift value (an integer number from the range 1..25 - note: you should force the user to enter a valid shift value (don't give up and don't let bad data fool you!) Test your code using the data we've provided. Test data Sample input: abcxyzABCxyz 123 2 Sample output: cdezabCDEzab 123 Sample input: The die is cast 25 Sample output: Sgd chd hr bzrs
x=[10,1,20,3,6,2,5,11,15,2,12,14,17,18,29] for i in range(0, len(x)): m = x[i] l = i # Finding the minimum value and its location for j in range(i+1, len(x)): if(m >x [j]): m= x[j] l = j # Now we will do the swapping tmpry = m x[l] = x[i] x[i] = tmpry print(x) 8.The code above is written in Python programming language. In this sample, there are many sectors where you can apply knowledge of code refactoring. Mention each criteria where this code lacks and provide appropriate suggestions to improve. (Hint: Code Smells e.g: Naming Convention, Code length, Assertion etc.)
For each of the following two code segments, decide whether it is suitable for parallel execution and response according to your justification: add OpenMP pragmas to make the loop parallel or briefly explain why the code segment is not suitable for parallel execution. (A): for ( i = 0; i < n; i++ ) { x [ i ] = 3 * i + 5; y [ i ] = log ( x [ i ] ); } (B): x [ 0 ] = 1; x [ 1 ] = 2; for ( i = 2; i < n; i++ ) x [ i ] = x [ i – 1 ] * x [ i – 2 ] ;
Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
Implement the quadratic_formula() function. The function takes 3 arguments, a, b, and c, and computes the two results of the quadratic formula: x1=−b+b2−4ac2a x2=−b−b2−4ac2a The quadratic_formula() function returns the tuple (x1, x2). Ex: When a = 1, b = -5, and c = 6, quadratic_formula() returns (3, 2). Code provided in main.py reads a single input line containing values for a, b, and c, separated by spaces. Each input is converted to a float and passed to the quadratic_formula() function. Ex: If the input is: 2 -3 -77 the output is: Solutions to 2x^2 + -3x + -77 = 0 x1 = 7 x2 = -5.50 code: # TODO: Import math module def quadratic_formula(a, b, c):# TODO: Compute the quadratic formula results in variables x1 and x2return (x1, x2) def print_number(number, prefix_str):if float(int(number)) == number:print("{}{:.0f}".format(prefix_str, number))else:print("{}{:.2f}".format(prefix_str, number)) if __name__ == "__main__":input_line = input()split_line = input_line.split(" ")a =…
I am trying to resolve errors from ths code can you help with me? int i, j, height = 17; int width = 20, gameover, score; // Function to draw a boundary void draw() { // system("cls"); for (i = 0; i < height; i++) { for (j = 0; j < width; j++) { j == height - 1) { printf("#"); } else { printf(" "); } } printf("\n"); } } // Driver Code int main() { // Function Call draw(); return 0; }
Explain briefly how loop unrolling, re-association, and separate accumulating help in performance optimization. Re-write the following code using 2 x 2 unrolling. void combine(int x[], int n, int *dest){ *dest = 0; for (int i = 0; i < n; i++) { *dest = *dest + x[i]; } }
11.Code so on for_A pure full Implement c/c++ to evaluate round robin algorithm. You must use the job list given here: Job (1) arrive at CPU cycle1 Job (2) arrive at CPU cycle2 Job (3) arrive at CPU cycle36 I/O (32) CPU (54) I/O (45) CPU (20) I/O (40) CPU (48) CPU (39) CPU (48) I/O (55) Your job list must contain CPU bust and I/O bust as above. Quantum time = [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60] The evaluation of the most suitable quantum time needs to consider the followingperformance metrics, but not limited to:(i) Turnaround time of the jobs;(ii) Waiting time of the jobs; and(iii) Number of interrupts incurred The code must able to read csv file format of the job list as input file. The code must able for user to input time quantum.. ..
In Python IDLE, how would I write a function loop that will take each item in (set a) [1,2,3] and multiply by each item in (set b) [2,3,4]. I would like the result of: 1x2,1x3,1x4,2x2, 2x3,2x4,3x2,3x3,3x4
You are writing code that is equivalent to: X = A / (5 + B) Assume signed bytes and the following first 3 lines of code: mov al,A mov bl,B add bl,5 What is the one line of code that will perform the division correctly?