Rewrite Discussion: Memory


Question 1 – Explain what a ROM is and how it works.

 

ROM stands for Read-Only Memory. As the name implies, it’s a type of memory that can only be read from, not written to. It’s non-volatile, meaning it retains its contents even when the power is turned off. ROM is typically used to store firmware or software that boots up the system and performs diagnostics. This software, known as the BIOS (Basic Input/Output System) in a PC, is stored in the ROM and is the first software that runs when you turn on your computer.

 

ROM works by storing data in a permanent state. In its traditional form, ROM was literally “read-only” in that it was programmed with the desired data at the time of manufacture, and the data couldn’t be changed afterward. But advancements in technology have resulted in forms of ROM like PROM (Programmable Read-Only Memory), EPROM (Erasable Programmable Read-Only Memory), and EEPROM (Electrically Erasable Programmable Read-Only Memory) that can be programmed (and sometimes even re-programmed) after manufacture. Even then, changing the data is a much more complex process than with RAM (Random Access Memory), and often involves special equipment or procedures.

 

Question 2 – Discuss special types of memories such as FIFO and LIFO.

 

FIFO and LIFO aren’t actually types of memory themselves, but rather they are algorithms or methods for managing and organizing data in memory.

 

FIFO stands for First-In, First-Out. It’s a method for organizing and manipulating a data buffer, where the oldest (first) entry, or the entry that has been in the system the longest (first in), is the first one to be retrieved (first out). FIFO is used extensively in computing systems for things like print spooling, disk scheduling, and many other areas where you want to manage tasks or data in the order they came in.

 

LIFO, on the other hand, stands for Last-In, First-Out. It’s also a method for organizing and manipulating a data buffer, but in this case, the newest (last) entry, or the entry that has been in the system the shortest time (last in), is the first one to be retrieved (first out). The most typical example of a LIFO system is the stack in computer memory, which is a region of memory that stores temporary data. When a function is called, its variables are pushed onto the stack (last in) and then popped off when the function is done (first out).