The following instruction set is supported by a simple processor, which is similar to whatwe discussed in the class, with a few new instructions added. The format of mostinstructions is defined as follows.bits 15:14 13:10 9 8:6 5:32:0field unused opcode wsrcl src2 dstwhere the fields are defined as follows.opcode : operation to be performed by the processorwrite back ALU output to register file (1= yes, 0 = no)address of the first ALU operand in the register fileaddress of the second ALU operand in the register fileaddress in the register file where the output is writtenw:srcl:src2:dst:For opcodes BEQ, BLEZ and JUMP, the 6 least significant bits (5:0) give an address inthe instruction memory, which is byte-addressed. The opcode HALT has all operand bits(9:0) being 0. When an instruction has only two operands, the field for the unusedoperand is filled with 0-bits. For example, bits (5:3) for SLL are all zero because src2 isnot used.The opcode and meaning of these instructions are listed in the following table.орcodeADDBinary encodingOperationR[src1] +R[src2]→ R[dst]R[srcl] – R[src2] → R[dst]R[src1] << 1 →R[dst]R[src1] >> 1 → R[dst]|~R[src1] → R[dst]R[src1] ^R[src2] → R[dst]R[src1]|R[src2] → R[dst]R[src1] & R[src2] → R[dst]R[src1] +1 →R[dst]If R[src1] = 0, branch to BAddrIf R[src1]<0, branch to BAddrOx0SUBOx1SLLOx2SRLОх3INVOx4XORОх5ORОх6ANDOx7INCROx8BRZOx9BLEZОХАJump to JAddrStop executionJUMPOxEHALTOxF 1. In this part you are asked to recognize what a given segment of machine code does, by translating itinto assembly code, and annotating it with expressions in a high level language like C. This process,from binary code back to source code, is called "disassembling." Disassemble the following machinecode into operations and arguments, e.g., ADD R1, R2, R3. Explain what the whole program does,either in plain English (e.g., it calculates the product of R1 and R2) or in C type of pseudo code (e.g,R3 = R1 * R2.) Note: you need to make up unique labels for branch instructions in your assemblycode.Addr:CodeОх0007FFОх02240EОх041E0CОх06250AОх0803F9Ox0AOE00Охос24C2ОхОЕ3C00

The instructions are given in the upper table we just have to write ehat each address means and what…

Answered: 1. In this part you are asked to…

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Similar questions

Interrupts are system wide events that stops the execution of a currently running process. Examples of interrupts include (but are not limited to) mouse clicks, process termination, key presses, etc. Some interrupts are considered as more important to be handled first then the others. For example, a hardware interrupt such as hard drive read operation has lesser priority than a memory read. In this way, the most appropriate data structure for representing of such events is the priority queue. Demonstrate by writing an algorithm or a flowchart how to insert the following interrupts in a heap so the highest priority element should move out first. Interrupts Priorities INT 0 100 INT 10 51 INT 11 52 INT 21 54
INSTRUCTIONS: 1. Implement the memory placement algorithms in Java Language Assume we have this scenario: A system contains the following list of memory partitions with the specified size (unit measured by Kilobytes/Kb), where partition marked with 'X' assumed is occupied by a process and thus can't be used for allocation/placement, and 'R' is the most recent placement inside the partitions: X R X 100 20 80 50 50 120 100 Based the given scenario, create a single or several Java programs which perform a simulation of memory placement algorithm using Next Fit algorithm To allow user to test the simulation, each program will allow the user to specify as input, a total (N) of new processes to be placed inside the partitions • a list of N integers (each integer, in Kb, represents the size of a new process to be placed) Assume the user entered some data as input (total=5 processes). Then the program must display the resulting list of process placements such as follows: Total of processes to…
Computer Science A system call in an operating system is typically a function call that traps to the kernel. However, there are also library calls that are functions that do not directly trap into the kernel, but may invoke system calls that do. In MINIX, there is a corresponding library call read that always invokes the system call. In UNIX, there are also several other library calls---getc, fgetc, getchar, for example---that also input data. Describe the difference between the MINIX read library call and these functions. How do you think these functions (getc, fgetc, getchar) perform data input? Do they always need to ultimately trap to the kernel? Why or why not?
Assignment for Computer Architecture Instructions: The assignment is to create a program that adds the number 1/2 to itself a large number of times and adds the number 1/3 to itself a large number of times separately first using type float and then type double. It is to then compare the values of adding the numbers to multiplying 1/2 time the number of times added to compute the “same sum” in a different way. The program will also multiply 1/3 times the number of times 1/3 was added to itself to compute the “same sum” in a different way. The program will then compare these two methods at arrive for the same value and output the difference. Hint, the value for the ½’s will be the same for the smaller numbers of times, the 1/3’s will never be the same. The output from your program is to be to a *.txt file which you are to turn in along with your code. The program must first add the ½’s and 1/3’s using type float and compare to the value obtain using multiplication instead of addition.…
Example: The Problem Input File Using C programming language write a program that simulates a variant of the Tiny Machine Architecture. In this implementation memory (RAM) is split into Instruction Memory (IM) and Data Memory (DM). Your code must implement the basic instruction set architecture (ISA) of the Tiny Machine Architecture: //IN 5 //OUT 7 //STORE O //IN 5 //OUT 7 //STORE 1 //LOAD O //SUB 1 55 67 30 55 67 1 LOAD 2- ADD 3> STORE 4> SUB 5> IN 6> OUT 7> END 8> JMP 9> SKIPZ 31 10 41 30 //STORE O 67 //OUT 7 11 /LOAD 1 //OUT 7 //END 67 70 Output Specifications Each piece of the architecture must be accurately represented in your code (Instruction Register, Program Counter, Memory Address Registers, Instruction Memory, Data Memory, Memory Data Registers, and Accumulator). Data Memory will be represented by an integer array. Your Program Counter will begin pointing to the first instruction of the program. Your simulator should provide output according to the input file. Along with…
Create a program in C++ which simulates a direct cache. The memory array that contains the data to be cached is byte addressable and can contain 256 single byte entries or lines. The cache has only 8 entries or lines. The Data field in each line of the cache is 8 bits. Since the data stored in each line of the cache is only 8 bits, there is no need for a line field. Only a tag field is needed which is log2(256) = 8 bits. The memory array can be filled with any values of your choice. The program should work by taking user input of a memory address (index). This input represents the memory data that should be cached. Your program will check the cache to see if the item is already cached. If it is not, your program should count a cache miss, and then replace the item currently in the cache with the data from the inputted address. Allow the user to input addresses (in a loop), until they so choose to end the program. The program should output the number of cache misses upon ending.
The following program has been written for the simple central processing unit introduced in class. The table below shows the initial content of the 16 memory cells. The first column denotes the memory address and the second column shows the memory content in hexadecimal notation. Cell Нех Binary Assembler Description 2f ба 4f 21 71 41 a9 do 6f 01 11 02 12 03 13 04 14 05 15 06
The Java bytecode for access to the local variable array for a class is at most two bytes long. One byte is used for the opcode; the other indicates the offset into the array. How many variables can be held in the local variable array? What do you think happens when this number is exceeded?
Instruction: Please write this code in javascript and let me know if there is an issue. Questions 1. Description a). You are to develop a JavaScript file (problems.js) that contains the implementation of 5functions. Each function is represented as one step, b). Each function is independent and solves a unique problem, as such, treat and implement each function in isolation of the others, that is, you should only focus on one problem at a time. 2). Objective • Write decision-making statements and control structures to solve problems• Apply programming logic to solve basic to intermediate problems• Testing and debugging
Problem DescriptionThe Tower of Hanoi ProblemTower of Hanoi is a mathematical game consisting of three pegs (P1, P2 and P3) and a stack of disks of different diameters. Disks can slide onto any peg. The game starts with all disks stacked on P1 and ends at the point where all disks stacked on P3. The game player is required to move all disks from P1 to P3 using P2 as a buffer. Three rules must be followed when playing the game(1) Only one disk may be moved at a time.(2) Each move involves taking a disk on the top of a peg and place it on the top of another peg. (3) A disk of a larger diameter should never be placed on top of a disk of a smaller diameter. The diagrams below demonstrate the starting state and goal state of the game with 5 disks.Starting state Goal stateP1 P2 P3 P1 P2 P32RequirementsIn this assignment, students are required to solve the Tower of Hanoi (with five disks) using state space search algorithms implemented in Python.Two state space search algorithms: (1) a blind…
Suppose that you are working with a CISC machine using a 2.5 GHz clock (i.e., the clock ticks 2.5 billion times per second). This particular computer uses MASM-like instructions with the following timings: ADD reg, mem ; 7 clock cycles (i.e., the ADD micro-program has 7 instructions) ADD reg, immed ; 4 clock cycles LOOP Label Name ; 6 clock cycles Suppose that the following code fragment is used to sum elements of a numeric array. For this problem, assume that memory limitations are non-existent and that there is no limit to the size of the array. MOV BX, 0 ECX, MAX SIZE MOV MOV ESI, OFFSET list _ProcessArray: ADD AD LOOP BX, [ESI] ESI, _ProcessArray ;initialize sum ; initialize LOOP counter ; initialize array pointer ;Add current list element ; Move array pointer next element ; auto-decrement ECX, jump to more if ECX = 0 After initialization, how many array elements can be processed in 3.1 millisecond (ms)? Round your answer to the nearest integer. Note that 1 ms = 0.001 second.
Write the mnemonics of the following program: The pressure of two boilers is monitored and controlled by a microcomputer works based on microprocessor programming. A set of 6 readings of first boiler, recorded by six pressure sensors, which are stored in the memory location starting from 2050H. A corresponding set of 6 reading from the second boiler is stored at the memory location starting from 2060H. Each reading from the first set is expected to be higher than the corresponding position in the second set of readings. Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. If all the readings of first set is higher than the second set, store 00 in the ‘D’ register. If any one of the readings is lower than the corresponding reading of second set, stop the process and store FF in the register ‘D’. Data (H): First set: 78, 89, 6A, 80, 90, 85 Second Set:71, 78, 65, 89, 56, 75

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

Microsoft Visual C#

Computer Science

ISBN:

9781337102100

Author:

Joyce, Farrell.

Publisher:

Cengage Learning,

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning

Microsoft Visual C#

Computer Science

ISBN:

9781337102100

Author:

Joyce, Farrell.

Publisher:

Cengage Learning,

EBK JAVA PROGRAMMING

Computer Science

ISBN:

9781337671385

Author:

FARRELL

Publisher:

CENGAGE LEARNING - CONSIGNMENT

SEE MORE TEXTBOOKS