<u>Output:</u>
f1 in A
f2 in A
f1 in B
f2 in A
f1 in A
f2 in A
f1 in B
f2 in B
<u>Explanation:</u>
In this snippet, the code makes use of virtual functions. A virtual function is defined as a function that is defined in the base class and redefined in the derived class. If the derived function accesses the virtual function, the program will get executed with the derived class’s version of the function.
In this code, we define the virtual function f1() in class A and also redefine it in class B which is the derived class of A. While executing the program, the function g which takes the object b (class B’s object) as a parameter. It will print class B’s version of f1() rather than class A’s version. This is working off the virtual function.
Answer:
The description for the given question is described in the explanation section below.
Explanation:
Depending on the needs of the device programmers these OS have various locking frameworks. Spinlocks become beneficial for preemptive multitasking processes during which a thread will operate in such an active loop instead of risking a rest queue latency. Mutexes become beneficial to utility lockers.
- Solaris 2 employs flexible mutexes, indicating something like this on preemptive multitasking computers, the mutex is introduced with either a spinning switch.
- Semaphores and state variations are much more effective methods for consistency where a commodity needs to be managed for such a prolonged period of time because spinning is unstable over a prolonged time.
The answer is Salted Password Hashing. The process is similar to hashing., but with a twist. A random value is introduced for each user. This salt value<span> is included with the password when the hash value is calculated and is stored with the user record. Including the salt value means that two users with the same password will have different password hashes.</span>
Answer:
CPU need 50% much faster
disk need 100% much faster
Explanation:
given data
workload spend time CPU = 60%
workload spend time I/O = 40%
achieve overall system speedup = 25%
to find out
How much faster does CPU need and How much faster does the disk need
solution
we apply here Amdahl’s law for the overall speed of a computer that is express as
S = 
.............................1
here f is fraction of work i.e 0.6 and S is overall speed i.e 100% + 25% = 125 % and k is speed up of component
so put all value in equation 1 we get
S =
1.25 = 
solve we get
k = 1.5
so we can say CPU need 50% much faster
and
when f = 0.4 and S = 125 %
put the value in equation 1
S =
1.25 = 
solve we get
k = 2
so here disk need 100% much faster
Answer:
Explanation:
temporal locality can be defined as: when a particular memory is referenced or accessed several times within a specific period of time. In the question, i think the variable that exhibit temporal locality are I, J and 0(all the variable). This is because the variable J and 0 are accessed several times within the loop. I would not have been part of it, but in the A[I][J]=B[I][0]+A[J][I], the variable "I" is also accessed in the addition. this is why it is part of the temporal locality.
