1. Consider the following program the execution times of its instructions.for (i=0, z=0; i<10; i++) {if (x[i]>3)z=z+x[i] *c[i];Instruction1=0, z=0i<10if (x[i]>3)z-z+x[i] *c[i]ittA. Determine the minimum execution time of the program.B. Determine the maximum execution time of the program.Execution time(clock cycles)3If True 2, if False 5.If True 3, If False 6.71

Name: 1. Consider the following program the execution times of its instruct
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 1. Consider the following program the execution times of its instructions.for (i=0, z=0; i 3)z=z+x[i] *c[i];Instruction1=0, z=0i 3)z-z+x[i] *c[i]ittA. Determine the minimum execution time of the program.B. Determine the

Time complexity is defined as the amount of the time taken by an algorithm to run, as the function…

Engineering

Computer Science

1. Consider the following program the execution times of its instructions. for (1-0, z=0; i<10; i++) { if (x[i]>3) z=z+x[i] *c[i]; Instruction i=0, z=0 i<10 if(x[i]>3) z-z+x[i]+c[i] i++ A. Determine the minimum execution time of the program. B. Determine the maximum execution time of the program. Execution time (clock cycles) 3 If True 2, if False 5. If True 3, If False 6. 7 1

1. Consider the following program the execution times of its instructions. for (1-0, z=0; i<10; i++) { if (x[i]>3) z=z+x[i] *c[i]; Instruction i=0, z=0 i<10 if(x[i]>3) z-z+x[i]+c[i] i++ A. Determine the minimum execution time of the program. B. Determine the maximum execution time of the program. Execution time (clock cycles) 3 If True 2, if False 5. If True 3, If False 6. 7 1

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Consider: struct S7 { short m1; short m2; short m3; int m4 [12]; struct S7*next; }; int find_m4 (struct S7*p, int i) { return (&(p->m4[i])); } If we wrote find_m4() in x86-64 assembler, which instruction returns the correct value? O movl 8(%rdi, %rsi,4), %eax movq 6(%rdi, %rsi,8), %rax leaq 8(%rdi, %rsi,4), %rax leal 6(%rdi, %rsi,4), %eax None of these
Instructions per second is a measure of a computer's processor speed. For complex instruction set computers, different instructions take different amounts of time, so the value measured depends on the instruction. Evaluate the statement below and show how to compile it by using an instruction set machine of three-address, two-address, and one- address. A*B Y = C+D
Do
6. What is the address of executing the following instruction: MOV CX, [FEH] if you know that DS= DC00H? OCL: DCOFEH, CH: DCOFFH OCL: DCFEH, CH: DCFFH CL: DCFFH, CH: DCFFH CL: DCOFFH, CH: DCOFFH
Have a question requiring an answer in assembly language
Consider the following instructions for i - x to x+3 do v - i for j - 1 to y do V - v*i end for print v end for [NOTE:The statement i+ X replaces the old value of the variable i with the result of evaluating the expression x. For example, if i initially contains 7 then the statement i +x+1 results in i containing 8.] Which of the following cannot be produced by the instructions for any value of x? 64 125 216 343 8 27 64 125 27 64 125 216 9 16 25 36 9 27 81 243
Algorithm A, Algorithm B, and Algorithm C perform the same task. On input of size n, Algorithm A executes 10500n instructions, Algorithm B performs 30n2 instructions, and Algorithm C executes the ceiling of (1/1024) * 2n instructions. Assume each instruction requires the same amount of time in each algorithm. Algorithm A is slower than Algorithm B when the size of the input is less than .... Algorithm A is slower than Algorithm C when the size of the input is less than .... Algorithm C is fastest of the three when the size of the input is less than ....
6
Trace the execution of the following "Super Simple CPU" program and for a) each step record the values of the Accumulator, Mem[10] (memory location 10), Mem[11], and Mem[12]. The values before the execution starts are shown. LOD 11 XXX ТОР JZR JNG SUB 10 STO 11 YYY JMP TOP XXX LDI 1 STO 12 STP LDI 0 YYY STO 12 STP Mem[10] Mem[11] Mem[12] Accumulator 12 24 15
1. Consider a machine running a program with four classes of instructions: A/B/C/D. The program requires 360 seconds, with the number of seconds executing each class as shown in the table below: Instruction Class A B C Time (sec) 100 80 120 60 1.1. By how much is the total execution time changed if the time for class D is reduced by 20% and the time for class C is increased by 10% (assuming no other changes)? 1.2. If we want to reduce the total execution time by 20% by optimizing class A only, what is the target execution time of class A instructions in order to achieve the reduction (assuming all other instructions are not changed)? 1.3. Can the total time be reduced by 25% if we only optimize class B? Use calculation to justify your answer.
E In the following code block(Reference:Q11), you will a set of assembly instructions with corresponding line numbers (line numbers are for informational purpose only and they are not part of the source code). 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 mov edx, 5 dec ecx jmp LABEL1 mov eax, 1 LABEL1: mul edx jmp ecx mov edx, 0678h sub edx, eax jmp DWORD PTR [edx] neg ebx add ecx, ebx mov eax, 0 For each of the conditions/scenario listed below, indicate the corresponding line number (that cause or is associated with the condition/scenario). Enter 0 (Zero) if the condition is not caused by the block of code. 1) Memory indirect jump: type your answer... type your answer... type your answer... type your answer... 2) Register indirect jump: 3) Relative short jump: type your answer... 5) Two's complement type your answer... 4) Relative near jump: 6) Unreachable code