Explanation

• The EDX register consists of 4 bytes (32 bits).
• Full Size: 4 bytes / 32 bits (EDX)
• Lower Half: 2 bytes / 16 bits (DX)
• Byte Halves: 1 byte / 8 bits each (DH for high byte, DL for low byte of DX)

Explanation

• Shortest Job First (SJF) may suffer from starvation.
• It always executes the process with the shortest CPU burst time first.
• If short processes keep arriving, longer processes may never get CPU time.
• SJF provides the minimum average waiting time among scheduling algorithms.
• Aging is a common technique used to reduce starvation.

Additional information:

• FCFS: Executes processes in arrival order
• Round Robin (RR): Uses a fixed time quantum
• Priority Scheduling: May also suffer from starvation

Last verified on 02-08-2026

Explanation

• Atomicity ensures that a transaction is executed completely or not at all.
• If any part of a transaction fails, the entire transaction is rolled back.
• This prevents partial updates and maintains database reliability.
• Atomicity is one of the four ACID properties of database transactions.
• It ensures the all-or-nothing execution principle.

Last verified on 02-08-2026

Explanation

• L1 Cache is the fastest cache memory.
• It is typically exclusive to each CPU core.
• It stores the most frequently used instructions and data.
• Being closest to the CPU core, it has the lowest latency.

Additional information:

• L2 Cache is larger but slower than L1.
• It is usually dedicated to each core in many processors.
• L3 Cache is the largest cache.
• It is commonly shared among all CPU cores.

Explanation

• A firewall is used for security by protecting a computer or network from unauthorized access and cyber threats.
• It monitors and filters incoming and outgoing network traffic.
• Firewalls block malicious connections while allowing trusted communication.
• They help prevent hacking, malware, and unauthorized access.
• Firewalls can be hardware-based or software-based.

Last verified on 02-08-2026