Biology maaaan. I honestly forget
They have a built-in senser that will notify and trigger the computer to tell you that something is wrong.
Answer:
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[10000];//array of ten thousand capacity.
int n=0,min=INT_MAX;//decalring n and min variables.
do{
cin>>a[n];
}while(a[n++]!=0); //using do while loop to take input.
for(int i=0;i<n-1;i++)//looping to n-2th index because 0 is at n-1th index.
{
if(a[i]<min)
{
min=a[i];
}
}
cout<<"The minimum element is "<<min<<endl;//printing the minimum.
return 0;
}
Input:-
5 2 6 78 32 31 21 6 45 2 1 0
Output:-
The minimum element is 1
Explanation:
I have created an array of capacity 10000.Taking input till 0 is entered. Now the 0 is at the n-1 th index so we have to consider elements upto n-2th elements.Using for loop to iterate upto n-2 th index and finding the minimum among those elements.
Answer:
Block 2
Explanation:
Cache mapping is a technique by which the contents of main memory are brought into the cache memory. we have three different types of cache mapping these are; direct, fully associative and k-way set associative mappings. In direct mapping such as the scenario above, the cache has one block in each set, so it is organized into X = Y sets, as such a particular block of main memory can map to only one particular line of the cache and the formula for determining the line number of cache to which a particular block can map is given by (main memory block address) %(number of lines in cache)