Assuming that DI=100 , DS= 140016, SI=FF0016, BX= AE00,e, AX=10061s and the memorycontents explained in the Tablel. Hand trace the execution of the followingTable 1Memory MemoryprogramMOV SI, [BX+33H)AddressContentMUL SIIEE3092ADD AL, DHIEE31EACMP AL, 4E1eIEE32F5Then answer the following questions:IEE33621- What are the values of registers in each statement?2- What is the effect to the flag registers after execution ADD instruction in1EE34221EE358Bthe third statement of the program?

Name: Assuming that DI=100 , DS= 140016, SI=FF0016, BX= AE00,e, AX=10061s a
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: Assuming that DI=100 , DS= 140016, SI=FF0016, BX= AE00,e, AX=10061s and the memorycontents explained in the Tablel. Hand trace the execution of the followingTable 1Memory MemoryprogramMOV SI, [BX+33H)AddressContentMUL SIIEE3092ADD AL, DHIEE31EACMP A

1.) Suppose the data given to the code is db 5, 10, 15, 0we are given the data in…

Engineering

Computer Science

. Assuming that DI=100 , DS= 140016, SI-FF00, BX= AE001, AX-100614 and the memory contents explained in the Tablel. Hand trace the execution of the following Table 1 Memory Memory program MOV SI, (BX+33H) Address Content MUL SI IEE30 92 ADD AL, DH IEE31 EA CMP AL, 4E14 IEE32 F5 Then answer the following questions: IEE33 62 1- What are the values of registers in each statement? 1EE34 22 2- What is the effect to the flag registers after execution ADD instruction in 1EE35 8B the third statement of the program?

. Assuming that DI=100 , DS= 140016, SI-FF00, BX= AE001, AX-100614 and the memory contents explained in the Tablel. Hand trace the execution of the following Table 1 Memory Memory program MOV SI, (BX+33H) Address Content MUL SI IEE30 92 ADD AL, DH IEE31 EA CMP AL, 4E14 IEE32 F5 Then answer the following questions: IEE33 62 1- What are the values of registers in each statement? 1EE34 22 2- What is the effect to the flag registers after execution ADD instruction in 1EE35 8B the third statement of the program?

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

Modiflow y the beprogram given to include response time program;FCFS CPU SCHEDULING ALGORITHM #include<stdio.h>#include<conio.h>main(){int bt[20], wt[20], tat[20], i, n; float wtavg, tatavg;clrscr();printf("\nEnter the number of processes -- "); scanf("%d", &n);for(i=0;i<n;i++){printf("\nEnter Burst Time for Process %d -- ", i); scanf("%d", &bt[i]);}wt[0] = wtavg = 0; tat[0] = tatavg = bt[0];for(i=1;i<n;i++){wt[i] = wt[i-1] +bt[i-1];tat[i] = tat[i-1] +bt[i]; wtavg = wtavg + wt[i]; tatavg = tatavg + tat[i];}printf("\t PROCESS \tBURST TIME \t WAITING TIME\t TURNAROUND TIME\n");for(i=0;i<n;i++){printf("\n\t P%d \t\t %d \t\t %d \t\t %d", i, bt[i], wt[i], tat[i]);}printf("\nAverage Waiting Time -- %f", wtavg/n);printf("\nAverage Turnaround Time -- %f", tatavg/n); getch();}
) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
instruction is in the first picture please give me only implementation of int L1lookup(u_int32_t address) and int L2lookup(u_int32_t address) cacheSim.h #include<stdlib.h>#include<stdio.h>#define DRAM_SIZE 1048576typedef struct cb_struct {unsigned char data[16]; // One cache block is 16 bytes.u_int32_t tag;u_int32_t timeStamp; /// This is used to determine what to evict. You can update the timestamp using cycles.}cacheBlock;typedef struct access {int readWrite; // 0 for read, 1 for writeu_int32_t address;u_int32_t data; // If this is a read access, value here is 0}cacheAccess;// This is our dummy DRAM. You can initialize this in anyway you want to test.unsigned char * DRAM;cacheBlock L1_cache[2][2]; // Our 2-way, 64 byte cachecacheBlock L2_cache[4][4]; // Our 4-way, 256 byte cache// Trace points to a series of cache accesses.FILE *trace;long cycles;void init_DRAM();// This function print the content of the cache in the following format for an N-way cache with M Sets// Set 0…
Generate a listing file for AddTwoSum.asm(in 3.4.3 of the text) and write a description of the machine code bytes generated for each instruction. You can write your descriptions directly over the .lst file. You might have to guess at some of the meanings of the byte values. ; AddTwoSum.asm - Chapter 3 example. .386.model flat,stdcall.stack 4096ExitProcess proto,dwExitCode:dword .datasum dword 0 .codemain proc mov eax,5 add eax,6 mov sum,eax invoke ExitProcess,0main endpend main
In the Intel 8086 microprocessor, suppose the register AX contains the data 35AB H. What will be the contents of AX after executing the following programs? Assume that the initial content on the Carry Flag (CF) is one for all the calculations. You MUST clearly show ALL your steps in obtaining your final result for getting full and/or partial credit. Please present your final result in Hexadecimal format. (a) MOV CL,04H SHR AX,CL RET (b) MOV CL,04H RCR AX,CL RET
Consider a program that declares global integer variables x, y[10]. Thesevariables are allocated starting at a base address of decimal 1000. All thesevariables have been initialized to zero. The base address 1000 has been placed in$gp. The program executes the following assembly instructions:lw $s1, 0($gp)addi $s1, $s1, 25sw $s1, 0($gp)lw $s2, 12($gp)add $s2, $s2, $s1sw $s2, 8($gp)sw $s2, 12($gp) What are the memory addresses of variables x, y[0], and y[1]? What are the values of variables x, y[0], y[1], and y[2] at the endof the program?
Let's say that p is a pointer to memory and the next four bytes in memory (in hex) beginning at p's address are: 89 AB CD EF. After the following code is run on a little-endian computer what are the values of x, y, and the four bytes in memory beginning at p's address. Answer for x and y in four digits of upper-case hexadecimal (eg, 0AC6). Answer for memory as eight digits of upper-case hexadecimal with a single space between each byte (eg, 89 AB CD EF). x: y: mem at p:
The following data segment starts at memory address 1000h (hexadecimal) .data printString BYTE "ASSEMBLY IS FUN",0 moreBytes BYTE 25(DUP)0 dateIssued DWORD ? dueDate DWORD ? elapsedTime Word ? What is the hexadecimal address of dueDate ? a. 1045h b. 1029h c.1010h d. 102Dh
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.
Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=8and is in powers of 2 (e.g. 8, 16, 32, etc.). Your main routine shall generate a random page trace of length n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the FIFO page replacement algorithm (as a separate function within your program). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main routine shall then record the number of page faults for each run (i.e. for each f).Run your program using a page…
Typing ps alone lists the current running processes. lab3.c can be compiled as, gcc –o lab3 lab3.c. The output of the program can be obtained by typing: ./lab3. Below are the examples of the possible outputs that would be generated by the ps and ./lab3 commands: ps ./lab3 PID TTY TIME CMD 13043 pts/0 00:00:00 bash 13133 pts/0 00:00:00 ps Process ID is: 13126 Parent Process ID is 13125 Process ID is: 13125 Parent Process ID is 13124 Process ID is: 13127 Parent Process ID is 13124 Process ID is: 13124 Parent Process ID is 13043 Please remember that PID value of bash (Unix command shell) is 13043 for this example. So the process tree can be drown by using the above information as: Write the output of your program and draw a process three and label the processes with their process IDs. Output Process Tree Process ID is: _________ Parent Process ID is _________ Process ID is: _________ Parent Process ID is…
10.- Consider the following code and pictureLoop1MOVLW 0x32MOVWF REG2DECFSZ REG2,FGOTO LOOP1 If the system clock frequency is aMHz and each machine cycle consumes 4 cycles of it. Calculate the delay time of the LOOP1 loop. Include the execution difference time of the DECFSZ instruction in the last cycle. Select an answerA) 0.6.sB) 6msC)6usD) 60us