Home / Engineering / Multi-core Processors MCQs / Page 3

Multi-core Processors MCQs | Page - 3

Dear candidates you will find MCQ questions of Multi-core Processors here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

M

Mr. Dubey • 51.17K Points
Coach

Q. 21) How many times will process P0 print '0'?

(A) . at least twice
(B) . one
(C) . three
(D) . none of the above
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 22) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 23) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 24)                      is the ability of multiple processes to co-ordinate their activities by exchange of information.

(A) . deadlock
(B) . synchronization
(C) . mutual exclusion
(D) . cache
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 25) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 26) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 27) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 28) 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
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 29) at any moment (the mutex being initialized to 1)?

(A) 1
(B) 2
(C) 3
(D) none of the mentioned
View Answer Discuss Share

M

Mr. Dubey • 51.17K Points
Coach

Q. 30) 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
View Answer Discuss Share