Suppose the implementation of an instruction set architecture uses two classes of instructions, which arecalled A and B. The total dynamic instruction count is 3 x 10^6. Details for the two classes are given inthe table below:ClassCPI% of instructionsA|240%B2.2|60%Complete the following table. Express all answers in scientific notation and round to two decimalplaces, when needed.ClassInstruction CountNumber of Clock Cyclesх 10^х 10^Ax 10^x 10^B

It is given that: total dynamic instruction count = 3 x 106 Processor's clock rate = 3.2 GHz…

Suppose the implementation of an instruction set architecture uses two classes of instructi called A and B. The total dynamic instruction count is 3 x 10^6. Details for the two classes the table below: Class CPI % of instructions 2 40% В 2.2 60% Complete the following table. Express all answers in scientific notation and round to two d

Suppose the implementation of an instruction set architecture uses two classes of instructi called A and B. The total dynamic instruction count is 3 x 10^6. Details for the two classes the table below: Class CPI % of instructions 2 40% В 2.2 60% Complete the following table. Express all answers in scientific notation and round to two d

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

Download the skeleton program simplearithmetic2.asm from our course Canvas site (look in the Modules section) and take a look at it. You are supposed to implement the arithmetic function: 2*a+b-16*c-60, where: a = -5, b=12, c = 5. You have to ensure that variables a, b, c, MUST be stored in registers $t0,$t1,$t2, respectively, and that the result MUST be stored in register $t3. In addition, the multiplication factors MUST ONLY be implemented by using bit-shift left. You can use either addi or li to assign value to registers. a) Write down (or type) the missing code here after you've verified it by running it on spim. b) Write down (or type) exactly what you see printed out on your display after you run this. Is it what you expected? Why? c) In hexadecimal format, what is the value stored in register $t3 at the conclusion of this program? Explain how you got to thi. answer.
Implement in C programming language: Question 2 Write a c program that will generate the safe sequence of process execution for the situation given below:(Use Banker’s Algorithm). Note: The code can be implemented in several different ways, but make sure the parameter remains the same as shown below. n = 6; // Number of processes m = 4; // Number of resources int alloc[6][4] = { { 0, 1, 0, 3 }, // P0 // Allocation Matrix { 2, 0, 0, 3 }, // P1 { 3, 0, 2, 0 }, // P2 { 2, 1, 1, 5 }, // P3 { 0, 0, 2, 2 }, // P4 {1, 2 , 3, 1 } }; //P5 int max[6][4] = { { 6, 4, 3, 4 }, // P0 // MAX Matrix { 3, 2, 2, 4 }, // P1 { 9, 1, 2, 6 }, // P2 { 2, 2, 2, 8 }, // P3 { 4, 3, 3, 7 }, // P4 { 6, 2 , 6, 5 } }; //P5 int avail[4] = { 2, 2, 2, 1 };…
The Dirtcheap Software Company is planning to produce an assembler for a computer with a 48-bit word. To keep costs down, the project manager, Dr. Scrooge, has decided to limit the length of allowed symbols so that each symbol can be stored in a single word. Scrooge has declared that symbols may consist only of letters, except the letter Q, which is forbidden (to demonstrate their concern for efficiency to the custo- mers). What is the maximum length of a symbol? Describe your encoding scheme.
Implement SRTF (SJF with preemption) scheduling algorithm in C programming. NOTE: Please do not print the average waiting time and the average turnaround time. You are required to compute these for each process and print the values for each process separately. Add comments in the code so that the code is understandable. Take input from the user: the number of processes, their CPU burst times and arrival times for n number of processes. Compute and print the completion Time(CT), Turnaround Time(TAT), and Waiting Time(WT) for each process using C Programming
2. Implement the frame replacement algorithm for virtual memory In Java For this task, you need to perform the simulation of page replacement algorithms. Create a Java program which allows the user to specify: • the total of frames currently exist in memory (F), the total of page requests (N) to be processed, • the list or sequence of N page requests involved, For example, if N is 10, user must input a list of 10 values (ranging between 0 to TP-1) as the request sequence. Optionally you may also get additional input, the total of pages (TP) This input is optional for your program/work. It only be used to verify that each of the page number given in the request list is valid or invalid. Valid page number should be within the range 0, .. , TP-1. Page number outside the range is invalid. Then use the input data to calculate the number of page faults produced by each of the following page replacement algorithms: • First-in-first-out (FIFO) - the candidate that is the first one that entered…
Downvote incorrectly done. _A pure full Implement c/c++ to evaluate round robin algorithm. You must use the job list given here: Job (1) arrive at CPU cycle1 Job (2) arrive at CPU cycle2 Job (3) arrive at CPU cycle36 I/O (32) CPU (54) I/O (45) CPU (20) I/O (40) CPU (48) CPU (39) CPU (48) I/O (55) Your job list must contain CPU bust and I/O bust as above. Quantum time = [5, 10, 15, 20, 25, 30, 35, 40, 45, 50, 55, 60] The evaluation of the most suitable quantum time needs to consider the followingperformance metrics, but not limited to:(i) Turnaround time of the jobs;(ii) Waiting time of the jobs; and(iii) Number of interrupts incurred The code must able to read csv file format of the job list as input file. The code must able for user to input time quantum.. .
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…
8. Consider the following C code snippet. // c code void setArray(int num) { int i=5; compare (4, i); int compare (int a, int b) { if (sub (a, b) >= 0) return 1; else return 0; int sub (int a, int b) { return a - b; Implement the C code snippet in ARM assembly language. Use R4 to hold the variable i.
The Java Virtual Machine (and your computer’s assembly language) support a goto instruction so that the search can be “wired in’’ to machine code, like the program at right (which is exactly equivalent to simulating the DFA for the pattern as in KMPdfa, but likely to be much more efficient). To avoid checking whether the end of the text has been reached each time i is incremented, we assume that the pattern itself is stored at the end of the text as a sentinel, as the last M characters of the text. The goto labels in this code correspond precisely to the dfa[] array. Write a static method that takes a pattern as input and produces as output a straight-line program like this that searches for the pattern. Straight-line substring search for A A B A A A int i = -1;sm: i++;s0: if (txt[i]) != 'A' goto sm;s1: if (txt[i]) != 'A' goto s0;s2: if (txt[i]) != 'B' goto s0;s3: if (txt[i]) != 'A' goto s2;s4: if (txt[i]) != 'A' goto s0;s5: if (txt[i]) != 'A' goto s3; return i-8;
Write a code in sim8085 for the following problem: 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
Write a program in C language to sort the elements of 1D array in descending order and alsoimplement linear search on the same array. Both sorting and searching operationsshould be done inside one user defined function: “Task”. So, for achieving the requiredfunctionality, pass, array into the function: Task () from main () using Pass by reference/or address approach.
In this problem we want to modify the single cycle datapath shown below (also in in slide #1 of "chapter3_single_cycle_datapaths.pptx") so that it supports execution of a new instruction called jump register (jr). PC Add Read address Instruction [31:0) Instruction [25:21) Instruction [20:16] Instruction Instruction [15:11] memory (DMUXT RegDst Instruction [15:0] RegWrite Read register 1 Read register 2 Read data 1 Write Read register data 2 Write data Registers 16 Sign- extend Instruction [5:0] 32 Shift left 2/ ALUSrc (OMUXI) ALU Addresult Zero ALU ALU result ALU control ALUOP #copy contents of "rs" register to PC (PC = $rs) PCSrc ( E3X MemWrite Read data Address Data Write memory data MemRead MemtoReg (-MUXO) jr $rs You are allowed to add new control signal(s), wire(s), muxe(s) to support this instruction. First briefly explain the required modifications. Then indicate the value of each control signal (RegDst, RegWrite, ALUSrc, ALUOP, MemRead, Mem Write, MemToReg). You must use "X"…