0% found this document useful (0 votes)
32 views6 pages

SD MCQ Question Mock Test

Uploaded by

nitinraj844126
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views6 pages

SD MCQ Question Mock Test

Uploaded by

nitinraj844126
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Title Level of Difficulty Score Question Description

1. What is the primary function of an operating system?


Easy 1

2. Which of the following is not a process state?


Easy 1

3. What does CPU scheduling primarily aim to achieve?


Easy 1

4. In multithreading, what is a thread?


Easy 1

5. What is the main advantage of multithreading?


Easy 1

6. Which scheduling algorithm is designed to minimize wait time?


Medium 1

7. What is the purpose of the memory management unit (MMU)?


Medium 1

8. What is virtual memory?


Medium 1

9. Which file system is primarily used by Windows operating systems?


Medium 1

10. Which of the following is an example of a concurrency issue?


Medium 1

11. In a multilevel queue scheduling algorithm, what is the main


disadvantage?
Hard 1

12. What is the principle of locality in memory management?


Hard 1
13. Which synchronization mechanism uses a lock to manage access to a
Hard 1 resource?

14. What is the primary purpose of a page replacement algorithm?


Hard 1
15. Which of the following is NOT a characteristic of an ideal operating
Hard 1 system?

16. What does the 'thrashing' phenomenon indicate?


Hard 1
17. In which memory management technique is the physical address space
Hard 1 divided into fixed-size blocks?

18. What is a critical section in concurrent programming?


Hard 1
19. Which of the following is a method of ensuring process
Hard 1 synchronization?

20. What is the main goal of operating system security?


Hard 1
21.What type of memory allocation allows processes to grow and shrink as
Hard 1 needed?

22.Which of the following is a technique to avoid deadlock?


Hard 1
23. In the context of file systems, what does the term "inode" refer to?
Hard 1

24. What is the purpose of a system call?


Hard 1

25. Which of the following scheduling algorithms can lead to starvation?


Hard 1
26. Which technique allows multiple processes to use the same physical
Hard 1 memory space?
27. What is the primary advantage of using a layered approach in operating
Hard 1 system design?

28. What is the role of the dispatcher in process scheduling?


Hard 1

29. Which of the following is a method for implementing multithreading?


Hard 1
30. Which of the following represents a security vulnerability related to
Hard 1 operating systems?

Easy Question

Medium Question

Hard
Correct
Answer Choice 1 Answer Choice 2 Answer Choice 3 Answer Choice 4 Answer
Choice
3. To provide user
1. To manage hardware 2. To run applications 4. All of the above 4
interface

1. Running 2. Waiting 3. Ready 4. Stopping 4

1. Minimize memory
2. Maximize throughput 3. Increase disk I/O 4. Enhance security 2
usage
1. A single sequence of
2. A process 3. A resource allocation 4. A type of memory 1
control
1. Increased memory 2. Improved CPU 3. Simplified
4. Better security 2
usage utilization programming
2. First-Come, First-
1. Round Robin 3. Shortest Job Next (SJN) 4. Priority Scheduling 3
Served (FCFS)
2. To translate virtual
1. To manage I/O 4. To provide user
addresses to physical 3. To schedule processes 2
operations interfaces
addresses
2. A memory allocation 3. A method for increasing 4. A technique to run
1. A type of RAM 2
technique physical memory size multiple OS instances

1. ext4 2. NTFS 3. HFS+ 4. FAT32 2

1. Deadlock 2. Buffer overflow 3. Starvation 4. Both A and C 4

1. It is complex to 2. Starvation of lower-


3. High overhead 4. Requires more memory 2
implement priority processes

2. Memory accesses are


1. Processes need only a 3. All data must be 4. Memory must be
clustered in time and 2
small amount of memory contiguous in memory deallocated after use
space

1. Semaphore 2. Mutex 3. Monitor 4. Barrier 2

2. To manage the
1. To minimize CPU 3. To decide which 4. To optimize disk I/O
allocation of cache 3
usage memory pages to swap out operations
memory

1. User-friendliness 2. High throughput 3. Low security 4. High efficiency 3

2. Excessive page 3. High memory


1. Inefficient CPU usage 4. Increased disk access 2
swapping utilization

1. Paging 2. Segmentation 3. Fragmentation 4. Virtualization 1

1. A section of code that


2. A part of the OS kernel 3. A region of memory 4. An I/O operation 1
accesses shared resources

1. Thread pooling 2. Spinlock 3. Memory mapping 4. Load balancing 2

1. To prevent 3. To optimize 4. To ensure


2. To manage resources 1
unauthorized access performance compatibility

1. Fixed partitioning 2. Dynamic partitioning 3. Contiguous allocation 4. Paging 2

2. Resource allocation
1. Preemption 3. Wait-die scheme 4. Both A and B 4
graph
1. A unique identifier for
2. A type of file 3. A directory structure 4. A block of memory 1
files
1. To provide an interface
2. To execute user-level 3. To manage hardware 4. To create user
between user programs 1
applications resources interfaces
and the OS
2. First-Come, First-
1. Round Robin 3. Shortest Job First (SJF) 4. Priority Scheduling 4
Served (FCFS)

1. Virtual memory 2. Memory-mapped files 3. Shared memory 4. Paging 3

1. Simplicity of the 2. Modularity and easier


3. Improved performance 4. Direct hardware access 2
kernel debugging
2. To switch processes in 4. To handle I/O
1. To allocate resources 3. To manage memory 2
and out of the CPU operations

1. Time-sharing 2. Fork-Join 3. Asynchronous I/O 4. Both A and B 4

1. Buffer overflow 2. File fragmentation 3. Deadlock 4. Thrashing 1


Tags

You might also like