wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Threads and Concurrency Quiz LATE (BSIT 204)

Total questions: 40

Worksheet time: 20mins

Name
Class
Date
1.

A thread is also known as a:

a)

Heavyweight process

b)

Lightweight process

c)

Job scheduler

d)

Resource manager

2.

Which attribute uniquely identifies a thread?

a)

Program counter

b)

Thread ID

c)

Base priority

d)

Register

3.

In Windows, which attribute shows the cumulative execution time of a thread?

a)

Thread exit status

b)

Thread execution time

c)

Alert status

d)

Suspension count

4.

Which relationship describes one process with multiple threads?

a)

1:1

b)

M:1

c)

1:M

d)

M:M

5.

In thread states, when a thread waits for an event, it is in:

a)

Running

b)

Ready

c)

Blocked

d)

Finished

6.

Which operation creates a thread when a new process is formed?

a)

Block

b)

Spawn

c)

Finish

d)

Resume

7.

Which thread type is managed completely in user space?

a)

User-level thread

b)

Kernel-level thread

c)

Combined thread

d)

System thread

8.

A major advantage of user-level threads is:

a)

No mode switch overhead

b)

Better crash resilience

c)

Simultaneous scheduling by kernel

d)

Guaranteed priority scheduling

9.

Which OS is an example of using the combined user- and kernel-level approach?

a)

MS-DOS

b)

Solaris

c)

Linux v1

d)

Classic UNIX

10.

Which is NOT an advantage of kernel-level threads?

a)

Multithreading kernel routines

b)

Scheduling on a per-thread basis

c)

No kernel involvement in management

d)

Parallel scheduling on multiprocessors

11.

The ability of an OS to support multiple concurrent execution paths in one process is called:

a)

Multiprogramming

b)

Multithreading

c)

Multiprocessing

d)

Multitasking

12.

In multithreading, communication between threads within a process is:

a)

Slower than interprocess communication

b)

Not possible

c)

Faster and direct

d)

Requires a separate kernel API

13.

Which benefit of multithreading allows applications to remain interactive during long tasks?

a)

Responsiveness

b)

Resource sharing

c)

Economical

d)

Scalability

14.

Which benefit of multithreading becomes more significant in multiprocessor systems?

a)

Responsiveness

b)

Resource sharing

c)

Economical

d)

Scalability

15.

What happens to all threads if a process is swapped out?

a)

Only active threads remain

b)

All threads are swapped out

c)

Only the main thread is swapped

d)

Threads continue independently

16.

Which thread library feature allows saving and restoring execution state?

a)

API

b)

Context switching

c)

Synchronization

d)

Deadlock handling

17.

Which Windows attribute lets a thread run on specific CPUs only?

a)

Base priority

b)

Thread context

c)

Processor affinity

d)

Execution time

18.

Which type of threads save overhead by avoiding kernel mode switches?

a)

User-level threads

b)

Kernel-level threads

c)

Combined approach

d)

Process-level threads

19.

The main drawback of multithreading regarding application stability is:

a)

Low responsiveness

b)

Crash resilience

c)

High memory cost

d)

Complex priority management

20.

Which is an example of a multithreaded application?

a)

Calculator app

b)

Web browser loading images while rendering text

c)

Disk formatting utility

d)

BIOS loader

21.

The management of multiple processes within one CPU is:

a)

Multiprogramming

b)

Multiprocessing

c)

Distributed processing

d)

Multithreading

22.

Which term refers to indivisible execution of instructions?

a)

Critical section

b)

Race condition

c)

Atomic operation

d)

Monitor

23.

Which problem occurs when the outcome depends on execution timing?

a)

Deadlock

b)

Starvation

c)

Race condition

d)

Mutual exclusion

24.

Which OS mechanism allows one process to signal another using an integer value?

a)

Monitor

b)

Semaphore

c)

Mutex lock

d)

Event flag

25.

A binary semaphore differs from a counting semaphore because it:

a)

Uses only 0 and 1 values

b)

Allows multiple processes simultaneously

c)

Stores condition variables

d)

Handles priority scheduling

26.

Which concurrency mechanism requires the locker to be the one unlocking it?

a)

Binary semaphore

b)

Mutex lock

c)

Spinlock

d)

Monitor

27.

Which mechanism makes a process wait until a condition becomes true?

a)

Event flag

b)

Condition variable

c)

Mailbox

d)

Monitor

28.

Which describes permanent blocking of processes competing for resources?

a)

Starvation

b)

Deadlock

c)

Livelock

d)

Concurrency

29.

A deadlock involving two processes competing for a disk file and tape drive involves:

a)

Consumable resources

b)

Reusable resources

c)

Virtual resources

d)

Shared caches

30.

Which is NOT a necessary condition for deadlock?

a)

Mutual exclusion

b)

Hold and wait

c)

Preemption

d)

Circular wait

31.

Which condition means resources cannot be forcibly taken away?

a)

Hold and wait

b)

Mutual exclusion

c)

No preemption

d)

Circular wait

32.

Which tool represents resource allocation visually?

a)

Condition variable

b)

Resource allocation graph

c)

Mutex diagram

d)

Spinlock table

33.

Deadlock prevention strategy involves:

a)

Allowing all conditions but controlling allocation timing

b)

Periodically detecting cycles

c)

Designing system to disallow one of the four conditions

d)

Rolling back blocked processes

34.

Which deadlock avoidance technique denies process start if it risks deadlock?

a)

Resource allocation denial

b)

Process initiation denial

c)

Circular wait denial

d)

Preemption

35.

Which strategy grants requests freely but checks for deadlocks periodically?

a)

Prevention

b)

Avoidance

c)

Detection

d)

Starvation control

36.

Which recovery method involves aborting all deadlocked processes?

a)

Rollback

b)

Termination of all

c)

Resource preemption

d)

Successive abortion

37.

Which deadlock condition is a consequence of the first three?

a)

Hold and wait

b)

Circular wait

c)

No preemption

d)

Mutual exclusion

38.

Which mechanism involves infinite looping until a lock is free?

a)

Mutex

b)

Spinlock

c)

Monitor

d)

Semaphore

39.

Which strategy for handling deadlocks requires knowing maximum resource needs in advance?

a)

Prevention

b)

Avoidance

c)

Detection

d)

Rollback

40.

Which criterion may be used in selecting a process to abort during recovery?

a)

Process with highest output so far

b)

Process with least resources allocated

c)

Process with longest execution time

d)

Process with highest priority