cpu cycles wasting locks over critical sections of programs

locks that avoid time wastage in context switches

locks that work better on multiprocessor systems

a process is allowed to enter its critical section Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .

. when another process is in its critical section

. after a process has made a request to enter its critical section and before the request is granted

. when another process is in its critical section

. before a process has made a request to enter its critical section

A critical section is a program segment Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .

. where shared resources are accessed

. improves concurrency in multi-core system

. resource allocation must be done only once

. there must be a fixed number of resources to allocate

. resource allocation must be done only once

. all deadlocked processes must be aborted

. inversion technique can be used

Which one of the following statements describes the properties achieved?

. progress but not mutual exclusion

. mutual exclusion but not progress

. progress but not mutual exclusion

. neither mutual exclusion nor progress

. both mutual exclusion and progress

The expression 'delayed load' is used in context of

. processor-printer communication

tasks being performed in different stages :

. require about the same amount of time

. require different amount of time

. require about the same amount of time

. require different amount of time with time difference between any two tasks being same

. require different amount with time difference between any two tasks being different

The idea of cache memory is based

. on the property of locality of reference

. on the fact that references generally tend to cluster

79 + Mcqs in Multi-Core Processors in Computer Science Engineering (CSE) Page 2 McqOptions

51.	What are Spinlocks?
A.	cpu cycles wasting locks over critical sections of programs
B.	locks that avoid time wastage in context switches
C.	locks that work better on multiprocessor systems
D.	all of the mentioned
Answer» E.

Discussion

52.	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
Answer» B. . when another process is in its critical section

Discussion

53.	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
Answer» E.

Discussion

54.	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
Answer» D. . mutual exclusion

Discussion

55.	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
Answer» D. . mutual exclusion

Discussion

56.	Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â is the ability of multiple processes to co-ordinate their activities by exchange of information.
A.	. deadlock
B.	. synchronization
C.	. mutual exclusion
D.	. cache
Answer» B. . synchronization

Discussion

57.	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
Answer» D. . mutual exclusion

Discussion

58.	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
Answer» D. . faster execution

Discussion

59.	How many times will process P0 print '0'?
A.	. at least twice
B.	. one
C.	. three
D.	. none of the above
Answer» D. . none of the above

Discussion

60.	A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is
A.	. 4
B.	. 6
C.	. 9
D.	. 8
Answer» E.

Discussion

61.	A critical section is a program segment Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .
A.	. where shared resources are accessed
B.	. single thread of execution
C.	. improves concurrency in multi-core system
D.	. lower resource consumption
Answer» E.

Discussion

62.	A semaphore is a shared integer variable Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .
A.	. lightweight process
B.	. that cannot drop below zero
C.	. program counter
D.	. stack space
Answer» C. . program counter

Discussion

63.	Spinlocks are intended to provide Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â only.
A.	. mutual exclusion
B.	. bounded waiting
C.	. aging
D.	. progress
Answer» C. . aging

Discussion

64.	processes to solve the critical section problem.
A.	. one
B.	. two
C.	. three
D.	. four
Answer» C. . three

Discussion

65.	To avoid deadlock
A.	. there must be a fixed number of resources to allocate
B.	. resource allocation must be done only once
C.	. all deadlocked processes must be aborted
D.	. inversion technique can be used
Answer» B. . resource allocation must be done only once

Discussion

66.	All deadlocks involve conflicting needs for
A.	. resources
B.	. users
C.	. computers
D.	. programs
Answer» B. . users

Discussion

67.	Which one of the following statements describes the properties achieved?
A.	. mutual exclusion but not progress
B.	. progress but not mutual exclusion
C.	. neither mutual exclusion nor progress
D.	. both mutual exclusion and progress
Answer» B. . progress but not mutual exclusion

Discussion

68.	A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:
A.	. data consistency
B.	. race condition
C.	. aging
D.	. starvation
Answer» C. . aging

Discussion

69.	Producer consumer problem can be solved using
A.	. semaphores
B.	. event counters
C.	. monitors
D.	. all of the above
Answer» D. . all of the above

Discussion

70.	Alternative way of a snooping-based coherence protocol, is called a
A.	. write invalidate protocol
B.	. snooping protocol
C.	. directory protocol
D.	. write update protocol
Answer» D. . write update protocol

Discussion

71.	The expression 'delayed load' is used in context of
A.	. processor-printer communication
B.	. memory-monitor communication
C.	. pipelining
D.	. none of the above
Answer» D. . none of the above

Discussion

72.	During the execution of the instructions, a copy of the instructions is placed in the Â Â Â Â Â Â Â Â Â Â .
A.	. register
B.	. ram
C.	. system heap
D.	. cache
Answer» D. . cache

Discussion

73.	tasks being performed in different stages :
A.	. require different amount of time
B.	. require about the same amount of time
C.	. require different amount of time with time difference between any two tasks being same
D.	. require different amount with time difference between any two tasks being different
Answer» B. . require about the same amount of time

Discussion

74.	All nodes in each dimension form a linear array, in the Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .
A.	. star topology
B.	. ring topology
C.	. connect topology
D.	. mesh topology
Answer» E.

Discussion

75.	If no node having a copy of a cache block, this technique is known as
A.	. cached
B.	. un-cached
C.	. shared data
D.	. valid data
Answer» E.

Discussion

76.	In shared bus architecture, the required processor(s) to perform a bus cycle, for fetching data or instructions is
A.	. one processor
B.	. two processor
C.	. multi-processor
D.	. none of the above
Answer» D. . none of the above

Discussion

77.	Parallel programs: Which speedup could be achieved according to AmdahlÂ´s law for infinite number of processors if 5% of a program is sequential and the remaining part is ideally parallel?
A.	. 10
B.	. 20
C.	. 30
D.	. 40
Answer» C. . 30

Discussion

78.	Systems that do not have parallel processing capabilities are
A.	. sisd
B.	. mimd
C.	. simd
D.	. misd
Answer» E.

Discussion

79.	The idea of cache memory is based
A.	. on the property of locality of reference
B.	. on the heuristic 90-10 rule
C.	. on the fact that references generally tend to cluster
D.	. all of the above
Answer» D. . all of the above

Discussion

Explore topic-wise MCQs in Computer Science Engineering (CSE).

What are Spinlocks?

a process is allowed to enter its critical section Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .

Which of the following conditions must be satisfied to solve the critical section problem?

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 Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .

Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .

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

code, resources or data in such a way that only one process has access to shared object at a time.

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then

How many times will process P0 print '0'?

A counting semaphore was initialized to 10. Then 6 P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is

A critical section is a program segment Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .

A semaphore is a shared integer variable Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .

Spinlocks are intended to provide Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â only.

processes to solve the critical section problem.

To avoid deadlock

All deadlocks involve conflicting needs for

Which one of the following statements describes the properties achieved?

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called:

Producer consumer problem can be solved using

Alternative way of a snooping-based coherence protocol, is called a

The expression 'delayed load' is used in context of

During the execution of the instructions, a copy of the instructions is placed in the Â Â Â Â Â Â Â Â Â Â .

tasks being performed in different stages :

All nodes in each dimension form a linear array, in the Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â .

If no node having a copy of a cache block, this technique is known as

In shared bus architecture, the required processor(s) to perform a bus cycle, for fetching data or instructions is

Parallel programs: Which speedup could be achieved according to AmdahlÂ´s law for infinite number of processors if 5% of a program is sequential and the remaining part is ideally parallel?

Systems that do not have parallel processing capabilities are

The idea of cache memory is based