tapati ign on side no. 26 with added b Jump nown III slide 33 in Chapter 4 (part 1). Let's assume a program has 500 instructions. These instructions are distributed as follows: R-Type 25% Immediate arithmetic (addi) 5% Load 20% Store 20% Branch 10% Jump 20% Answer the following questions (show calculations): a) How many instructions will use instruction memory? b) How many instructions will use data memory? c) How many instructions will use the sign extend block? d) In the clock cycles, where the sign extend block is not required, does it remain idle? If yes, how? If not, what happens to the output of the block in that cycle?

tapati ign on side no. 26 with added b Jump nown III slide 33 in Chapter 4 (part 1). Let's assume a program has 500 instructions. These instructions are distributed as follows: R-Type 25% Immediate arithmetic (addi) 5% Load 20% Store 20% Branch 10% Jump 20% Answer the following questions (show calculations): a) How many instructions will use instruction memory? b) How many instructions will use data memory? c) How many instructions will use the sign extend block? d) In the clock cycles, where the sign extend block is not required, does it remain idle? If yes, how? If not, what happens to the output of the block in that cycle?

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

Use assembly language.
1. a) Given a recursive algorithm as below: int F(int n) { if (n <= 1) return 1; else if (n % 2 == 0) return F(n-1) + n; else return F(n/2) - 1; } Illustrate how you will find out the value of F(10) using the above algorithm. You need to show all the steps. b) Given a function as below: int recFx(int a, int b) { If (a < b) return a +b; else return recFx(a - b, b + 1); } Determine the values of: recFx(-10, 8) recFx(148, 78) (11) Must show all the steps.
Programinf language is C
Problem B Musical Key ConversionThe chromatic scale is a 12-note scale in music in which all notes are evenly spaced: that is, the ratio of the frequency between any two consecutive notes is constant. The notes are typically labeled in the following sequence: A, A#, B, C, C#, D, D#, E, F, F#, G, G# After G#, the labels loop back and start over with A (one octave higher). To convert between musical keys, you can shift all notes in a piece of music a constant number of steps along the scale above. For example, the sequence of notes E, E, F, G, G, F, E, D, C, C, D, E, E, D, D can be converted to another musical key by shifting everything up three steps: E, E, F, G, G, F, E, D, C, C, D, E, E, D, D G, G, G#, A#, A#, G#, G, F, D#, D#, F, G, G, F, F Notice that G was converted to A#, since going three steps up required us to loop off of the top of the scale back to the bottom: G -> G# -> A -> A#. Technically we should note that this would be A# of the next octave up, but we’ll…
Problem-39 Write a recursion formula for the running time T(n) of the function whose code is below. def Function3(n): if n <= 0: return for i in range(0, 3): Function3(0.8 n) This loop executes 3 times with recursive value of n/3 value Function3(20)
Language is c++ picture includes instructions and sample outputs with user inputs in bold
3. Write a program to obtain inverse matrix by entering a 3*3 matrix from the user.(using visual studio) output screen Enter the first line : 00 00 00 Enter the secon line : 00 00 00 Enter the third line : 00 00 00 entered matrix 00 00 00 00 00 00 00 00 00 inverse matrix is 00 00 00 00 00 00 00 00 00
Question 1: Please develop a program. The program shows a O(n^2) time complexity. You may design nested loops. When you input a number, the output should be how many times of the loops. For example, if your input is 10, the number of loops should be 100 times, 200 times, 300 times, etc. The number of loops do not have to be an accurate number. Question 2: Please develop a program. The program shows a O(nlgn) time complexity. You may design nested loops. When you input a number, the output should be how many times of the loops. For example, if your input is 10, the number of loops should be 30 times, 60 times, etc. The number of loops do not have to be an accurate number.
Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"
Develop JAVA code for the given problem statement: In Afghanistan N Taliban Soldiers are lined up for a memory test. They are numbered from O to N-1 from left to right. In the test, there are M rounds. In each round, Taliban Captain selects one position. Soldier at that position will be numbered 0. All the Taliban Soldiers to the right of selected position will be numbered one greater than the soldier to his left. All the Taliban Soldiers to the left of selected position will be numbered one greater than the soldier to his right. After M rounds, the Taliban Captain asked each soldier to shout out the greatest number he was assigned during the M rounds. Input: 1 3 1 1 Output: 101
AIM- Write an 8085 sequence to check whether the first set of reading is higher than the second one or not. PROBLEM STATEMENT- 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,…
C++ and pseudocode