Help
Options
Didn't know it?
click below
click below
Knew it?
click below
click below
Don't Know
Remaining cards (0)
Know
retry
shuffle
restart
0:00
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
FORMATIVE OF CS0051
| Question | Answer |
|---|---|
| A Symmetric Multi-Processing (SMP) system has two or more dissimilar processors connected to a single shared main memory. True / False | False |
| Shared data is used by a multi-processor. True / False | True |
| A key advantage of distributed memory architectures is that they are _____ than shared memory systems. more responsive / less complex / easier to program for / more scalable | more scalable |
| A key advantage of distributed memory architectures is that they are more scalable than shared memory systems. True / False | True |
| The tightly coupled set of threads' execution working on a single task is called Distributed Processing. True / False | False |
| Multiple-applications dependently running, are typically called Multithreading. False / True | False |
| In most modern multi-core CPUs, cache coherency is usually handled by the application software. True / False | False |
| A Symmetric Multi-Processing (SMP) system has two or more _____ processors connected to a single _____ main memory. dissimilar; shared / dissimilar; distributed / identical; shared / identical distributed | identical; shared |
| Parallelism naturally leads to concurrency. False / True | True |
| In parallel processing, several instructions are executed simultaneously. False / True | True |
| Parallelism naturally leads to complexity. False / True | True |
| A Symmetric Multi-Processing (SMP) system has two or more identical processors connected to a single distributed main memory. True / False | False |
| Parallel processing refers to the execution of activities at the same time. False / True | True |
| Parallelism naturally leads to dependency. False / True | True |
| A single applications independently running, is typically called Multithreading. False / True | False |
| Multiple-applications independently running, are typically called Multithreading. False / True | False |
| The tightly coupled set of processes' execution working on a single task is called Parallel Processing. False / True | True |
| In most modern multi-core CPUs, cache coherency is usually handled by the processor hardware. True / False | True |
| Parallel processing has single multiple flow. False / True | False |
| In most modern multi-core CPUs, cache coherency is usually handled by the operating system. False / True | False |
| It is necessary in shared memory that the data exists on the same physical device, hence it could not be spread across a cluster of systems. False / True | False |
| UMA stands for Universal Memory Access. True / False | False |
| Parallel computing can increase the _____. scale of problems a program can tackle / all of these answers / number of tasks a program executes in a set time / speed at which a program executes a set number of tasks | all of these answers |
| The four classifications of Flynn's Taxonomy are based on the number of concurrent _____ streams and _____ streams available in the architecture. program; data / instruction; data / input; output / memory; I/O | instruction; data |
| Shared memory scales better than Distributed memory. True / False | False |
| Computer memory usually operates at a much faster speed than processors do. True / False | False |
| Shared memory don't always scale well. True / False | True |
| Each core of modern processors' has their own cache that stores frequently accessed data. True / False | True |
| An SMP system has two or more identical processors which are connected to a single shared memory often through a system bus. True / False | True |
| Modern multi-core PCs fall into the MISD classification of Flynn's Taxonomy. True / False | False |
| A key advantage of distributed memory architectures is that they are more responsive than shared memory systems. False / True | False |
| The tightly coupled set of threads' execution working on multiple task is called Parallel Processing. True / False | True |
| If public data is used by a single-processor, then shared data is used by a multi-processor. False / True | False |
| If private data is used by a single-processor, then shared data is used by a multi-processor. False / True | True |
| A key advantage of distributed memory architectures is that they are less complex than shared memory systems. False / True | False |
| A Symmetric Multi-Processing (SMP) system has two or more identical processors connected to a single shared main memory. True / False | True |
| Execution of several activities at the same time is referred to as parallel processing. False / True | True |
| In a concurrent memory architecture, each processor operates independently, and cannot make changes to its local memory. False / True | False |
| Shared memory doesn't necessarily mean all of the data exists on the same physical device, hence it could be spread across a cluster of systems. False / True | True |
| In a distributed memory architecture, each processor operates independently, and if it makes changes to its local memory, that change is not automatically reflected in the memory of other processors. True / False | True |
| In a concurrent memory architecture, each processor operates independently, and if it makes changes to its local memory, that change is not automatically reflected in the memory of other processors. False / True | False |
| In a concurrent memory architecture, each processor operates independently, and if it makes changes to its local memory, that change is automatically reflected in the memory of other processors. False / True | True |
| Shared memory always scales well. False / True | False |
| Nonuniform Memory Access is often made by logically connecting multiple SMP systems together False / True | False |
| Computer memory usually operates at a much slower speed than processors do. False / True | True |
| In a parallel memory architecture, each processor operates independently, and if it makes changes to its local memory, that change is not automatically reflected in the memory of other processors. False / True | False |
| In a distributed memory architecture, each processor operates dependently, and if it makes changes to its local memory, that change is not automatically reflected in the memory of other processors. False / True | False |
| Distributed processing has single execution flow. False / True | False |
| Parallel processing has single execution flow. False / True | False |
| Distributed processing is the term used for simultaneous access to a resource, physical or logical. False / True | False |
| In most modern multi-core CPUs, cache coherency is usually handled by the _____. processor hardware / user / application software / operating system | processor hardware |
| Distributed memory can be easily scaled. True / False | True |
| UMA stands for Uniform Memory Access. True / False | True |
| The four classifications of Flynn's Taxonomy are based on the number of concurrent instruction streams and I/O streams available in the architecture. True / False | False |
| The four classifications of Flynn's Taxonomy are based on the number of concurrent memory streams and I/O streams available in the architecture. False / True | False |
| In most modern multi-core CPUs, cache coherency is usually handled by the user. True / False | False |
| Concurrency is the term used for simultaneous access to a resource, physical or logical. False / True | True |
| Parallel computing can increase the speed at which a program executes a set number of tasks. False / True | True |
| Data transfer over a bus is much faster. False / True | False |
| An SMP system a single processor connected to a single shared memory often through a serial circuit. True / False | False |
| An SMP system a single processor connected to a single shared memory often through a system bus. True / False | False |
| Each core of modern processors' has their own cache that stores not frequently accessed data. True / False | False |
| Modern multi-core PCs fall into the _____ classification of Flynn's Taxonomy. SISD / MIMD / SIMD / MISD | MIMD |
| Parallel computing can increase the scale of problems a program can tackle. True / False | True |
| Cache coherency is not an issue handled by the hardware in multicore processors. False / True | False |
| Nonuniform Memory Access is often made by physically connecting multiple SMP systems together. True / False | True |
| The four classifications of Flynn's Taxonomy are based on the number of concurrent input streams and output streams available in the architecture. True / False | False |
| Distributed memory scales better than Shared memory. False / True | True |
| It is possible for two tasks to execute concurrently using a single-core processor. True / False | True |
| The time required to create a new thread in an existing process is greater than the time required to create a new process. False / True | False |
| In most operating systems, the _____ determines when each of the threads and processes gets scheduled to execute. user / application software / processor hardware / operating system | operating system |
| A process contains one or more other processes. False / True | False |
| Graphical user interface (GUI) for an accounting application would benefit much from parallel execution. True / False | False |
| Processes are faster to switch between than threads. True / False | False |
| It is possible for two tasks to execute in parallel using a single-core processor. True / False | False |
| A thread that calls the join method on another thread will enter the blocked state until the other thread finishes executing. False / True | True |
| The operating system assigns each process a unique process ID number. False / True | True |
| The operating system assigns each process a unique _____. process ID number / CPU core / number of threads / process name | process ID number |
| It is possible for two tasks to execute concurrently or in parallel using a single-core processor. True / False | True |
| System logging application that frequently writes to a database would benefit much from parallel execution. True / False | True |
| Processes are considered more "lightweight" than threads. True / False | False |
| If Thread A calls the lock() method on a Lock that is already possessed by Thread B, Thread B will block and wait for Thread A to execute the critical section. True / False | False |
| What happens if Thread A calls the lock() method on a Lock that is already possessed by Thread B? | Thread A will block and wait until Thread B calls the unlock() method. |
| The operating system assigns each process a unique process name. True / False | False |
| In most operating systems, the application software determines when each of the threads and processes gets scheduled to execute. True / False | False |
| Concurrent tasks execute at the same time. False / True | False |
| Processes _____ than threads. are considered more "lightweight" / are simpler to communicate between / are faster to switch between / require more overhead to create | require more overhead to create |
| If Thread A calls the lock() method on a Lock that is already possessed by Thread B, Thread A and Thread B will both possess the Lock. False / True | False |
| A thread that calls the join method on another thread will enter the new state until the other thread finishes executing. False / True | False |
| If you run multiple Java applications at the same time, they will execute in lower. False / True | True |
| Which of these applications would benefit the most from parallel execution? | math library for processing large matrices |
| Processes are simpler to communicate between than threads. True / False | False |
| A thread contains one or more processes. False / True | False |
| It is possible for two tasks to execute _____ using a single-core processor. None of the mentioned / in parallel / concurrently / concurrently or in parallel | concurrently |
| If Thread A calls the lock() method on a Lock that is already possessed by Thread B, Thread A will immediately take possession of the Lock from Thread B. False / True | False |
| In most operating systems, the operating system determines when each of the threads and processes gets scheduled to execute. True / False | True |
| If Thread A calls the lock() method on a Lock that is already possessed by Thread B, Thread A will block and wait until Thread B calls the unlock() method. False / True | True |
| Math library for processing large matrices would benefit much from parallel execution. False / True | True |
| The operating system assigns each process a unique number of threads. False / True | False |
| The operating system assigns each process a unique CPU core. False / True | False |
| If you run multiple Java applications at the same time, they will execute in equivalent. False / True | False |
| Tool for downloading multiple files from the Internet at the same time would benefit much from parallel execution. False / True | True |
| A _____ contains one or more _____. process; threads / process; other processes / thread; other threads / thread; processes | process; threads |
| Processes require more overhead to create than threads. False / True | True |
| Why would ThreadA call the ThreadB.join() method? | ThreadA needs to wait until after ThreadB has terminated to continue. |
| A process can be terminated due to normal exit and fatal error. True / False | True |
| Every thread is independent and has its own separate address space in memory. True / False | False |
| In most operating systems, the processor hardware determines when each of the threads and processes gets scheduled to execute. False / True | False |
| A process can be both single threaded and multithreaded. False / True | True |
| You can safely expect threads to execute in the same relative order that you create them. False / True | False |
| In most operating systems, the user determines when each of the threads and processes gets scheduled to execute. False / True | False |
| Data races can be hard to identify because the data race may not always occur during execution to cause a problem. | True |
| Data race occurs when a thread is unable to gain access to a necessary resource, and is therefore unable to make progress. | False |
| Read-write locks can improve a program's performance compared to using a standard mutex. | True |
| Data races can be hard to identify because it is impossible to identify the potential for a data race. | False |
| Unlike during a deadlock, the threads in a livelock scenario are _____. | actively executing without making useful progress |
| A possible strategy to resolve a livelock between multiple threads is thru patience because if you wait long enough all livelocks will eventually resolve themself. | False |
| Unlike during a deadlock, the threads in a livelock scenario are still making progress towards their goal. | False |
| The processor decides when each thread gets scheduled to execute. | False |
| Having too many concurrent threads can lead to starvation. | True |
| Locker Mutex protects critical section of the code to defend against data races, which can occur when multiple threads are concurrently accessing the same location in memory and at least one of those threads is writing to that location. | True |
| To lock a mutex multiple times, using a reentrant mutex may seem like an easy way to avoid a deadlock. | True |
| The reader-writer lock is useful especially when there are lots of threads that only need to be read. | True |
| To avoid livelock, ensure that only one process takes action chosen by priority or some other mechanism, like random selection. | True |
| Try lock or try enter is a blocking version of the lock or acquire method. | False |
| When the threads in the program are not making progress, you can determine if it is due to a deadlock or a livelock waiting to see if the problem eventually resolves itself. | False |
| Protecting a critical section of code with mutual exclusion means implementing proper error handling techniques to catch any unexpected problems. | False |
| Two threads that are both reading and writing the same shared variable has no potential for a data race. | False |
| The best use case for using a ReadWriteLock is when lots of threads need to read the value of a shared variable, but only a few thread need to modify its value. | True |
| A maximum of 2 threads can possess the ReadLock while another thread has a lock on the WriteLock. | False |
| Which of these scenarios does NOT have the potential for a data race? | Two threads are both reading the same shared variable. |
| What does it mean to protect a critical section of code with mutual exclusion? | Prevent multiple threads from concurrently executing in the critical section. |
| What is the maximum number of threads that can possess the WriteLock of a ReadWriteLock at the same time? | 1 |
| Which of these scenario describes the best use case for using a ReadWriteLock? | Lots of threads need to read the value of a shared variable, but only a few thread need to modify its value. |
| Starvation occurs when a thread is unable to gain access to a necessary resource, and is therefore unable to make progress. | True |
| When the threads in the program are not making progress, you can determine if it is due to a deadlock or a livelock by using the Resource Monitor to investigate the program's CPU usage to see if it is actively executing. | True |
| The best use case for using a ReadWriteLock is when lots of threads need to modify the value of a shared variable. | False |
| Deadlock occurs when each member of a group is waiting for some other member to take action, and as a result, neither member is able to make progress. | True |
| No thread can possess the ReadLock while another thread has a lock on the WriteLock. | True |
| A possible strategy to resolve a livelock between multiple threads is thru implementing a randomized mechanism to determine which thread goes first. | True |
| Data races can be hard to identify because the problems that data races cause have an insignificant impact on the program's performance. | False |
| When the threads in the program are not making progress, you can determine if it is due to a deadlock or a livelock by randomly guessing between deadlock and livelock. | False |
| Dining Philosophers Problem is a classic example that's used to illustrate synchronization issues when multiple threads are competing for multiple locks. | True |
| There is no limit on the number of threads that can possess the ReadLock while another thread has a lock on the WriteLock. | False |
| How many threads can possess the ReadLock while another thread has a lock on the WriteLock? | 0 |
| Why can potential data races be hard to identify? | The data race may not always occur during execution to cause a problem. |
| A ReentrantLock can be locked _____. | multiple times by the same thread |
| The threads in your program are clearly not making progress. How might you determine if it is due to a deadlock or a livelock? | Use the Resource Monitor to investigate the program's CPU usage to see if it is actively executing. |
| Only 1 thread can possess the ReadLock while another thread has a lock on the WriteLock. | False |
| When the threads in the program are not making progress, you can determine if it is due to a deadlock or a livelock by using the Resource Monitor to investigate the program's memory usage to see if it continues to grow. | False |
| Protecting a critical section of code with mutual exclusion means that whenever a thread enters the critical section, it pauses all other threads in the program. | False |
| Data races can be hard to identify because data races are caused by hardware errors and cannot be debugged in software. | False |
| Unlike during a deadlock, the threads in a livelock scenario are stuck in a blocked state waiting on other threads. | False |
| The best use case for using a ReadWriteLock is when lots of threads need to modify the value of a shared variable, but only a few thread need to read its value. | False |
| How many threads can possess the ReadLock while another thread has a lock on the WriteLock? | 0 |
| A maximum of 2 threads can possess the WriteLock of a ReadWriteLock at the same time. | False |
| There is no limit on the number of threads that can possess the ReadLock while another thread has a lock on the WriteLock. | False |
| What is the maximum number of threads that can possess the WriteLock of a ReadWriteLock at the same time? | 1 |
Created by:
Va_li