Systems Programming and Discrete Computation Theory
Exam With 100% Verified Answers Version 2026/2027
Question 1
Explain the architectural difference between a monolithic operating system kernel and a microkernel
design regarding failure isolation.
CORRECT ANSWER: A monolithic kernel runs all core services in a single privileged memory space,
meaning a crash in any driver can cause a total system failure. A microkernel keeps only minimal
services in privileged space and runs drivers as isolated user-space processes, localized failures do
not crash the entire operating system.
Question 2
Describe how a standard operating system loader sets up a process memory layout from an
executable file on secondary storage.
CORRECT ANSWER: The loader reads the executable's header metadata to copy machine code into
the text segment, allocates space for global variables, and configures memory addresses for the stack
and heap before jumping the CPU instruction pointer to the application's entry point.
Question 3
Explain how the structural configuration of a copy-on-write (COW) mechanism optimizes the
performance of the Unix fork system call.
CORRECT ANSWER: COW prevents the operating system from instantly duplicating physical memory
blocks during a fork, choosing instead to map the child process to the parent's existing memory
pages until one process attempts to write data, which triggers a page copy.
Question 4
Define the structural utility of a memory-mapped file (mmap) within virtual memory management
frameworks.
CORRECT ANSWER: A memory-mapped file binds a file's byte contents directly to a specific region of
a process's virtual address space, allowing programs to modify file data through direct RAM memory
access pointer operations instead of repetitive read and write system calls.
Question 5
Describe the functional role of an Interrupt Service Routine (ISR) when handling hardware peripheral
events.
CORRECT ANSWER: The ISR acts as an immediate asynchronous callback executing at the hardware
level that forces the CPU to pause its current execution pipeline, save its register states, handle the
high-priority peripheral request, and return back to user space threads.
Question 6
Explain how a translation-lookaside buffer (TLB) shootdown operates in a multi-core processor
environment during memory unmapping events.
CORRECT ANSWER: When a core modifies shared virtual memory mappings, it must send inter-
processor interrupts to all other active cores, forcing them to flush stale address translation caches
from their local TLB units to preserve overall system memory consistency.
, Question 7
Contrast synchronous input/output multiplexing frameworks (such as select or poll) with
asynchronous event notification systems (such as epoll or kqueue) regarding scaling performance.
CORRECT ANSWER: Multiplexing frameworks scan every monitored file descriptor sequentially on
every lookup loop, degrading performance as connections grow. Asynchronous notification systems
use kernel-level callbacks to return only active file descriptors, providing constant time performance.
Question 8
Explain the concept of priority inversion and how the priority inheritance protocol resolves it.
CORRECT ANSWER: Priority inversion occurs when a low-priority thread holds a resource lock
required by a high-priority thread, while a medium-priority thread keeps pre-empting the low-
priority thread. Priority inheritance resolves this by temporarily raising the low-priority thread's
status to match the high-priority thread until it releases the lock.
Question 9
Describe the operational danger of using unbuffered raw disk write operations inside performance-
critical data pipelines.
CORRECT ANSWER: Unbuffered disk writes force the application execution context to stall on every
operation while the physical hardware storage commits data, creating major latency bottlenecks
compared to buffered setups that pool operations in RAM.
Question 10
Define an associative cache memory mapping layout and explain how it differs from direct-mapped
cache configurations.
CORRECT ANSWER: An associative cache allows any memory block to reside in any storage slot
within the cache line array, eliminating conflicts from overlapping addresses, whereas a direct-
mapped cache binds each address block to exactly one specific slot.
Question 11
Explain why a context-free grammar cannot parse arbitrary HTML layouts containing nested tags of
arbitrary depth.
CORRECT ANSWER: HTML layouts often contain cross-cutting dependencies and complex contextual
nesting rules that can require validation beyond the scope of context-free languages, requiring the
processing capabilities of a Turing-complete automaton or context-sensitive grammar.
Question 12
Describe how a shift-reduce parsing algorithm resolves a shift/reduce structural conflict when
traversing a token stream.
CORRECT ANSWER: The parser evaluates its lookahead tokens against predefined operator
precedence and associativity rules to decide whether to push the token onto its internal tracking
stack or collapse the existing stack elements into a completed grammar node.
Question 13
Define a basic block within the context of compiler optimization and control flow graph generation.
CORRECT ANSWER: A basic block is a straight-line sequence of executable code instructions with a
Exam With 100% Verified Answers Version 2026/2027
Question 1
Explain the architectural difference between a monolithic operating system kernel and a microkernel
design regarding failure isolation.
CORRECT ANSWER: A monolithic kernel runs all core services in a single privileged memory space,
meaning a crash in any driver can cause a total system failure. A microkernel keeps only minimal
services in privileged space and runs drivers as isolated user-space processes, localized failures do
not crash the entire operating system.
Question 2
Describe how a standard operating system loader sets up a process memory layout from an
executable file on secondary storage.
CORRECT ANSWER: The loader reads the executable's header metadata to copy machine code into
the text segment, allocates space for global variables, and configures memory addresses for the stack
and heap before jumping the CPU instruction pointer to the application's entry point.
Question 3
Explain how the structural configuration of a copy-on-write (COW) mechanism optimizes the
performance of the Unix fork system call.
CORRECT ANSWER: COW prevents the operating system from instantly duplicating physical memory
blocks during a fork, choosing instead to map the child process to the parent's existing memory
pages until one process attempts to write data, which triggers a page copy.
Question 4
Define the structural utility of a memory-mapped file (mmap) within virtual memory management
frameworks.
CORRECT ANSWER: A memory-mapped file binds a file's byte contents directly to a specific region of
a process's virtual address space, allowing programs to modify file data through direct RAM memory
access pointer operations instead of repetitive read and write system calls.
Question 5
Describe the functional role of an Interrupt Service Routine (ISR) when handling hardware peripheral
events.
CORRECT ANSWER: The ISR acts as an immediate asynchronous callback executing at the hardware
level that forces the CPU to pause its current execution pipeline, save its register states, handle the
high-priority peripheral request, and return back to user space threads.
Question 6
Explain how a translation-lookaside buffer (TLB) shootdown operates in a multi-core processor
environment during memory unmapping events.
CORRECT ANSWER: When a core modifies shared virtual memory mappings, it must send inter-
processor interrupts to all other active cores, forcing them to flush stale address translation caches
from their local TLB units to preserve overall system memory consistency.
, Question 7
Contrast synchronous input/output multiplexing frameworks (such as select or poll) with
asynchronous event notification systems (such as epoll or kqueue) regarding scaling performance.
CORRECT ANSWER: Multiplexing frameworks scan every monitored file descriptor sequentially on
every lookup loop, degrading performance as connections grow. Asynchronous notification systems
use kernel-level callbacks to return only active file descriptors, providing constant time performance.
Question 8
Explain the concept of priority inversion and how the priority inheritance protocol resolves it.
CORRECT ANSWER: Priority inversion occurs when a low-priority thread holds a resource lock
required by a high-priority thread, while a medium-priority thread keeps pre-empting the low-
priority thread. Priority inheritance resolves this by temporarily raising the low-priority thread's
status to match the high-priority thread until it releases the lock.
Question 9
Describe the operational danger of using unbuffered raw disk write operations inside performance-
critical data pipelines.
CORRECT ANSWER: Unbuffered disk writes force the application execution context to stall on every
operation while the physical hardware storage commits data, creating major latency bottlenecks
compared to buffered setups that pool operations in RAM.
Question 10
Define an associative cache memory mapping layout and explain how it differs from direct-mapped
cache configurations.
CORRECT ANSWER: An associative cache allows any memory block to reside in any storage slot
within the cache line array, eliminating conflicts from overlapping addresses, whereas a direct-
mapped cache binds each address block to exactly one specific slot.
Question 11
Explain why a context-free grammar cannot parse arbitrary HTML layouts containing nested tags of
arbitrary depth.
CORRECT ANSWER: HTML layouts often contain cross-cutting dependencies and complex contextual
nesting rules that can require validation beyond the scope of context-free languages, requiring the
processing capabilities of a Turing-complete automaton or context-sensitive grammar.
Question 12
Describe how a shift-reduce parsing algorithm resolves a shift/reduce structural conflict when
traversing a token stream.
CORRECT ANSWER: The parser evaluates its lookahead tokens against predefined operator
precedence and associativity rules to decide whether to push the token onto its internal tracking
stack or collapse the existing stack elements into a completed grammar node.
Question 13
Define a basic block within the context of compiler optimization and control flow graph generation.
CORRECT ANSWER: A basic block is a straight-line sequence of executable code instructions with a
