5. Assume a computer has a physical memory organized into 64-bit words. Give the word address and offset within the word for each of the following byte addresses: 0, 9, 27, 31,120, and 256.
6. Extend the above exercise by writing a computer program that computes the answer. The program should take a series of inputs that each consist of two values: a word size specified in bits and a byte address. For each input, the program should generate a word address and offset within the word. Note: although it is specified in bits, the word size must be a power of two bytes.
Answers
Answer:
see explaination and attachment
Explanation:
5.
To convert any byte address, By, to word address, Wo, first divide By by No, the no. of bytes/word, and ignores the remainder. To calculate a byte offset, O, in word, calculate the remainder of By divided by No.
i) 0 : word address = 0/8 = 0 and offset, O = 0 mod 8 = 0
ii) 9 : word address = 9/8 = 1 and offset, O = 9 mod 8 = 1
iii) 27 : word address = 27/8 = 3 and offset, O = 27 mod 8 = 3
iv) 31 : word address = 31/8 = 3 and offset, O = 31 mod 8 = 7
v) 120 : word address = 120/8 = 15 and offset, O = 120 mod 8 = 0
vi) 256 :word address = 256/8 = 32 and offset, O = 256 mod 8 = 0
6. see attachment for the python programming screen shot and output
The word address is the integer division of the physical address by 8, while the offset is the remainder of the physical address divided by 8.
(a) Calculate the word address and offset
The number of bit is given as 64.
So, we have:
[tex]2^n = 64[/tex]
Express 64 as a base of 2
[tex]2^n = 2^8[/tex]
Cancel out the base of 2
[tex]n = 8[/tex]
So, we have:
(i) Physical address: 0
Word address = 0\8 = 0Offset = 0 mod 8 = 0
(ii) Physical address: 9
Word address = 9\8 = 1Offset = 9 mod 8 = 1(iii) Physical address: 27
Word address = 27/8 = 3Offset = 27 mod 8 = 3(iv) Physical address: 31
Word address = 31/8 = 3Offset = 31 mod 8 = 7(v) Physical address: 120
Word address = 120/8 = 15Offset = 120 mod 8 = 0(v) Physical address: 256
Word address = 256/8 = 32Offset = 256 mod 8 = 0(b) The program
The program written in Python, where comments are used to explain each line is as follows:
#This creates a list of physical address
pA = [0, 9, 27, 31,120, 256]
#This iterates through the list
for i in range(len(pA)):
#This prints the word address
print("Word Address:",(pA[i]//8))
#This prints the offset
print("Offset:",(pA[i]%8))
Read more about word address at:
https://brainly.com/question/17493537
Related Questions
Assume: Memory: 5 bit addresses Cache: 8 blocks All memory locations contain valid data If the memory location is 9. What is the Binary Address and cache block # If the memory location is 12. What is the Binary Address and cache block # If the memory location is 15. What is the Binary Address and cache block #
Answers
Answer:
The answer to this question can be described as follows:
binary address: 01001, 01100, 01111.
Cache block: 1, 4, 7
Explanation:
Given values
Memory = 5 bit and cache = 8 blocks
Option 1)
memory location is =9
convert into binary number, so we get binary address = 01001
So, the cache block = 1
Option 2)
memory location is = 12
convert into binary number, so we get binary address = 01100
So, the cache block = 4
Option 3)
memory location is =15
convert into binary number, so we get binary address = 01111
So, the cache block = 7
Implement (in Java) the radixSort algorithm to sort in increasing order an array of integer positive keys. public void radixSort(int arr[]) In your implementation you must consider that each key contains only even digits (0, 2, 4, 6, and 8). Your program must detect the case of odd digits in the keys, and, in this case, abort. Example #1:
Answers
Answer:
see explaination
Explanation:
import java.util.Scanner;
import java.util.ArrayList;
public class EvenRadixSort {
public static void main(String[] args) {
int n;
Scanner s=new Scanner(System.in);
System.out.println("enter number of elements to sort");
n=s.nextInt();
int[] arr=new int[n];
System.out.println("enter elements");
for(int i=0;i<n;i++)
arr[i]=s.nextInt();
radixsort(arr);
System.out.print("after sorting\t ");
for(int i=0;i<n;i++)
System.out.print(arr[i]+" ");
System.out.print("\n");
}
public static void radixsort(int[] arr) {
ArrayList<Integer>[] buckets = new ArrayList[10];
for (int i = 0; i < buckets.length; i++) {
buckets[i] = new ArrayList<Integer>();
}
// sort
boolean flag = false;
int tmp = -1, divisor = 1;
while (!flag) {
flag = true;
// split input between lists
for(int i=0;i<arr.length;i++) {
tmp = arr[i] / divisor;
if(tmp%2!=0){
System.out.println("odd digit in key");
System.exit(0);
}
buckets[tmp % 10].add(arr[i]);//insert number in certain bucket
if (flag && tmp > 0) {// check for divisor increment for next digit
flag = false;
}
}
// empty lists into input array arr
int a = 0;
for (int b = 0; b < 10; b=b+2) {
for (Integer i : buckets[b]) {
arr[a++] = i;
}
buckets[b].clear();
}
// move to next digit
divisor *= 10;
}
}
}
see attachment
Compose a program to examine the string "Hello, world!\n", and calculate the total decimal numeric value of all the characters in the string (including punctuation marks), less the numeric value of the vowels.
The program should load each letter, add that numerie value to the running total to produce a total sum, and then add the value to a "vowels running total as well. The program will require a loop. You do not need a counter, since the phrase is null terminated. Remember, punctuation (even spaces!) have a numeric value as well.
Answers
Answer:
.data
str: .asciiz "Hello, world!\n"
output: .asciiz "\nTotal character numeric sum = "
.text
.globl main
main:
la $t0,str # Load the address of the string
li $t2,0 # Initialize the total value to zero
loop: lb $t1,($t0) # Load one byte at a time from the string
beqz $t1,end # If byte is a null character end the operation
add $t2,$t2,$t1 # Else add the numeric value of the byte to the running total
addi $t0,$t0,1 # Increment the string pointer by 1
b loop # Repeat the loop
end:
# Displaying the output
li $v0,4 # Code to print the string
la $a0,output # Load the address of the string
syscall # Call to print the output string
li $v0,1 # Code to print the integer
move $a0,$t2 # Put the value to be printed in $a0
syscall # Call to print the integer
# Exiting the program
li $v0,10 # Code to exit program
syscall # Call to exit the program
Explanation:
The ticketing system at the airport is broken, and passengers have lined up to board the plane in the incorrect order. This line is represented in an ArrayList tickets in the AirLineTester class. Devise a way to separate passengers into the correct boarding groups. Currently, there is an AirlineTicket class that holds the information for each passengers ticket. They have a name, seat, row, and boarding group. Use the TicketOrganizer class to help fix the order of passengers boarding. First, create a constructor that takes an ArrayList of AirLineTickets and copies it to a class variable ArrayList. Then, create a getTickets method to get the ArrayList of AirLineTickets. In the TicketOrganizer class, create a method called printPassengersByBoardingGroup that prints out the name of the passengers organized by boarding group. The boarding groups go from 1-5, and have been predetermined for you. This should print the boarding group followed by all passengers in the group:
Answers
Final answer:
The TicketOrganizer class can be used to separate passengers into the correct boarding groups. It provides a constructor to store the ArrayList of AirLineTickets and a method to print passengers by boarding group.
Explanation:
The TicketOrganizer class can be used to separate passengers into the correct boarding groups. To do this, you can create a constructor in the TicketOrganizer class that takes an ArrayList of AirLineTickets as a parameter and stores it in a class variable ArrayList. This can be done using the following code:
public class TicketOrganizer {private ArrayList<AirLineTicket> tickets;
public TicketOrganizer(ArrayList<AirLineTicket> tickets) {
this.tickets = new ArrayList<>(tickets);
}
public ArrayList<AirLineTicket> getTickets() {
return tickets;
}
public void printPassengersByBoardingGroup() {
for (int i = 1; i <= 5; i++) {
System.out.println("Boarding Group " + i + ":");
for (AirLineTicket ticket : tickets) {
if (ticket.getBoardingGroup() == i) {
System.out.println(ticket.getName());
}
}
}
}
}
This code creates a TicketOrganizer class with a constructor that takes an ArrayList of AirLineTickets and creates a copy of it in a class variable. It also provides a getTickets method to retrieve the ArrayList of AirLineTickets. The printPassengersByBoardingGroup method loops through the boarding groups (1-5) and prints the name of each passenger in that group.
Below is the Python code:
class AirlineTicket:
def __init__(self, name, seat, row, boarding_group):
self.name = name
self.seat = seat
self.row = row
self.boarding_group = boarding_group
class TicketOrganizer:
def __init__(self, tickets):
self.tickets = tickets
def getTickets(self):
return self.tickets
def printPassengersByBoardingGroup(self):
for boarding_group in range(1, 6):
group_passengers = [passenger for passenger in self.tickets if passenger.boarding_group == boarding_group]
print(f"Boarding Group {boarding_group}:")
for passenger in group_passengers:
print(passenger.name)
# Create an ArrayList of AirlineTickets
tickets = [
AirlineTicket("Alice", "A1", "10", 1),
AirlineTicket("Bob", "B2", "20", 2),
AirlineTicket("Charlie", "C3", "30", 3),
AirlineTicket("David", "D4", "40", 4),
AirlineTicket("Eve", "E5", "50", 5),
]
# Create a TicketOrganizer object
organizer = TicketOrganizer(tickets)
# Print the passengers by boarding group
Based on the above, the code successfully separates the passengers into the correct boarding groups. The output shows the boarding group followed by all passengers in the group.
6. In cell K4, create a formula using the IF function to calculate the interest paid on the mortgage (or the difference between the total payments made each year and the total amount of mortgage principal paid each year). a. The formula should first check if the value in cell H4 (the balance remaining on the loan each year) is greater than 0. b. If the value in cell H4 is greater than 0, the formula should return the value in J4 subtracted from the value in cell D5 multiplied by 12. Use a relative cell reference to cell J4 and an absolute cell reference to cell D5. (Hint: Use 12*$D$5-J4 as the is_true argument value in the formula.) c. If the value in cell H4 is not greater than 0, the formula should return a value of 0. Copy the formula from cell K4 into the range K5:K18.
Answers
Answer:
a. =IF(H4>0,12*$D$5-J4,0)
Explanation:
a. =IF(H4>0,12*$D$5-J4,0)
If( H4>0 is the logical test,
12*$D$5-J4 is [value_if_true]
0 is [value_if_false]
b. Referencing to the above formula in (a), which is the required formula which should be typed in cell K4.
Absolute referencing of cell D5 means that this will not change while extending this formula to the entire column. Whereas, since cell H4 and J4 have relative cell referencing, these will change relatively as we extend the formula to the entire column.
java The maximum-valued element of an integer-valued array can be recursively calculated as follows: If the array has a single element, that is its maximum (note that a zero-sized array has no maximum) Otherwise, compare the first element with the maximum of the rest of the array-- whichever is larger is the maximum value. Write an int method named max that accepts an integer array, and the number of elements in the array and returns the largest value in the array. Assume the array has at least one element.
Answers
Answer:
see explaination
Explanation:
MaxArray.java
public class MaxArray{
public static void main(String[] args) {
int a[] = {1,2,5,4,3};
int max = max (a, 5);
System.out.println("Max value is "+max);
}
public static int max (int a[],int size){
if (size > 0) {
return Math.max(a[size-1], max(a, size-1));
} else {
return a[0];
}
}
}
Output:
MaxArray
You’ve done merge (on Lists), so now it’s time to do merge sort (on arrays). Create a public non-final class named MergeSort that extends Merge. Implement a public static method int[] mergesort(int[] values) that returns the input array of ints sorted in ascending order. You will want this method to be recursive, with the base case being an array with zero or one value. If the passed array is null you should return null. If the passed array is empty you should return an empty array. You do not have to sort the array in place, but the returned array does not have to be a copy. To help you your parent class Merge provides two useful class methods: int[] merge(int[] first, int[] second): this merges two sorted arrays into a second sorted array. If either array is null it returns null, so you should not call it on a null array. int[] copyOfRange(int[] original, int from, int to): this acts as a wrapper on Arrays.copyOfRange, accepting the same arguments and using them in the same way. (You can’t use java.util.Arrays in this problem for reasons that will become obvious if you inspect the rest of the documentation…) Note that the test code will test that you call merge an appropriate number of times, so you should call it to join single-element arrays together.
Answers
Answer:
Kindly check explaination for code
Explanation:
/* Java program for Merge Sort */
class MergeSort
{
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
// Find sizes of two subarrays to be merged
int n1 = m - l + 1;
int n2 = r - m;
/* Create temp arrays */
int L[] = new int [n1];
int R[] = new int [n2];
/*Copy data to temp arrays*/
for (int i=0; i<n1; ++i)
L[i] = arr[l + i];
for (int j=0; j<n2; ++j)
R[j] = arr[m + 1+ j];
/* Merge the temp arrays */
// Initial indexes of first and second subarrays
int i = 0, j = 0;
// Initial index of merged subarry array
int k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
/* Copy remaining elements of L[] if any */
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
/* Copy remaining elements of R[] if any */
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}
// Main function that sorts arr[l..r] using
// merge()
void sort(int arr[], int l, int r)
{
if (l < r)
{
// Find the middle point
int m = (l+r)/2;
// Sort first and second halves
sort(arr, l, m);
sort(arr , m+1, r);
// Merge the sorted halves
merge(arr, l, m, r);
}
}
/* A utility function to print array of size n */
static void printArray(int arr[])
{
int n = arr.length;
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
// Driver method
public static void main(String args[])
{
int arr[] = {12, 11, 13, 5, 6, 7};
System.out.println("Given Array");
printArray(arr);
MergeSort ob = new MergeSort();
ob.sort(arr, 0, arr.length-1);
System.out.println("\nSorted array");
printArray(arr);
}
}
Answer:
Check the explanation
Explanation:
/* Java program for Merge Sort */
class MergeSort
{
// Merges two subarrays of arr[].
// First subarray is arr[l..m]
// Second subarray is arr[m+1..r]
void merge(int arr[], int l, int m, int r)
{
// Find sizes of two subarrays to be merged
int n1 = m - l + 1;
int n2 = r - m;
/* Create temp arrays */
int L[] = new int [n1];
int R[] = new int [n2];
/*Copy data to temp arrays*/
for (int i=0; i<n1; ++i)
L[i] = arr[l + i];
for (int j=0; j<n2; ++j)
R[j] = arr[m + 1+ j];
/* Merge the temp arrays */
// Initial indexes of first and second subarrays
int i = 0, j = 0;
// Initial index of merged subarry array
int k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
arr[k] = L[i];
i++;
}
else
{
arr[k] = R[j];
j++;
}
k++;
}
/* Copy remaining elements of L[] if any */
while (i < n1)
{
arr[k] = L[i];
i++;
k++;
}
/* Copy remaining elements of R[] if any */
while (j < n2)
{
arr[k] = R[j];
j++;
k++;
}
}
// Main function that sorts arr[l..r] using
// merge()
void sort(int arr[], int l, int r)
{
if (l < r)
{
// Find the middle point
int m = (l+r)/2;
// Sort first and second halves
sort(arr, l, m);
sort(arr , m+1, r);
// Merge the sorted halves
merge(arr, l, m, r);
}
}
/* A utility function to print array of size n */
static void printArray(int arr[])
{
int n = arr.length;
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
}
// Driver method
public static void main(String args[])
{
int arr[] = {12, 11, 13, 5, 6, 7};
System.out.println("Given Array");
printArray(arr);
MergeSort ob = new MergeSort();
ob.sort(arr, 0, arr.length-1);
System.out.println("\nSorted array");
printArray(arr);
}
}
/* This code is contributed by Rajat Maurya */
4-One possible performance multiplication enhancement is to do a shift and add instead of an actual multiplication. Since 9 * 6, for example, can be written (2 * 2 * 2 + 1) * 6, we can calculate 9 *6 by shifting 6 to the left 3 times and then adding 6 to that result. Show the best way to calculate 13 * 7 using shifts and adds/subtracts. Assume both inputs are 8-bit unsigned integers.
Answers
Answer:
Check the explanation
Explanation:
The above question can be sovled in the below step by step way:
15 can be written as 16-1 = 24 -1
Therefore, 15 *13 = (24 -1)*13
= 13*24 - 13
Now, when we left shift a number we multiply it by 2k .Where k is no of times we left shifted it.
Therefore, 13*24 = shift 13 to left 4 times
15 * 13 = shift 13 to left 4 times and subtract 13 from it.
Write the implementation (.cpp file) of the Counter class of the previous exercise. The full specification of the class is: A data member counter of type int. An data member named limit of type int. A static int data member named nCounters which is initialized to 0 (this should be done as part of the implementation, i.e., you need to supply this initialization). A constructor that takes two int arguments and assigns the first one to counter and the second one to limit. It also adds one to the static variable nCounters A function called increment that accepts no parameters and returns no value. If the data member counter is less than limit, increment just adds one to the instance variable counter. A function called decrement that accepts no parameters and returns no value. If counter is greater than zero, decrement subtracts one from the counter. A function called getValue that accepts no parameters. It returns the value of the instance variable counter. A static function named getNCounters that accepts no parameters and return an int. getNCounters returns the value of the static variable nCounters.
Answers
Final answer:
The Counter class implementation in C++ includes functions to increment, decrement, and get the counter's value, as well as managing the count of Counter instances with a static member.
Explanation:
The implementation of a Counter class in C++ involves defining the class's member functions and initializing any static data members outside of the class definition. Below is a possible implementation of the Counter class based on the specifications provided.
#include "Counter.h"int Counter::nCounters = 0;
Counter::Counter(int initial, int lim) : counter(initial), limit(lim) {
++nCounters;
}
void Counter::increment() {
if (counter < limit) {
++counter;
}
}
void Counter::decrement() {
if (counter > 0) {
--counter;
}
}
int Counter::getValue() const {
return counter;
}
int Counter::getNCounters() {
return nCounters;
}
Note that the static variable nCounters is initialized outside of the class definition. The constructor sets the initial value of counter and limit, and also increments the nCounters. The increment and decrement functions alter the counter value under specific conditions, and the getValue function returns its current value. Lastly, getNCounters returns the number of Counter instances.
Create a stored procedure sp_Q1 that takes two country names like 'Japan' or 'USA' as two inputs and returns two independent sets of rows: (1) all suppliers in the input countries (SUPPLIERS TABLE) , and (2) products supplied by these suppliers (PRODUCTS TABLE). The returned suppliers should contain SupplierID, CompanyName, Phone, and Country. The returned products require their ProductID, ProductName, UnitPrice, SupplierID, and must be sorted by SupplierID. You must include a simple testing script to call your sp_Q1 using 'UK' and 'Canada' as its two inputs.
Answers
Answer:
Kindly note that, you're to replace "at" with shift 2 as the brainly text editor can't take the symbol
If you are executing this script with any other script, Add "GO" to the line above "CREATE PROCEDURE", on a line all by itself, and it should fix that error of 'CREATE/ALTER PROCEDURE'
Explanation:
CREATE PROCEDURE sp_Q1
"at"country1 NVARCHAR(15),
"at"country2 NVARCHAR(15)
AS
BEGIN
BEGIN
SELECT SupplierID, CompanyName, Phone, Country FROM suppliers
where Country in ("at"country1,"at"country2)
SELECT ProductID, ProductName, UnitPrice, SupplierID FROM Products
where SupplierID in(
SELECT SupplierID FROM suppliers
where Country in ("at"country1,"at"country2)) ORDER BY SupplierID
END
END
GO
-- Testing script.
DECLARE "at"RC int
DECLARE "at"country1 nvarchar(15)
DECLARE "at"country2 nvarchar(15)
-- Set parameter values here.
set "at"country1='UK'
set "at"country2='Canada'
EXECUTE "at"RC = [dbo].[sp_Q1]
"at"country1
,"at"country2
GO
Create a function that will perform linear interpolation from a set of measured data stored in a list or array. The function should take as input a list of values at which samples were taken, and then another list giving the measurements (you can assume each measurement is a single value) at
Answers
Answer:
This question is incomplete, here is the complete question:
Python
a) You should create a function that will perform linear interpolation from a set of measured data. The function should take as input a list of values at which samples were taken, and then another list giving the measurements (you can assume each measurement is a single value) at those values. It should also take in a query value, and should give the best estimate it can of the value at that query. Be sure to handle values that are outside of the range, by extrapolating. You should write a program that allows you to test your function by reading the lists from a file where each line of the file is a pair of numbers separated by spaces: the value where the sample was taken, and the measurement at that value. Your program should ask the user for the name of the file and for a query value. Important: The two lists will correspond to each other: i.e. for the i-th value in the first list, the measurement will be the i-th element of the second list (these are called parallel lists or arrays). But, you should not assume that the input values are in increasing/decreasing order. That is, the values in the first list can be in any random ordering, not necessarily from smallest to largest or largest to smallest. You will have to account for this in your program, and there is more than one way to do so. You should discuss what options you can think of to handle the data arriving in any order like that, and decide what you think the best option for handling it is.
Explanation:
from __future__ import division
from cStringIO import StringIO
import numpy as np
from scipy.interpolate import RectBivariateSpline
np.set_printoptions( 1, threshold=100, edgeitems=10, suppress=True )
# a file inline, for testing --
myfile = StringIO( """
# T P1 P2 P3 P4
0, 80,100,150,200
75, 400,405,415,430
100, 450,456,467,483
150, 500,507,519,536
200, 550,558,571,589
""" )
# file -> numpy array --
# (all rows must have the same number of columns)
TPU = np.loadtxt( myfile, delimiter="," )
P = TPU[0,1:] # top row
T = TPU[ 1:,0] # left col
U = TPU[1:,1:] # 4 x 4, 400 .. 589
print "T:", T
print "P:", P
print "U:", U
interpolator = RectBivariateSpline( T, P, U, kx=1, ky=1 ) # 1 bilinear, 3 spline
# try some t, p --
for t, p in (
(75, 80),
(75, 200),
(87.5, 90),
(200, 80),
(200, 90),
):
u = interpolator( t, p )
print "t %5.1f p %5.1f -> u %5.1f" % (t, p, u)
Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this: 2 5 1 7 9 12 11 10, which statement is correct?
a. The pivot could be 7, but it is not 9.
b. The pivot could be 9 but not 7.
c. The pivot could be either 7 or 9.
d. Neither 7 nor 9 is the pivot.
Answers
Answer:
c. The pivot could be either 7 or 9.
Explanation:
Since we are trying to sort an array of eight integers using quick sort, from the first partitioning it shows that the pivot or the central point can either be 7 or 9. When you look at the array, it is only 7 and 9 that are placed correctly in the sorted array. Every element to the left of 7 and 9 are smaller and every element on the right of 7 and 9 are integers higher than them. Hence this shows that the pivot lies between 7 or 9.
The pivot element of an array is the middle element of the array.
The pivot element could be either 7 or 9
From the question, we have:
[tex]\mathbf{n = 8}[/tex]
So, the pivot element is:
[tex]\mathbf{Pivot = \frac{n +1}{2}}[/tex]
So, we have:
[tex]\mathbf{Pivot = \frac{8 +1}{2}}[/tex]
[tex]\mathbf{Pivot = \frac{9}{2}}[/tex]
Divide 9 by 2
[tex]\mathbf{Pivot = 4.5}[/tex]
So, the pivot element is the 4.5th element.
The 4.5th element is between the 4th and 5th element (i.e. 7 or 9)
This means that, the pivot element could be either 7 or 9
Hence, the correct option is (c).
Read more about pivot elements at:
https://brainly.com/question/16260051
a) As a network administrator, you have been assigned to calculate a subnet number for a new LAN in a new building location. You have determined that you need 52 subnets for Class B beginning with network ID 180.21.0.0. How many host bits will you need to use for network information in the new subnets
Answers
Assume we have a computer where the CPI is 1.0 when all memory accesses (including data and instruction accesses) hit in the cache. The cache is a unified (data + instruction) cache of size 256 KB, 4-way set associative, with a block size of 64 bytes. The data accesses (loads and stores) constitute 50% of the instructions. The unified cache has a miss penalty of 25 clock cycles and a miss rate of 2%. Assume 32-bit instruction and data addresses. Now, answer the following questions
a) What is the tag size for the cache?
b. How much faster would the computer be if all memory accesses were cache hits?
Answers
Answer:
a. 16
b. 1.75
Explanation:
Number of bits used for block offset = log 64 = 6.
Number of sets in the cache = 256K/(64 * 4) = 1K
Number of bits for index = log 1K = 10
Number of bits for tag = 32 - (10 + 6) = 16
Now,
CPI = CPIexecution + StallCyclesPerInstruction
For computer that always hits, CPI would be 1 i,e CPI = 1
Now let us compute StallCyclesPerInstruction for computer with non-zero miss rate
StallCyclesPerInstruction = (Memory accesses per instr) * miss rate * miss penalty
Memory accesses per instruction = 1 + 0.5 (1 instruction access + 0.5 data access)
StallCyclesPerInstruction = 1.5 * 0.02 * 25 = 0.75
Therefore, CPI = 1.75
Hence the computer with no cache misses is 1.75 times faster.
I have been trying to work on this for a while now, and this is on excel
In cell H10, enter an INDEX function that will use a nested INDIRECT reference to the Dept named range listed in column C (C10), and use the Reason field in column B (B10) as the row number to return for the department name in the referenced named range.
Nest the function inside an IF function so that issues currently displaying as a 0 will display as a blank cell. Resize the column width as needed.
** I got this much of the formula
=INDEX(INDIRECT("Dept"),Reason)
but it only recalls and displays the Dept column contents. I need it to recall the Dept and display the Reason, I think? Then at that point, how would I get this into an IF statement?
I feel like I dont understand the instructions, and I know I am not that great on excel.
Answers
Answer:
=IF(INDEX(INDIRECT(C10), B10)=0,"",INDEX(INDIRECT(C10), B10))
Or
=IF((INDEX((INDIRECT(Dept,TRUE)),Reason))="","",(INDEX((INDIRECT(Dept,TRUE)),Reason)))
Explanation:
Given
Your formula:.
=INDEX(INDIRECT("Dept"),Reason)
Dept column = C (C10)
Reason field = B (B10)
The issue with your formula is that you failed to include a statement to test the falsity of the first condition; in other words, if your if statement is not true, what else should the formula do.
The question says that
"Nest the function inside an IF function so that issues currently displaying as a 0 will display as a blank cell" this means that
if the INDEX() function returns 0, a blank should be displayed in H10 blank, instead.
So, the right formula both of these two. You can use any of them
1. =IF(INDEX(INDIRECT(C10), B10)=0,"",INDEX(INDIRECT(C10), B10))
2. =IF((INDEX((INDIRECT(Dept,TRUE)),Reason))="","",(INDEX((INDIRECT(Dept,TRUE)),Reason)))
The two does the same function; the only difference is that
(1) considers the cell itself while (2) considers the contents of the cell.
The analysis of both is that
They both use a nested indirect reference to check for the content of cells displaying 0.
The first if checks for the above mentioned; if yes, cell H10 is made to display a blank else it's original content is displayed.
Write an expression that executes the loop while the user enters a number greater than or equal to 0.Note: These activities may test code with different test values. This activity will perform three tests, with userNum initially 9 and user input of 5, 2, -1, then with userNum initially 0 and user input of -17, then with userNum initially -1. See "How to Use zyBooks". .Also note: If the submitted code has an infinite loop, the system will stop running the code after a few seconds, and report "Program end never reached." The system doesn't print the test case that caused the reported message.
Answers
Answer:
do {
System.out.println("Enter a number");
userNum = in.nextInt();
System.out.println("You entered "+userNum+" you are still in the loop");
}while(userNum>=0);
Explanation:
In this solution in Java programming language a do.....while loop has been used to implement itThe condition while(userNum>=0); ensures that the user will continuously be prompted to enter a number as long as the number entered is greater or equals to 0.See a complete program below That uses the scanner class and countinually prompts the user for input as long as the number entered is greater or equal to zeroThe loop breaks once a number less than zero is entered by the userimport java.util.Scanner;
public class num3 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int userNum;
do {
System.out.println("Enter a number");
userNum = in.nextInt();
System.out.println("You entered "+userNum+" you are still in the loop");
}while(userNum>=0);
System.out.println("You are out of the loop now.... goodbye");
}
}
To execute a loop while the user enters a number greater than or equal to 0, a while loop can be used. The user is prompted for input within the loop, and the loop continues as long as the entered value is greater than or equal to 0. When a negative number is entered, the loop terminates.
To execute a loop while the user enters a number greater than or equal to 0, we can use a while loop in a programming language like Python. The loop will prompt the user for a number and continue iterating as long as the user enters a non-negative number. Below is an example of how we might create this loop:
userNum = int(input('Enter a number: '))while userNum \">= 0:
userNum = int(input('Enter a number: '))
This code starts by getting an initial number from the user. Then, the while statement checks if userNum is greater than or equal to 0. If the condition is true, the loop continues; the user is prompted again for a number, and the process repeats. When the user enters a negative number, the loop terminates and the program proceeds to the next instruction after the loop.
Note that it is important to convert the user input to an integer for the comparison in the while loop to work properly. This is because the input function in Python returns a string which cannot be directly compared with a numeric value without a cast to an integer.
Ask the user how many high scores they want.
// Then read in their input.
// Support error checking (input validation).
// The user should only be able to input a positive
// integer value.
// You may use Utility.ReadIng() and Utility.IsRael Good()
// to help you with error checking.
Answers
Answer:
Check the explanation
Explanation:
As per requirement submitted above kindly find below solution.
Here new console application in C# is created using visual studio 2019 with name "HighScoreApp". This application contains a class with name "Program.cs".Below is the details of this class.
Program.cs :
//namespace
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
//application namespace
namespace HighScoreApp
{
class Program //C# class
{
//entry point of the program , Main() method
static void Main(string[] args)
{
//declaring variable to store number of score
int numberOfScores = 0;
//using while loop
while(numberOfScores<=0)
{
//asking user number of high scores
Console.WriteLine("Enter number of high scores : ");
//reading input
numberOfScores = int.Parse(Console.ReadLine());
}
//declaring array with number of scores
int[] scores = new int[numberOfScores];
//asking user high scores using for loop
for (int i = 0; i < scores.Length; i++)
{
//asking high scores
Console.WriteLine("Enter score "+(i+1)+" : ");
//reading score
scores[i] = int.Parse(Console.ReadLine());
}
Console.WriteLine();//used for new line
Console.WriteLine("High Scores -Unsorted");
//call function to print each element
PrintArray(scores);
//call method to sort the array elements
scores = SortArrayHighToLow(scores);
Console.WriteLine();//used to print new line
Console.WriteLine("High Scores-Sorted");
PrintArray(scores);//call method to print array elements
Console.SetCursorPosition(0, Console.WindowHeight - 1);
Console.WriteLine("Press ENTER to continue....");
Console.ReadLine();
}
//method to print the array
public static void PrintArray(int [] scoresArray)
{
//using for loop , print each score
for (int i = 0; i < scoresArray.Length; i++)
{
Console.WriteLine(scoresArray[i]);//print each high score
}
}
//method to sort the array
public static int [] SortArrayHighToLow(int[] scoresArray)
{
Array.Sort(scoresArray);
return scoresArray;
}
}
}
==================================
Output :Run application using F5 and will get the screen as shown below
Kindly check the below Screenshot for Output :Program.cs
1. Write an application that inputs five numbers, each between 10 and 100, inclusive. As each number is read, display it only if it’s not a duplicate of a number already read. Provide for the "worst case," in which all five numbers are different. Use the smallest possible array to solve this problem. Display the complete set of unique values input after the user enters each new value. This is a sample run of your program: Enter·an·integer·between·10·and·100:100↵ This·is·the·first·time·100·has·been·entered↵ Enter·an·integer·between·10·and·100:100↵ Enter·an·integer·between·10·and·100:10↵ This·is·the·first·time·10·has·been·entered↵ Enter·an·integer·between·10·and·100:20↵ This·is·the·first·time·20·has·been·entered↵ Enter·an·integer·between·10·and·100:20↵ The·complete·set·of·unique·values·entered·is:↵ Unique·Value·1:·is·100↵ Unique·Value·2:·is·10↵ Unique·Value·3:·is·20
Answers
Answer:
Check the explanation
Explanation:
import java.util.Scanner;
public class DuplicateElimination {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int arr[] = new int[5];
int size = 0, n;
for(int i = 0;i<5;i++){
System.out.print("Enter an integer between 10 and 100:");
n = scanner.nextInt();
if(size==0 || elemanVarmı(arr,size,n)){
System.out.println("This is the first time "+n+" has been entered");
arr[size] = n;
size++;
}
}
System.out.println("The complete set of unique values entered is");
for(int i = 0;i<size;i++){
System.out.println("Unique Value "+(i+1)+": is "+arr[i]);
}
}
private static boolean elemanVarmı(int dizi[], int size, int n)
{
for (int i = 0; i < size; i++)
{
if(dizi[i]==n)
{
return false;
}
}
return true;
}
}
Final answer:
The question is about designing a programming application that takes in up to five integers between 10 and 100 and displays each unique number entered by the user. The program maintains a small array to store the unique numbers and possibly includes functionality to determine the minimum and maximum values from the input, as well as error handling for invalid inputs.
Explanation:
Programming Unique Values Application
The application you're describing involves creating a program that accepts five integers between 10 and 100, inclusive. Each number entered by the user should be checked against the existing list of input numbers to determine if it is a duplicate. If it is not a duplicate, it should then be displayed and added to the list of unique values. To handle this scenario, the program could use an array with a length that corresponds to the maximum number of unique integers, which in the worst case would be five. As the user inputs each number, the program should check if the number is already present in the array. If it isn't, the number should be added to the array, and the current list of unique numbers should be displayed. This helps in avoiding the storage of duplicate numbers and efficiently manages the memory by using the smallest array necessary.
To extend the functionality, as indicated in Exercise 5.2, the same logical structure can be applied to also keep track and display the maximum and minimum value entered by the user at the end of the input sequence. We could also implement error handling to provide feedback if invalid input is given, similar to the approach outlined in Exercise 5.1 for detecting user input mistakes. This kind of functionality often involves iterative loops, array manipulation, and conditional statements to handle the logic.
In this chapter, you subnetted a Class C private network into six subnets. In this project, you work with a Class B private network. Complete the steps as follows: 1. Your employer is opening a new location, and the IT director has assigned you the task of calculating the subnet numbers for the new LAN. You’ve determined that you need 50 subnets for the Class B network beginning with the network ID 172.20.0.0. How many host bits will you need to use for network information in the new subnets? 2. After the subnetting is complete, how many unused subnets will be waiting on hold for future expansion, and how many possible hosts can each subnet contain?
Answers
Answer:
1. 10 bits
2. 1022 Hosts / Subnet
Explanation:
Given Network ID is 172.20.0.0
Class B network contains :
Network ID = 16 bits
Host ID = 16 bits
For subnetting always host id bits are used.
Number of subnets required = 50. Subnets are always in power of two. Nearest power of two to 50 is 26 = 64.
So, to create subnet we require 6 bits from host id and 64 subnets can be created with those 6 bits.
1)
Number of host bits needed for new subnets for network information = 6 bits.
Therefore, New network information contains :
Network ID of subnet = 16 + 6 = 22 bits
Host ID = 16- 6 = 10 bits.
2)
Subnets required = 50
Subnets created with 6 bits = 64.
Number of subnets unused for future expansion = 64 - 50 = 14 subnets.
Host ID part contains 10 bits. Therefore, Total number of Hosts /Subnet = 210 = 1024 Hosts.
Number of usable hosts per subnet = 1024 -2 = 1022 Hosts / Subnet.
Subnetting the Class B private network 172.20.0.0 into 50 subnets requires using 6 bits for subnetting, leaving 10 bits for the hosts. This results in 14 unused subnets and 1022 possible hosts per subnet.
Subnetting a Class B private network to create 50 subnets involves several steps. Let's start by understanding the requirements:
1. Determine the number of host bits to borrow: The Class B network starting address is 172.20.0.0. Class B networks have a default subnet mask of 255.255.0.0, meaning the first 16 bits are for the network, and the remaining 16 bits are for the host.
We need to create 50 subnets. The number of bits needed to create 'n' subnets is calculated by the formula 2^n ≥ required subnets. Here, we need at least 50 subnets.
So, we need to solve 2^n ≥ 50, which results in n = 6 bits (since 2^6 = 64). The subnet mask will now be 255.255.252.0 (i.e., borrowing 6 bits from the host part).
2. Calculate the number of host bits left: Originally, there are 16 host bits. Borrowing 6 bits leaves us with 10 bits for hosts.
3. Determine unused subnets and possible hosts per subnet: We have created 64 subnets (2^6). We needed only 50, so there will be 14 unused subnets (64 - 50).
The number of hosts per subnet is calculated as 2^(number of host bits) - 2 (to account for network and broadcast addresses). So, 2^10 - 2 = 1022 hosts per subnet.
In summary:
6 bits are used for subnetting.There will be 14 unused subnets.Each subnet can contain up to 1022 hosts.Moving Images are called________.
Group of answer choices
pictures
comic strips
films
animations
Answers
Answer:
films
Explanation:
- Pictures, comic strips, and animations is wrong because they are static images.
- Films are known as "moving pictures" and therefore are moving images. That makes film your correct answer.
- Hope this helps! If you would like a further explanation please let me know.
"In about 100 words, describe the idea behind software as a service (SaaS). In your answer, include at least three examples of electronic commerce software packages or components that are offered as an SaaS."
Answers
Answer:
Explanation:
Saas refers to software as a service and can also be called software on demand .
It Isa software that is deployed over the internet rather than requiring to install an application .It offers different devices such as pay as you go , subscription model and service on demand model .
Only a compatible browser is needed to access the software .
Electronic packages or components that aree offered as an Saas
1)Shopify
2)Big commerce
3)Slack
Sites like Zillow get input about house prices from a database and provide nice summaries for readers. Write a program with two inputs, current price and last month's price (both integers). Then, output a summary listing the price, the change since last month, and the estimated monthly mortgage computed as (current_price * 0.051) / 12. Output each floating-point value with two digits after the decimal point, which can be achieved as follows:
Answers
Final answer:
The student's question involves writing programs in C++ and Python to summarize current house price, change since last month, and estimate the monthly mortgage. Example codes in both languages are provided, offering a clear and concise way to calculate and present the required financial information.
Explanation:
As a solution to the student's request, we can provide a simple program in both C++ and Python to calculate the summary of a house pricing including the current price, the change since last month, and the estimated monthly mortgage. Below are example codes for both languages:
C++ Program:
#include
#include
int main() {
int currentPrice, lastMonthsPrice;
std::cin >> currentPrice >> lastMonthsPrice;
double change = currentPrice - lastMonthsPrice;
double monthlyMortgage = (currentPrice * 0.051) / 12;
std::cout << std::fixed << std::setprecision(2);
std::cout << "Current Price: $" << currentPrice << "\n";
std::cout << "Change Since Last Month: $" << change << "\n";
std::cout << "Estimated Monthly Mortgage: $" << monthlyMortgage << std::endl;
return 0;
}
Python Program:
current_price = int(input())
last_months_price = int(input())
change = current_price - last_months_price
monthly_mortgage = (current_price * 0.051) / 12
print(f'Current Price: ${current_price:.2f}')
print(f'Change Since Last Month: ${change:.2f}')
print(f'Estimated Monthly Mortgage: ${monthly_mortgage:.2f}')
By inputting the current and last month's house prices, these programs will output a formatted summary that includes change in price and monthly mortgage estimate.
Question 4: Write the code for a for-loop that prints the following outputs. You should be able to do it with either a single for-loop or a nested for-loop. Output 1: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 Output 2: 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0 1 2 0
Answers
Final answer:
The question can be solved using a for-loop in Python. For the first output, we iterate through numbers 0 to 24, and for the second output, we use the modulo operation to repeat the pattern 0, 1, 2 eight times.
Explanation:
To print the specified outputs, we can use a simple for-loop in Python. The first output is a sequence from 0 to 24, and the second output is a repeated pattern of 0 to 2, eight times (since we repeat the pattern 8 times to get the same length as the first sequence).
Code for Output 1:
for i in range(25):print(i, end=' ')
This loop will iterate over a range from 0 to 24 and print each number followed by a space, resulting in the first output.
Code for Output 2:
for i in range(25):print(i % 3, end=' ')
This loop will also iterate over a range from 0 to 24, but it will print the remainder when each number is divided by 3 (which is the modulo operation), resulting in the pattern 0, 1, 2 repeated, for the second output.
Five batch jobs. A through E, arrive at a computer center at almost the same time. They have estimated running times of 10, 6, 2, 4, and 8 minutes. For each of the following scheduling algorithms, determine the average process turnaround time. Ignore process switching overhead. Note that all jobs are completely CPU bound. Assumption: The processes are added to the ready queue in this order: run in order A, B, C, D, E.
Answers
Answer:
a) Round Robin = 21.2 minutes
(b) First -come, First Serve = 19.2 minutes
(c) Shortest job first = 14 minutes
Explanation:
The five job have a time of 10, 6, 2, 4, and 8.
The question doesn't specify the scheduling algorithm, so we will solve for round Robin scheduling algorithm, First Come First Serve and shortest job first scheduling algorithm.
Shortest job first scheduling algorithm execute the job that has the shortest completion time first.
First Come First Serve scheduling algorithm execute the job based on order of arrival.
Round Robin scheduling algorithm execute job based on a given time slice. If the time given is finish and the job hasn't finished, the job is removed and put on the queue while another job enter for execution.
Turnaround time = Completion time - Arrival time
In this case; our arrival time is 0; so turnaround time = completion time.
(a) Round Robin: We were not given quantum time, so we assume quantum time of 1. The sequence of execution will be:
A B C D E | A B C D E | A B D E | A B D E | A B E | A B E | A E | A E | A | A
Average Turnaroud time =
((30-0) + (23-0) + (8-0) + (17-0) + (28-0))/5 = 106/5 = 21.2 minutes
(b) First -come, first served (run in order 10, 6, 2, 4, 8):
A B C D E = ((10-0) + (16-0) + (18-0) + (22-0) + (30-0))/5 = 96/5 = 19.2 minutes
(c) Shortest job first:
C D B E A = ((2-0) + (6-0) + (12-0) + (20-0) + (30-0))/5 = 70/5 = 14 minutes
When a system is configured to allow booting to different operating systems at startup, what is this called?
Answers
Answer:
The term dual-boot has come to mean the ability to boot between two or more operating systems at startup.
Explanation:
A dual boot is when you run two operating systems on one computer at the same time. This can be any combination of operating systems, for example, Windows and Mac, Windows and Linux or Windows 7 and Windows 10.
‘Booting’ is normally used interchangeably with ‘starting’ or ‘powering on’ when referring to computers. But in regard to dual-booting, the term specifically refers to something called the ‘boot manager’, a tiny program managed by the motherboard.
When you turn on a PC, the power supply unit (PSU) initially powers up the motherboard, which manages and holds together all your other computer components. If you’ve ever seen a black screen with text and possibly logos on it after you’ve started your PC, but before it gets to the Windows login screen, this is the motherboard letting you know it is on.
The motherboard scans all the different components that are connected to it, such as graphics cards, optical drives (CD or DVD) and disk drives. Once the motherboard has established the state of your hardware, it knows that you will most likely want to boot into an operating system. To do this, the motherboard passes over the drive information to the boot manager.
Boot managers are software that can run on your computer before an operating system is loaded. Their task is to locate operating systems on your drives and start-up whichever you would like to use. Most people with a Windows PC or Mac may never have seen the boot manager on their computer - it simply assumes that since it can only find one operating system, this is the one you want to use.
Write a recursive, int-valued method named productOfOdds that accepts an integer array, and the number of elements in the array and returns the product of the odd-valued elements of the array. You may assume the array has at least one odd-valued element. The product of the odd-valued elements of an integer-valued array recursively may be calculated as follows: If the array has a single element and it is odd, return the value of that element; otherwise return 1. Otherwise, if the first element of the array is odd, return the product of that element and the result of finding the product of the odd elements of the rest of the array; if the first element is NOT odd, simply return the result of finding the product of the odd elements of the rest of the array
Answers
Answer:
Program source code found in explaination
Explanation:
Recursive int function of the asked question.;
int productOfOdds(int array[],int length) {
int product=1;
if(length==0)
return -1;
else if(length==1) {
if(array[length-1]%2!=0)
return array[length-1];
else
return 1;
}
else {
product=productOfOdds(array,--length);
if(array[length]%2!=0) {
product=product*array[length];
}
}
return product;
}
at what x position are the ellipses drawn??? thanks ♡
Answers
Answer:
55
Explanation:
The xPos variable is set to 55 and they have set the variable in the code for the ellipses in the x position
Hope this helps
int iterFib(int n) {int a = 0, b = 1, c, i;for(i=2; i<=n; i++) {c = a + b;a = b;b = c;}return b;}What are the missing MIPS instructions? Please record only the letter in lower case.iterFib: addi $sp, $sp, -12
Answers
Answer:
Instruction 1 , It should store the content of s2 intot the stack.
Hence instruction will be sw $s2,0($sp)
Instruction 2 , It will check if the value of t2 is one or not. If it is zero it should exit.
Hence instruction will be beq $t2,$zero,exitFib
Explanation:
Write, run, and test a MARIE assembly language program.The program should allow the user to input 8 numbers and find the smallest and the largest. The program should then print the smallest number and the largest number. Numbers are limited to integers, and can be positive, negative, or zero. You do NOT have to prompt input or label output.
Answers
The language program is as follows:
Explanation:
ORG 100 / Calculation of the maximum
Load First /loading 1st array member
Store Next /address of next pointer,stores
Load Array /Loading 1st element
Store Max /maximum value with 1st element
Loop, Clear
AddI Next /Load next element!
Subt Max /Comparing with the maximum once
Skipcond 000 /If negative ->skip
Jump NewMax /If not negative ->max value
NextIdx, Load Next
Add One /pointer++
Store Next
Load Count /counter--
Subt One
Skipcond 800 /counter is positive ->same proceeding
Jump Print /else - printing the result
Store Count /counter decresed and stored
Jump Loop
NewMax, Clear / new maximum value
AddI Next
Store Max
Jump NextIdx
Print, Load Max
Output
Halt /Terminate program
First, Hex 11E /starting is location 11E(change as per...,as code changes don't forget to change it too)
Next, Hex 0 /next element index (memory location)
Max, Dec 0 /maximum value
Count, Hex 8 / loop counter decreases
One, Dec 1 /Loop stops
say array:
[Dec -5, Dec 15, Dec -17, Dec 20, Dec -23, Dec 12, Dec 130, Dec -12]
please help guys I'm so lost
Answers
Answer:
The correct answer is C ( W * 5 )