Q2: Fill the following blanks with correct words: 1. If DX=0100H, AX=0000H, and BX=0100H; after executing (DIV BX), AX= 2. - the portion of a computer system that carries out the instructions of a computer program 3. Each segment register can points to a memory with size = ------- within the 8086 memory. 4. The size of the instruction queue is 5. suppose that a result of a computation was 11010010, PF value will be-

Q2: Fill the following blanks with correct words: 1. If DX=0100H, AX=0000H, and BX=0100H; after executing (DIV BX), AX= 2. - the portion of a computer system that carries out the instructions of a computer program 3. Each segment register can points to a memory with size = ------- within the 8086 memory. 4. The size of the instruction queue is 5. suppose that a result of a computation was 11010010, PF value will be-

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 26VE: _____ is a CPU design technique in which instruction execution is divided into multiple stages and...

See similar textbooks

Similar questions

int i = 5; is a statement in a C program. A. during execution, value of i may change but not its address B. during execution both the address and value may change C. repeated execution may result in different addresses for i D. i may not have an associated address
The table below shows a segment of primary memory from a Von Neumann model computer Address Data 10101000 10001000 11001000 10011001 10100000 10101010 10110100 10111011 10001100 11001100 The program counter (PC) contains a value of 11001000. Find the value (in binary) that will be placed in MAR (memory address register)? MAR (in binray) %3D Find the value (in binary) that will be placed in MBR (memory buffer register)? MBR = (binray) %3D
Computer Science Write an assembly language program for the 8085 Microprocessor to find the smallest of the given three numbers.Input: 2230H: 3AH2231H: A3H2232H: 18HStore the result in memory location 2250H.Note: Starting Address of the Program (Mnemonic) Code: 2200H
Using the Assembly Language Programming of 8086, write and simulate a program that adds two data 0010h and 0010h, and would only stop adding when it gets a result of 0100h. Go over each line of the code. Write your explanation of what each line does as a comment after the line
Write a small assembly language loop that calculates the arithmetic mean of an array. Let the array be called data points with n elements. You can use any assembly language you like, though it should be fairly RISC-like. Once you have that written, show how you can:•Reorder one instruction•Reorder two instructions•Try to reorder three instructions (or show why it's not possible) I know other students have posted similar questions and they are all answered, but those answers do not seem correct, so please do not copy from them
The class I'm taking is assembly programming. ***My compiler is visual studio. x86 on windows. must use masm.*** I am completely stuck. I have wrote the instructions for the program below. ****i have attached my work please look it over and tell me how to fix errors. Instructions: Implement the following pseudocode in x86 assembly language. Use short-circuit evaluation and assume that num1 and RESULT are 32-bit variables. if ( num1 > ecx ) AND ( ecx > edx ) RESULT = 1 else RESULT = 2; ***Title your branch label using the 1st letter of your first name and last name. For example, Ann Napa's conditional branch label would be AN: Step through your program with a debugger to see exactly what is going on as you test your program branching execution.
Task Write a program in the ARMLite assembly language which generates the Fibonacci number F(12) and stores the value in register R6. • You must use a loop to generate the value. Partial marks will be given for otherwise correct but non-loop based solutions • There is no limit on the number of registers you can use • The stack memory may be used, but is not required • Other memory access is not allowed or needed • Add a comment to the top of your program describing it's behaviour. You should make use of comments to describe your code's sections. Submit your program as a plain text file. If you are using the ARMLite simulator, it can be exported directly using the 'Save' button.
Write and simulate a MIPS assembly-language routine that: 1. Prints your group number, for example “Group 1”, 2. Computes the dot product of two vectors, A_vec and B_vec, as described in Lab 4 of the Lab Manual, 3. Stores the result at memory word DOTPROD, and 4. Prints the result preceded by the phrase: “The result of the dot product is: “. Your data segment should look like the following: .data group: .asciiz “\nGroup x” msg: .asciiz "\nThe result of the dot product is: " A_vec: .word x, 4, 20, 13, 3, 10, 5 B_vec: .word 4, 2, 1, 2, 5, 2, 4 n: .word 7 DOTPROD: .word 0 Replace each “x” with your group number.
Computer organization and assembly language Please help me with this. I have to write line by line what each line of codes does. CODE IS BELOW: .model small .386 .stack 100h .data msg1 db 13, 10, "Enter any number --> ", "$" msg2 db "Enter an operation +,- * or / --> ",13, 10, "$" msg3 db "The Operation is --> ", "$" msg4 db "The result is --> ", "$" By_base dd 21 by_10 dd 10 ; 32 bits variable with initial value = 10 sp_counter db 0 ; 8 bits variable with initial value of zero disp_number dd 0 ; 32 bits variable with initial value = 0 disp_number2 dd 0 disp_number3 dd 0 op_type db 0 last_key dd 0 ; 32 bits variable with initial value of zero remainder db 0 .code main proc mov ax,@data;set up datasegment movds,ax mov dx,offset msg1 call display_message callm_keyin calloperation mov dx,offset msg1 calldisplay_message callm_keyin cmpop_type, "+" jnz short skip_plus callop_plus skiP_plus: cmp op_type, "-" jnz short skip_minus callop_minus…
Part 2: Status Flags There are more registers inside of the CPU that we don't have direct access to. One of these is the EFLAGS register. This register holds the values of the flags used in the CPU's operation. Flags are just single bit values that represent the state of the processor - usually 1 means a setting is on or true, and 0 means it is off or false. If a flag has the value 1, we say the flag is set. If it has the value 0, we say it is clear. "Setting" a flag means setting it's value to 1, and "clearing" a flag means setting its value to 0. The status flags are flags that show the outcomes of certain operations. These can be used to check the state of the computations and react accordingly. For example, the carry flag is set if the result of an unsigned addition is too large to fit into the same space as the numbers used during the addition. Look at the following addition operation: 11111111 + 00000001 = 100000000 Note that the result of the addition is 9 bits long, even…
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…
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?