MEDIUM
HSSC Clerk
IMPORTANT
Earn 100
The total number of edges in a complete graph of n vertices is:
50% studentsanswered this correctly
Important Questions on Practice Sets
HARD
HSSC Clerk
IMPORTANT
Only the process execution the critical section is allowed access to the shared variable, all other processes should prevent from doing so until the completion of the critical section. This is often refered to as:
MEDIUM
HSSC Clerk
IMPORTANT
Which of the following structures is not a Binary tree?
MEDIUM
HSSC Clerk
IMPORTANT
A heap allows a very efficient implementation of a _____.
MEDIUM
HSSC Clerk
IMPORTANT
Thrashing _____.
MEDIUM
HSSC Clerk
IMPORTANT
The solution to Critical Section Problem is Mutual Exclusion, Progress and Bounded Waiting.
HARD
HSSC Clerk
IMPORTANT
Why the member function has one less argument then the friend function?
HARD
HSSC Clerk
IMPORTANT
In Second Normal Form _____.
HARD
HSSC Clerk
IMPORTANT
The rule for implicit type conversion in 'C' is _____.
