Answer:
The correct option to the following question is CDO(Collateralized Debt Obligation).
Explanation:
CDO(collateralized debt obligations), is the financial tool that is used by the banks to repackage the individual loans into the product sold to the investors on secondary markets.
It developed as the instruments for corporate debts markets, after the year 2002, CDO became the vehicles for refinancing the mortgage backed the securities.
A CDO is the type of the structured asset backed security.
Answer:
I will try to help you answer this. it seems really confusing but I'll do my best to solve it and get it back to you. Hope I'm able to help!
Answer:
The GREEDY Algorithm
Explanation:
Based on the situation given in question, the Greedy algorithm shall give the optimal solution to professor
Suppose that the cities are at locations0 =x0< x1< . . . < x
We shall use the induction method to prove that G is the optimal solution valid for numbers less than n
We assume another solution Z which we initially consider to be optimum as well, based on that when Z fills the tank, it fills it to full level
Let us state the values in case of n intervals. Given below, we say that g1 is the first stop and z1 is also the first stop.
This can be written as ;
G=g1, g2, . . . , gk
Z=z1, z2, . . . , zk’
Here k’ <= k and k < n
Let I be an idex where for the first time gi is not equal to zi
Considering t= maxi Zi
Z′=g1, z2, z3, . . . , zk′
Now since z2, z3, . . . , zk′ should be an optimal stopping pattern for the problem otherwise we have chosen Z, with smaller gas filling (not feasible)
Using induction hypothesis we conclude thatg2, . . . , gk is an optimal stopping pattern, which is based on greedy algorithm
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: social media policy
Explanation:
In order to avoid legal issues and also set clear guidelines and expectations for the employees in an organization, it is required that employers should put a social media policy in place.
A social media policy refers to a document which outlines how an organization and the employees will behave and conduct themselves online. This helps to checkmate and curtail the activities of the employees so that there won't be a detrimental effect on the organization.
