Scribd
Upload
10 views

CSCT2103 Introductory Operating Systems CA Questions 2024

CA for CSCT2103 Introductory Operating Systems

Uploaded by

Nzenapou Lv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

CSCT2103 Introductory Operating Systems CA Questions 2024

CA for CSCT2103 Introductory Operating Systems

Uploaded by

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

REPUBLIC OF CAMEROON The UNIVERSITY OF BAMENDA

Peace-Work-Fatherland P.O. Box 39 Bambili

First Semester Continuous Assessment


School: HTTTC Department: Computer Science Option: FCS and ICT Lecturer: Pr ONABID Mathias
Course Code: CSCT2103 Course Title: Introductory Operating Systems Credit value: 03

Date: 12 /12/2024 Hall: SOA 2 Time: 3-4pm


Instructions: Answer all questions Duration: 1 HOUR

Section A: Multiple-Choice Questions (20 Marks)


1. What is the primary purpose of CPU scheduling? (b) Managing hardware resources
(a) Minimize resource usage (c) Application software execution
(b) Maximize throughput and CPU utilization (d) Text editing
(c) Reduce disk I/O 8. What type of operating system is Unix?
(d) Enable virtual memory (a) Batch processing
2. Which scheduling algorithm suffers from the (b) Real-time
“convoy effect”? (c) Multi-user and multitasking
(a) First-Come-First-Serve (FCFS) (d) Single-tasking
(b) Shortest Job First (SJF) 9. What is the primary advantage of a time-sharing
(c) Round Robin (RR) operating system?
(d) Priority Scheduling (a) Improved response time
3. Which condition is NOT necessary for a deadlock to (b) Reduced multitasking capability
occur? (c) Simplified scheduling
(a) Circular wait (d) Hardware dependency
(b) Mutual exclusion 10. Which OS type uses the "spooling" technique for
(c) Preemption managing input/output?
(d) Hold and wait (a) Real-time OS
4. What is the key feature of paging in memory (b) Batch processing OS
management? (c) Multi-tasking OS
(a) Continuous allocation of memory (d) Distributed OS
(b) Logical addresses mapped to physical frames 11. In distributed operating systems, where are
(c) Fixed segment sizes resources are located?
(d) Direct memory access (a) On a single central computer
5. In Round Robin scheduling, if the time quantum is (b) Across multiple computers in a network
too small, what is the consequence? (c) On a single user’s desktop
(a) Reduced context switching overhead (d) In cloud storage only
(b) High throughput 12. What is the state of a process that is ready to execute
(c) Excessive context switching overhead but waiting for CPU allocation?
(d) Increased waiting time for all processes (a) Running
6. What is the key purpose of a Resource Allocation (b) Ready
Graph (RAG)? (c) Waiting
(a) Visualize memory usage (d) Terminated
(b) Represent deadlock conditions 13. What is a context switch?
(c) Manage process scheduling (a) Switching between memory segments
(d) Map logical addresses to physical frames (b) Saving and restoring the state of a process
7. The kernel is responsible for which of the following? (c) Moving data between disks
(a) User interface (d) Changing the OS kernel

1
14. How does a system recover from a deadlock? (b) Prevent race conditions and ensure data integrity
(a) Ignoring the deadlock (c) Improve system performance
(b) Restarting all processes (d) Manage CPU scheduling
(c) Killing one or more processes or preempting resources 20. What does CPU scheduling determine?
(d) Increasing system memory (a) Which process is terminated
15. Which method ensures deadlock does not occur? (b) Which process gets access to the CPU next
(a) Deadlock ignorance (c) Which data is written to memory
(b) Deadlock detection (d) Which resource is used first
(c) Deadlock avoidance 21. Which of the following does NOT affect CPU
(d) Context switching utilization?
16. What is the main advantage of paging? (a) Preemptive scheduling
(a) Reduced memory overhead (b) Resource allocation
(b) Avoidance of external fragmentation (c) Disk access
(c) Simplified OS implementation (d) Context switching
(d) Variable page sizes 22. What happens if the quantum time for a Round
17. What does segmentation divide memory into? Robin scheduler is very large?
(a) Fixed-size blocks (a) The system runs smoothly without context switching
(b) Variable-length segments (b) It behaves similarly to FCFS
(c) Frames (c) It will terminate all processes
(d) Pages (d) It minimizes CPU usage
18. What is a critical section? 23. Which scheduling algorithm minimizes the average
(a) A region that must be executed sequentially wait time?
(b)A shared memory region accessed by multiple processes (a) FCFS
(c) An OS-controlled memory segment (b) SRTF
(d) A thread execution boundary (c) Round Robin
19. What is the primary goal of process synchronization? (d) SJF
(a) Enable multitasking

Section B (7 Marks)
a) Describe the concept of a race condition and explain how it can be avoided. (2 marks)
b) Consider the set of 5 processes whose arrival time and burst time and priority are given below:
Process Id Arrival time Burst time Priority
P1 0 4 2
P2 1 3 3
P3 2 1 4
P4 3 5 5
P5 4 2 5

If the CPU scheduling policy is priority preemptive, calculate the average waiting time and average
turnaround time. (Higher number represents higher priority). (5 marks)

GOOD LUCK!!!

You might also like