You are implementing a RAID storage system and have found a system with eight 100 GB drives. How much storage space will you hav
1 answer:
Answer:
The space available will vary between 800 GB (100%) and 400 GB (50%) of the total disks, depending on the RAID level.
The OS will handle the RAID as a single disk.
Explanation:
Each RAID level implements parity and redundancy in a different way, so the amount of disks used for this extra information will reduce the space available for actual storage.
Usual RAID levels are:
<u>RAID 0:</u> does not implement any redundancy or parity, so you will have available 100% of the total storage: 8 x 100 GB = 800 GB
<u>RAID 1:</u> Duplicates all the information in one disk to a second disk. Space is reduced in half: 400 GB
<u>RAID 5:</u> Uses the equivalent of 1 disk of parity data distributed evenly on each disk, meaning the space available is of the total disks:
of 800 GB = 700 GB
Writting and reading the information on a RAID storage is handled by a raid controller, either implemented in hardware or software. The OS will "see" a single disk and will read or write information as usual.
You might be interested in
Answer:
#include <iostream>
#include<time.h>
using namespace std;
void sort(int a[20],int n) //selection sort
{
int i,j,temp;
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++) //finds minimum element
{
if(a[i]>a[j]) //swaps minimum element to its right place
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
}
int main()
{
srand(time(NULL));
int arr[20],n=20,i;
for(i=0;i<n;i++)
arr[i]=rand() % 100 + 1; //assigns random number to each array element
cout<<"Before sorting\n";
for(i=0;i<n;i++)
cout<<arr[i]<<" "; //prints array before calling sort func
sort(arr,20); //sort the passed array
cout<<"\nAfter sorting\n";
for(i=0;i<n;i++)
cout<<arr[i]<<" "; //prints array after sorting
return 0;
}
OUTPUT :
Please find the attachment below.
Explanation:
The program above first assigns random number from 1 to 100 to each element of array using rand(). srand(time(NULL)) is used to generate new number every time otherwise same random number will be produced at a time. Then sorting method is called in which selection sort algorithm is used.
Selection sort algorithm finds the minimum element in each pass and place it into its right position. For example - 34,54,12,5 is passed
After Pass 1 - 5 54 12 34
After Pass 2 - 5 12 54 34
After Pass 3 - 5 12 34 54
