A. Many to one model
B. One to many model
C. Many to many model
D. One to one model

A. Many to one model
B. One to many model
C. Many to many model
D. One to one model

A. The entire process will be blocked
B. A part of the process will stay blocked, with the rest running
C. The entire process will run
D. None of the mentioned

A. Only one thread can access the kernel at a time
B. Many user threads have access to just one kernel thread
C. There is only one kernel thread
D. None of the mentioned

A. Increased concurrency
B. Decreased concurrency
C. Increased or decreased concurrency
D. Concurrency equivalent to other models

A. Other threads are strictly prohibited from running
B. Other threads are allowed to run
C. Other threads only from other processes are allowed to run
D. None of the mentioned

A. Increased concurrency provided by this model
B. Decreased concurrency provided by this model
C. Creating so many threads at once can crash the system
D. Creating a user thread requires creating the corresponding kernel thread

A. When the program does not need multithreading
B. When the program has to be multi-threaded
C. When there is a single processor
D. None of the mentioned

A. The kernel can schedule only one thread at a time
B. There are too many threads to handle
C. It is hard to map threads with each other
D. None of the mentioned

A. Other threads are strictly prohibited from running
B. Other threads are allowed to run
C. Other threads only from other processes are allowed to run
D. None of the mentioned