πŸ“Š Multi-core Processors
Q. How many times will process P0 print '0'?
  • (A) . at least twice
  • (B) . one
  • (C) . three
  • (D) . none of the above
πŸ’¬ Discuss
βœ… Correct Answer: (C) . three
πŸ“Š Multi-core Processors
Q. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then
  • (A) . better system utilization
  • (B) . deadlock can never occur
  • (C) . responsiveness
  • (D) . faster execution
πŸ’¬ Discuss
βœ… Correct Answer: (C) . responsiveness
πŸ“Š Multi-core Processors
Q. code, resources or data in such a way that only one process has access to shared object at a time.
  • (A) . readers_writer locks
  • (B) . barriers
  • (C) . semaphores
  • (D) . mutual exclusion
πŸ’¬ Discuss
βœ… Correct Answer: (C) . semaphores
πŸ“Š Multi-core Processors
Q. is the ability of multiple processes to co-ordinate their activities by exchange of information.
  • (A) . deadlock
  • (B) . synchronization
  • (C) . mutual exclusion
  • (D) . cache
πŸ’¬ Discuss
βœ… Correct Answer: (A) . deadlock
πŸ“Š Multi-core Processors
Q. Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as .
  • (A) . livelock
  • (B) . deadlock
  • (C) . synchronization
  • (D) . mutual exclusion
πŸ’¬ Discuss
βœ… Correct Answer: (C) . synchronization
πŸ“Š Multi-core Processors
Q. Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a .
  • (A) . livelock
  • (B) . critical section
  • (C) . deadlock
  • (D) . mutual exclusion
πŸ’¬ Discuss
βœ… Correct Answer: (C) . deadlock
πŸ“Š Multi-core Processors
Q. Which of the following conditions must be satisfied to solve the critical section problem?
  • (A) . mutual exclusion
  • (B) . progress
  • (C) . bounded waiting
  • (D) . all of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (D) . all of the mentioned
πŸ“Š Multi-core Processors
Q. a process is allowed to enter its critical section .
  • (A) . after a process has made a request to enter its critical section and before the request is granted
  • (B) . when another process is in its critical section
  • (C) . before a process has made a request to enter its critical section
  • (D) . none of the mentioned
πŸ’¬ Discuss
βœ… Correct Answer: (A) . after a process has made a request to enter its critical section and before the request is granted
πŸ“Š Multi-core Processors
Q. Here, w1 and w2 have shared variables, which are initialized to false. Which one of the following statements is TRUE about the above construct?
  • (A) it does not ensure mutual exclusion
  • (B) it does not ensure bounded waiting
  • (C) it requires that processes enter the critical section in strict alternation
  • (D) it does not prevent deadlocks but ensures mutual exclusion
πŸ’¬ Discuss
βœ… Correct Answer: (D) it does not prevent deadlocks but ensures mutual exclusion

Jump to