(1) Consider the MARIE program below.Hex AddressLabelStart,101102ADD Z103STORE W104CLEARM105106LOAD YSUBT WSTORE W107108HALT109X,Y,Z,10010A10B10CX'>`~`=`W,a. Draw the symbol tableInstructionLOAD XSUBT YHEX OOFFDEC 15HEX 0010HEX 0000Hexadecimal code for each instructionb. What is the value store in the AC, X, Y, Z, W when the program terminates.

Name: (1) Consider the MARIE program below.Hex AddressLabelStart,101102ADD
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: (1) Consider the MARIE program below.Hex AddressLabelStart,101102ADD Z103STORE W104CLEARM105106LOAD YSUBT WSTORE W107108HALT109X,Y,Z,10010A10B10CX'>`~`=`W,a. Draw the symbol tableInstructionLOAD XSUBT YHEX OOFFDEC 15HEX 0010HEX 0000Hexadecimal code

SOLUTION: Hexadecimal code for each instruction: Hex address Label Instruction Hexadecimal code…

Engineering

Computer Science

(1) Consider the MARIE program below. Hex Address Label 100 Start, 101 102 103 104 T 105 106 107 108 109 X, 10A Y, Z, W, a. Draw the symbol table 10B 10C Instruction LOAD X SUBT Y ADD Z STORE W CLEAR LOAD Y SUBT W STORE W HALT HEX OOFF DEC 15 HEX 0010 HEX 0000 Hexadecimal code for each instruction b. What is the value store in the AC, X, Y, Z, W when the program terminates.

(1) Consider the MARIE program below. Hex Address Label 100 Start, 101 102 103 104 T 105 106 107 108 109 X, 10A Y, Z, W, a. Draw the symbol table 10B 10C Instruction LOAD X SUBT Y ADD Z STORE W CLEAR LOAD Y SUBT W STORE W HALT HEX OOFF DEC 15 HEX 0010 HEX 0000 Hexadecimal code for each instruction b. What is the value store in the AC, X, Y, Z, W when the program terminates.

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

Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. 8 bits are used for offset, 8 bits are used for page # and the max number of pages a process can have is 256. e. Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert hexadecimal numbers to decimal ones.) 0x0389 0xDF78 0x0245 0x8012 f) Now, suppose that the OS uses a two-level page table. Draw the page table. (Assume that frames 7 through 221 are free, so you can allocate space for the page table there.) In addition, suppose that the page-table directory storage comprises a whole number of consecutive full frames. (For examples: if the directory entry is 2 bytes, the entry’s storage comprises 1 frame; if the directory entry is 260 bytes, the entry’s storage comprises 2 consecutive frames.) g)What is the size of the two-level page table…
For a microprocessor the code segment starts at 20000H, and stack segment starts at 21000H.Physical addresses from 21000H to 2FFFFH are accessible from both code and stack segment.These are the physical addresses.● If a location has CS: IP=2000H: 3000H, can we access this location with SS: SP? If yes,what is the SS: SP for this location? If no, why is it not accessible?● If another location has CS: IP=2000H: 0030H, can we access this location with SS: SP? Ifyes, what is the SS: SP for this location? If no, why is it not accessible?
A 32-bit computer has a memory of 256 KB and a cache line size of 64 bytes. The memory cache access time is 5ns. This cache is 4-way associative and use LRU as a replacement algorithm. a) What is the number of lines and sets of this memory cache? b) What is the block size transferred between the cache memory and the main memory? c) If the time to transfer a line to cache memory is 200 ns, what is the hit ratio needed to obtain an average access time of 20 ns?
In the MAC address table, a dynamic RAM is utilised to store MAC addresses. Assume the table size is 8000 and the memory access time is 100 nanoseconds. What is the worst-case look-up time if a binary search is employed to locate an address?
A computer with 32 bits virtual address uses a two-level page table. Virtual addresses are split into a 10 bits top-level page table field (PT1), a 10 bits second-level page table field (PT2), and an offset. How many PT1, PT2, and offset with virtual address 0x00403008? A. PT1=1; PT2=1; offset=8B. PT1=1; PT2=3; offset=8C. PT1=4; PT2=3; offset=8D. PT1=4; PT2=1; offset=8
Suppose that DS=1000H, SS= 2000H, CS=3000H, ES=4000H, BP=FFH, BX=FFFFH and DI=5H.i. Which memory locations are addressed by: MOV DL, [BP]?ii. Which memory locations are addressed by: MOV EAX, [BX+DI]?
4. Given that the main memory size is 32KB, the page size is 64B, the word size is 1B, and n-level paging is applied. What is the page number size? If (5, 10) is a record in the outer page table stored in PCB and (9, 7) is a record in the inter page table stored in page frame No.10, what is the physical address of the logical address 0010101001000110 in HEX?
a) In the SRAM region, what is the corresponding bit-band alias address for the bit [4] of the memory address of 0 * 2000008 b) In the Peripheral region, if the value in the alias address 0 * 4200 0088 to 0 * 4200 008B was set to 0x00000001, what is the bit # and the address in the peripheral region that wants to set to 1?
We have a full associative mapping cache memorywith globally 65536 = 2^16 lines. Each line is hosting32 data. How many bits are necessary for the TAG fora 24 bits address bus?3 A19 B21 CNone of previous answers solve this question in great detail explaining every single bit of info as i'm a complete beginner and i need to understand how to solve questions of this type. also provide small examples of how the solution would differ if the question was slightly altered. THANK YOU!
You are given the following data about a virtual memory system:(a) The TLB can hold 512 entries and can be accessed in 1 clock cycle (1nsec).(b) A page table entry can be found in 100 clock cycles or 100 nsec.(c) The average page replacement time is 9 msec.If page references are handled by the TLB 99% of the time, and only 0.01%lead to a page fault, what is the effective address-translation time?
Consider a logical address with a page size of 16 KB. How many bits must be used to represent the page offset in the logical address? A) 10 B) 12 C) 16 D) 14
Suppose that CS=1500h and CX=CEADh, an instruction JMP[CX[ occurs which is located at 23FFFh. What address will the program jump to assuming real mode? a. 21EADh and 21EAEh b. Content of addresses 21EADh and 21EAEh c. 21EADh d. 21EAEh