BEL PE · Computer Science

Operating Systems Previous Year Questions

19 Operating Systems (Computer Science) questions asked in BEL PE previous year papers, each with the correct answer and explanation. Read them free on UTpaper, or attempt the full papers as timed online tests.

  • 19 questions
  • Official answer key
  • Free

Other Computer Science topics

Q1BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
During the design and analysis process of an algorithm to find the kth smallest element in an unsorted array, a researcher proposes using a modified divide-and-conquer approach that always divides the array into five nearly equal parts, recursively selects the median of each part, and then finds the median of those medians to use as a pivot for partitioning. Which of the following best describes the time complexity and design implication of this algorithm?
  1. AO(n); because the median-of-medians approach ensures balanced partitions and linear-time selection.
  2. BO(n log n); because the algorithm behaves like mergesort.
  3. CO(log n); because the recursion depth reduces logarithmically.
  4. DO(n²); because repeated partitioning leads to quadratic comparisons.
Show answerHide answer

Correct answer: (A) O(n); because the median-of-medians approach ensures balanced partitions and linear-time selection.

Q2BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
A system uses variable partition memory management with the following free memory blocks (in KB): Block 1: 100, Block 2: 500, Block 3: 200, Block 4: 300, Block 5: 600 Four processes arrive in the following order with their memory requirements (in KB): P1: 212, P2: 417, P3: 112, P4: 426 Using the Best Fit allocation strategy, determine which block each process is allocated to and how much total internal fragmentation remains at the end of all allocations.
  1. AP1 → Block 3, P2 → Block 2, P3 → Block 1, P4 → Block 5; Total internal fragmentation = 159 KB
  2. BP1 → Block 2, P2 → Block 4, P3 → Block 1, P4 → Block 5; Total internal fragmentation = 171 KB
  3. CP1 → Block 4, P2 → Block 2, P3 → Block 3, P4 → Block 5; Total internal fragmentation = 433 KB
  4. DP1 → Block 4, P2 → Block 5, P3 → Block 1, P4 → Block 2; Total internal fragmentation = 169 KB
Show answerHide answer

Correct answer: (C) P1 → Block 4, P2 → Block 2, P3 → Block 3, P4 → Block 5; Total internal fragmentation = 433 KB

Q3BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
In Kruchten's 4+1 view model of software architecture, which view shows the key abstractions in the system as objects or object classes?
  1. ALogical view
  2. BDevelopment view
  3. CProcess view
  4. DPhysical view
Show answerHide answer

Correct answer: (A) Logical view

Q4BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
A system uses fixed partitioning with the following memory blocks and process allocations: Block Size (MB) – Process Size (MB) 4 – 1 8 – 7 8 – 7 16 – 14 Which statement is true about internal and external fragmentation?
  1. AInternal fragmentation = 7 MB; External fragmentation = 0 MB
  2. BInternal fragmentation = 7 MB; External fragmentation = 4 MB
  3. CInternal fragmentation = 4 MB; External fragmentation = 3 MB
  4. DInternal fragmentation = 0 MB; External fragmentation = 7 MB
Show answerHide answer

Correct answer: (A) Internal fragmentation = 7 MB; External fragmentation = 0 MB

Q5BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
Which of the following shows the correct order of the four main activities in the Requirements Engineering process?
  1. ARequirements validation → Requirements elicitation → Feasibility study → Requirements specification
  2. BRequirements specification → Requirements elicitation → Feasibility study → Requirements validation
  3. CFeasibility study → Requirements elicitation and analysis → Requirements specification → Requirements validation
  4. DRequirements elicitation → Requirements validation → Feasibility study → Requirements specification
Show answerHide answer

Correct answer: (C) Feasibility study → Requirements elicitation and analysis → Requirements specification → Requirements validation

Q6BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
In an FCFS-scheduled system, five processes arrive at time 0: P1 (CPU-bound, 20 ms) and P2–P5 (I/O-bound, 2–5 ms). Which outcome is most likely under FCFS?
  1. ACPU utilization improves because short processes preempt the long one.
  2. BAverage waiting time becomes minimal for all processes.
  3. CContext switching increases as I/O-bound processes repeatedly interrupt P1.
  4. DI/O-bound processes face starvation due to the convoy effect caused by P1.
Show answerHide answer

Correct answer: (D) I/O-bound processes face starvation due to the convoy effect caused by P1.

Q7BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
In non-preemptive scheduling, when does context switching occur?
  1. AWhen a process is blocked
  2. BOnly when the process finishes
  3. CWhenever a new process arrives
  4. DOn time slice expiry
Show answerHide answer

Correct answer: (B) Only when the process finishes

Q8BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
A data scientist is developing a predictive model for loan default detection using a dataset that contains labelled examples of previous loan applications marked as 'defaulted' or 'not defaulted'. However, during model training, the algorithm shows very high accuracy on training data but performs poorly on new unseen test data. Despite adding more labelled data, the issue persists. Which of the following best explains the underlying problem in the supervised learning process?
  1. AThe model suffers from overfitting due to poor generalisation.
  2. BThe dataset lacks sufficient labelling for supervised learning.
  3. CThe model applies an unsupervised clustering technique instead of classification.
  4. DThe algorithm fails due to lack of a defined loss function.
Show answerHide answer

Correct answer: (A) The model suffers from overfitting due to poor generalisation.

Q9BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
In a multimedia operating system, which of the following functionalities is most critical to ensure continuous playback of audio and video streams without jitter or frame drops?
  1. AFile system encryption and access control
  2. BSupport for multiple user logins with access control
  3. CReal-time process scheduling with deadline constraints
  4. DBatch processing for background tasks
Show answerHide answer

Correct answer: (C) Real-time process scheduling with deadline constraints

Q10BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
In the process of converting a Moore machine to an equivalent Mealy machine, which of the following statements is true?
  1. AThe number of states in the Mealy machine is always greater than that in the Moore machine.
  2. BMealy machine can produce outputs one input symbol earlier than the equivalent Moore machine.
  3. CThe Moore machine requires outputs to depend on both current state and input symbol.
  4. DThe conversion is not possible unless the Moore machine is deterministic.
Show answerHide answer

Correct answer: (B) Mealy machine can produce outputs one input symbol earlier than the equivalent Moore machine.

Q11BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
Which Unix System call is equivalent to Windows System call CreateFile()?
  1. Afopen()
  2. Bopen()
  3. Cread()
  4. Dwrite()
Show answerHide answer

Correct answer: (B) open()

Q12BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
Which of the following is NOT a valid location for source or result operands in a computer system?
  1. AProcessor register
  2. BControl Unit buffer
  3. CMain or virtual memory
  4. DImmediate value within the instruction
Show answerHide answer

Correct answer: (B) Control Unit buffer

Q13BEL PE Computer Science, 20 Dec 2025 (5:00 PM)
Consider the following C program that creates and traverses a singly linked list. What will be the output? #include <stdio.h> #include <stdlib.h> struct Node { int data; struct Node *next; }; int main() { struct Node *head, *second, *third; head = (struct Node*)malloc(sizeof(struct Node)); second = (struct Node*)malloc(sizeof(struct Node)); third = (struct Node*)malloc(sizeof(struct Node)); head->data = 5; head->next = second; second->data = 10; second->next = third; third->data = 15; third->next = NULL; struct Node *ptr = head; while (ptr != NULL) { printf("%d ", ptr->data); ptr = ptr->next->next; } return 0; }
  1. A5 15
  2. B5 10 15
  3. C5 10
  4. DSegmentation fault (runtime error)
Show answerHide answer

Correct answer: (D) Segmentation fault (runtime error)

Q14BEL PE Computer Science, 17 Dec 2023 (8:30 AM)
Name the phase of the unified process model where customer communication and planning take place.
  1. AInception phase
  2. BConstruction phase
  3. CElaboration phase
  4. DTransition phase
Show answerHide answer

Correct answer: (A) Inception phase

Q15BEL PE Computer Science, 17 Dec 2023 (8:30 AM)
Which of the following is NOT a process state?
  1. AStart
  2. BNew
  3. CRunning
  4. DReady
Show answerHide answer

Correct answer: (A) Start

Q16BEL PE Computer Science, 17 Dec 2023 (8:30 AM)
A process is ________, if it cannot affect or be affected by the other processes executing in the system.
  1. Aindependent
  2. Bself-supporting
  3. Cco-operating
  4. Ddependent
Show answerHide answer

Correct answer: (A) independent

Q17BEL PE Computer Science, 17 Dec 2023 (8:30 AM)
In First-Come-First-Served CPU scheduling algorithm when all the other processes wait for one big process to get off the CPU is known as ________.
  1. AAging
  2. BStarvation
  3. CConvoy effect
  4. DBelady's Anomaly
Show answerHide answer

Correct answer: (C) Convoy effect

Q18BEL PE Computer Science, 17 Dec 2023 (8:30 AM)
The time dispatcher takes for the dispatcher to stop one process and start another running is known as ______.
  1. Adispatch turnaround time
  2. Bdispatch latency
  3. Cdispatch response time
  4. Ddispatch wasting time
Show answerHide answer

Correct answer: (B) dispatch latency

Q19BEL PE Computer Science, 17 Dec 2023 (8:30 AM)
Which of the following is NOT the necessary condition for the deadlock?
  1. ACircular wait
  2. BPreemption
  3. CHold and wait
  4. DMutual exclusion
Show answerHide answer

Correct answer: (B) Preemption

How to use these BEL PE Computer Science questions

Every question here was asked in a real BEL PE paper; the paper and shift are shown on the card, and the number opens the question on its own page. Try each one before tapping Show answer, then attempt the full BEL PE papers as timed tests to check your speed under exam conditions.

More BEL PE subjects