Q.1
Parallel architectures affect parallelization?
  • . performance
  • . latency
  • . bandwidth
  • . accuracy
Q.2
The size of the initial chunksize                       .
  • . total_no_of_iterations / max_threads
  • . total_no_of_remaining_iterations / max_threads
  • . total_no_of_iterations / no_threads
  • . total_no_of_remaining_iterations / no_threads
Q.3
Active in the parallel section region.
  • . omp_get_num_procs ( )
  • . omp_get_num_threads ( )
  • . omp_get_thread_num ( )
  • . omp_set_num_threads ( )
Q.4
The                          specifies that the iterations of the for loop should be executed in parallel by multiple threads.
  • . sections construct
  • . for pragma
  • . single construct
  • . parallel for construct
Q.5
Code of functions that are called (directly or indirectly) from within the parallel region.
  • . lexical extent
  • . static extent
  • . dynamic extent
  • . none of the above
Q.6
Program, i.e., each thread executes the same code.
  • . parallel
  • . section
  • . single
  • . master
Q.7
When compiling an OpenMP program with gcc, what flag must be included?
  • . -fopenmp
  • . #pragma omp parallel
  • . –o hello
  • . ./openmp
Q.8
The signal operation of the semaphore basically works on the basic              system call.
  • continue()
  • wakeup()
  • getup()
  • start()
Q.9
(not necessarily immediately)?
  • . #pragma omp section
  • . #pragma omp parallel
  • . none
  • . #pragma omp master
Q.10
Here, w1 and w2 have shared variables, which are initialized to false. Which one of the following statements is TRUE about the above construct?
  • it does not ensure mutual exclusion
  • it does not ensure bounded waiting
  • it requires that processes enter the critical section in strict alternation
  • it does not prevent deadlocks but ensures mutual exclusion
Q.11
At any moment (the mutex being initialized to 1)?
  • 1
  • 2
  • 3
  • none of the mentioned
Q.12
What is the main disadvantage of spinlocks?
  • they are not sufficient for many process
  • they require busy waiting
  • they are unreliable sometimes
  • they are too complex for programmers
Q.13
What are Spinlocks?
  • cpu cycles wasting locks over critical sections of programs
  • locks that avoid time wastage in context switches
  • locks that work better on multiprocessor systems
  • all of the mentioned
Q.14
A process is allowed to enter 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
  • . none of the mentioned
Q.15
Which of the following conditions must be satisfied to solve the critical section problem?
  • . mutual exclusion
  • . progress
  • . bounded waiting
  • . all of the mentioned
Q.16
Paths that have an unbounded number of allowed nonminimal hops from packet sources, this situation is referred to as                  .
  • . livelock
  • . deadlock
  • . synchronization
  • . mutual exclusion
Q.17
is the ability of multiple processes to co-ordinate their activities by exchange of information.
  • . deadlock
  • . synchronization
  • . mutual exclusion
  • . cache
Q.18
Code, resources or data in such a way that only one process has access to shared object at a time.
  • . readers_writer locks
  • . barriers
  • . semaphores
  • . mutual exclusion
Q.19
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then
  • . better system utilization
  • . deadlock can never occur
  • . responsiveness
  • . faster execution
Q.20
How many times will process P0 print '0'?
  • . at least twice
  • . one
  • . three
  • . none of the above
0 h : 0 m : 1 s