Are Microsoft an Apple more secure from malicious action because of their closed-source approach?
1 answer:
You might be interested in
Complete Question:
Determine the number of cache sets (S), tag bits (t), set index bits (s), and block offset bits (b) for a 4096-byte cache using 32-bit memory addresses, 8-byte cache blocks and a 8-way associative design. The cache has :
Cache size = 1024 bytes, sets t = 26.8, tag bits, s = 3.2, set index bit =2
Answer:
Check below for explanations
Explanation:
Cache size = 4096 bytes = 2¹² bytes
Memory address bit = 32
Block size = 8 bytes = 2³ bytes
Cache line = (cache size)/(Block size)
Cache line =
Cache line = 2⁹
Block offset = 3 (From 2³)
Tag = (Memory address bit - block offset - Cache line bit)
Tag = (32 - 3 - 9)
Tag = 20
Total number of sets = 2⁹ = 512
Answer:
#include<iostream>
#include<stdlib.h>
using namespace std;
int main(){
//initialization
string str1[5];
int arr_Vote[5];
int Total_Vote=0,max1_Index;
int max1=INT_MIN;
//loop for storing input enter by user
for(int i=0;i<5;i++){
cout<<"Enter the last name of candidate: "<<endl;
cin>>str1[i];
cout<<"Enter the number of vote receive by the candidate: "<<endl;
cin>>arr_Vote[i];
//calculate the sum
Total_Vote = Total_Vote + arr_Vote[i];
//find the index of maximum vote
if(arr_Vote[i]>max1){
max1=arr_Vote[i];
max1_Index=i;
}
}
//display
cout<<"\nThe output is......"<<endl;
//loop for display data of each candidate
for(int i=0;i<5;i++){
cout<<str1[i]<<"\t"<<arr_Vote[i]<<"\t" <<float(arr_Vote[i]*100)/Total_Vote<<"%"<<endl;
}
//display winner
cout<<"The winner candidate is"<<endl;
cout<<str1[max1_Index]<<"\t"<<arr_Vote[max1_Index]<<"\t"<<float(arr_Vote[max1_Index]*100)/Total_Vote<<" %"<<endl;
}
Explanation:
Create the main function and declare the two arrays and variables.
the first array for storing the names, so it must be a string type. second array stores the votes, so it must be int type.
after that, take a for loop and it runs for 5 times and storing the values entered by the user in the arrays.
we also calculate the sum by adding the array data one by one.
In the same loop, we also find the index of the maximum vote. take an if statement and it checks the element in the array is greater than the max1 variable. Max1 variable contains the very small value INT_MIN.
If condition true, update the max1 value and update the max1_Index value.
The above process continues for each candidate for 5 times.
After that, take a for loop and display the data along with percentage by using the formula:
the, finally display the winner by using the max1_Index value.
Answer:
Given address = 94EA6
tag = 0 * 94 ( 10010100 )
line = 0 * 1 D 4 ( 111010100 )
word position = 0*6 ( 110 )
Explanation:
using the direct mapping method
Number of lines = 512
block size = 8 words
word offset = = 3 bit
index bit = = 9 bit
Tag = 20 - ( index bit + word offset ) = 20 - ( 3+9) = 8 bit
Given address = 94EA6
tag = 0 * 94 ( 10010100 )
line = 0 * 1 D 4 ( 111010100 )
word position = 0*6 ( 110 )