PrepMart

Operating System

Explanation

Thrashing happens when the working set of a process is not currently in memory, causing continuous page faults and disk I/O. This severely degrades system performance because the CPU spends its time swapping pages in and out rather than executing instructions.

Report an error

Describe the issue with this question. Our team will review it.

Question ID: 11312

Question 3 of 13

What is the binary equivalent of the decimal fraction 0.625?

Explanation

Multiply the fraction by 2 iteratively and collect the integer parts from top to bottom:

0.625 * 2 = 1.25 (integer part 1)

0.25 * 2 = 0.50 (integer part 0)

0.50 * 2 = 1.00 (integer part 1)

Reading the integers from top to bottom gives 0.101.

Report an error

Describe the issue with this question. Our team will review it.

Question ID: 11311

Question 4 of 13

Which memory management scheme strictly suffers from external fragmentation rather than internal fragmentation

Memory Management

Explanation

Segmentation divides memory into variable-sized chunks based on the logical divisions of a program. Over time, as segments are loaded and removed, it leaves small, unusable holes of memory scattered around, causing external fragmentation. Paging, on the other hand, uses fixed-size blocks and suffers from internal fragmentation.

Report an error

Describe the issue with this question. Our team will review it.

Question ID: 11310

Question 5 of 13

Match the deadlock-related concepts in List I with their most accurate descriptions in List II.
List I (Concept)
A. Deadlock Prevention
B. Deadlock Avoidance
C. Deadlock Detection
D. Circular Wait
List II (Description)
1.A necessary condition for deadlock where a closed chain of processes exists, each holding at least one resource needed by the next process in the chain.
2.A strict, proactive strategy designed to ensure that at least one of the four necessary conditions for a deadlock can never hold.
3.A strategy (utilizing tools like Banker's Algorithm) that dynamically assesses each resource request to ensure the system always remains in a "safe state."
4.A permissive strategy that allows the system to enter a deadlocked state, identifies it using tools like a wait-for graph, and then initiates recovery.
Select the correct matching code from the options below:

Explanation

Deadlock Prevention (A) pairs with (2) because it strictly constraints how requests can be made to invalidate conditions like "Hold and Wait" or "Circular Wait" from the very beginning.

Deadlock Avoidance (B) pairs with (3) because it requires the OS to look at future resource needs and dynamically calculate if granting a request keeps the system in a safe state.

Deadlock Detection (C) pairs with (4) because it does not stop deadlocks from happening; instead, it periodically runs an algorithm to find cycles and then kills processes or preempts resources to recover.

Circular Wait (D) pairs with (1) as it is the exact definition of the 4th necessary Coffman condition for a deadlock to occur.

Report an error

Describe the issue with this question. Our team will review it.

Question ID: 11309

Question 6 of 13

Consider the following statements regarding the Coffman Conditions for deadlock:
1.The four necessary and simultaneous conditions for a deadlock to occur are: Mutual Exclusion, Hold and Wait, No Preemption, and Circular Wait.
2.The "Deadlock Prevention" strategy works by ensuring that the operating system structurally invalidates at least one of these four conditions.
3.The "No Preemption" condition states that the operating system has the absolute authority to forcibly seize resources from a running process if another high-priority process requires them.
Which of the statements given above is/are correct?

Deadlock

Explanation

Statements 1 and 2 are correct. Statement 3 is the exact opposite of the condition. "No Preemption" means that a resource cannot be forcibly taken away by the OS; it can only be released voluntarily by the process holding it after that process has completed its task.

Report an error

Describe the issue with this question. Our team will review it.

Question ID: 11308

Question 7 of 13

Match the memory management concepts in List I with their most accurate descriptions in List II.
List I (Concept)
A. Paging
B. Segmentation
C. Compaction
D. Thrashing
List II (Description)
1.Memory is divided into variable-sized units that align closely with the programmer's logical view of the program.
2.A severe performance degradation state where the system spends more time swapping pages than executing processes.
3.Divides the logical address space into fixed-size blocks to completely eliminate external fragmentation.
4.A dynamic memory allocation technique used to overcome external fragmentation by shuffling memory contents together.
Select the correct matching code from the options below:

Memory Management

Explanation

Paging (A) pairs with (3) because its defining characteristic is breaking logical memory into fixed-size blocks (pages) to fit into physical frames, removing the need for contiguous allocation.

Segmentation (B) pairs with (1) because it divides memory based on the logical structure of the program (like functions and arrays), which results in variable-sized blocks.

Compaction (C) pairs with (4) as it is the process of physically moving active processes in memory to consolidate all free space into one large, usable block.

Thrashing (D) pairs with (2) as it defines the scenario where high page fault rates cause the OS to constantly read/write to the disk, halting actual CPU progress.

Report an error

Describe the issue with this question. Our team will review it.

Question ID: 11307

Question 8 of 13

If an arithmetic equation 41 - 22 = 15 is mathematically correct, what is the base (radix) of the number system being used?

Explanation

Set up the equation using positional notation with an unknown base b: (4b + 1) - (2b + 2) = (1b + 5). Simplifying this gives 2b - 1 = b + 5, which solves mathematically to b = 6.

Report an error

Describe the issue with this question. Our team will review it.

Question ID: 11306

Question 9 of 13

Consider the following statements regarding how overflow manifests and is detected in binary arithmetic:
1.In signed binary representations, an overflow condition often manifests as a "sign reversal" error, where adding two large positive numbers inadvertently alters the Most Significant Bit (MSB), producing a negative result.
2.At the hardware circuit level for 2's complement addition, an overflow is detected when the carry generated into the sign bit is different from the carry generated out of the sign bit.
3.In a 2's complement system, generating a "carry out" from the Most Significant Bit (MSB) automatically means an overflow error has ruined the calculation.
Which of the statements given above is/are correct?

Explanation

Statements 1 and 2 are correct descriptions of how overflow acts and is detected by hardware (via an XOR gate on the carries). Statement 3 is incorrect. In 2's complement math, a carry out of the MSB is perfectly normal and is usually just discarded. For example, adding -1 (1111 1111) and -1 (1111 1111) yields 1 1111 1110. The carry out is discarded, leaving 1111 1110 (-2), which is a valid, correct result with no overflow.

Report an error

Describe the issue with this question. Our team will review it.

Question ID: 11305

Question 10 of 13

Consider the following statements regarding the fundamental definition and conditions of arithmetic overflow:
1.Arithmetic overflow occurs when the result of a mathematical operation produces a value that exceeds the maximum or falls below the minimum representable limit of the allocated storage format (e.g., an 8-bit register).
2.In a 2's complement signed number system, an overflow can only potentially happen when adding two numbers that have the exact same sign (both positive or both negative).
3.If an arithmetic logic unit (ALU) adds a positive binary number to a negative binary number, a computational overflow is highly likely to occur.
Which of the statements given above is/are correct?