spec sheet is a document that summarizes the performance and other technical characteristics of a product, machine or component.
<span>Disk Defragmenter,
is a windows utility that rearranges the records and unused space on the PC's hard
disk so that the operating system accesses data more rapidly and projects run
quicker. Disk Defragmenter keeps running on a timetable, yet you can likewise
break down and defragment your disk and drives manually.</span>
Answer:
SELECT college, city_state, accre_agency, distance LIMIT 10
Explanation:
Given
Table name: College
See attachment for table
Required
Retrieve top 10 college, state, agency and school distance from the table
To retrieve from a table, we make use of the SELECT query
The select statement is then followed by the columns to be selected (separated by comma (,))
So, we have:
SELECT college, city_state, accre_agency, distance
From the question, we are to select only first 10 records.
This is achieved using the LIMIT clause
i.e. LIMIT 10 for first 10
So, the complete query is:
SELECT college, city_state, accre_agency, distance LIMIT 10
Answer:
Explanation:
Following are the Semaphores:
Customers: Counts waiting customers;
Barbers: Number of idle barbers (0 or 1)
mutex: Used for mutual exclusion.
Cutting: Ensures that the barber won’t cut another customer’s hair before the previous customer leaves
Shared data variable:
count_cust: Counts waiting customers. ------------copy of customers. As value of semaphores can’t access directly.
// shared data
semaphore customers = 0; semaphore barbers = 0; semaphore cutting = 0; semaphore mutex = 1;
int count_cust= 0;
void barber() {
while(true) { //shop is always open
wait(customers); //sleep when there are no waiting customers
wait(mutex); //mutex for accessing customers1
count_cust= count_cust-1; //customer left
signal(barbers);
signal(mutex);
cut_hair();
}
}
void customer() {
wait(mutex); //mutex for accessing count_cust
if (count_cust< n) {
count_cust= count_cust+1; //new customer
signal(customers); signal(mutex);
wait(barbers); //wait for available barbers get_haircut();
}
else { //do nothing (leave) when all chairs are used. signal(mutex);
}
}
cut_hair(){ waiting(cutting);
}
get_haircut(){
get hair cut for some time; signal(cutting);
}
Answer:
6.025seconds
Explanation:
For each link we have,
Dtran = 10mbits/10mbps =1 second
Dprop = 5000km/2×10^8m/sec =0.025sec.
Total delay =( 5 + 2-1) + Dtran+ 2 Dprop= 6.025seconds
