Step 1: Turnaround time.
Turnaround time is defined as the total time taken from process submission to completion. It includes waiting time, execution time, and any I/O delays. Hence, statement (A) is correct.
Step 2: Scheduling goals.
The goals of CPU scheduling include maximizing CPU utilization and throughput, while minimizing waiting time, turnaround time, and response time. Statement (B) is incorrect.
Step 3: Round-robin scheduling.
Round-robin scheduling does not require prior knowledge of CPU burst times, as each process is given a fixed time quantum. Therefore, statement (C) is correct.
Step 4: Preemptive scheduling.
Preemptive scheduling requires hardware support such as timer interrupts to regain control of the CPU. Hence, statement (D) is correct.
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
Consider the following C code segment:
int x = 126, y = 105;
do {
if (x > y)
x = x - y;
else
y = y - x;
} while (x != y);
printf("%d", x);
The output of the given C code segment is ____________. (Answer in integer)
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________ (answer in integer).
Consider the following C program
The value printed by the given C program is __________ (Answer in integer).