Storage Systems in Computers

How does a computer store information? What tools does a computer use to retain information? These are very important questions, as all that has discussed in my various blogs thus far is how to get a computer to manipulate ones and zeros to make decisions.

There are two kinds of logical structures: those that store information and those that do not store information. Thus far, I have written about logical structures that just manipulate information in order to produce a new value; now, I will introduce a logical structure that will store the information: an R-S Latch.

R-S Latch:

The R-S Latch is a simple structure that can store one bit of information. The R-S Latch can be implemented in numerous ways, the most common of which are by combining NOR gates or by combining NAND gates. Before I show how an R-S Latch is constructed, I wanted to clarify the four primary functions of an R-S Latch, as well as a fifth illegal function that may or may not exist.

The Set Function:

An R-S Latch has a set function, which will produce either a 0 or a 1, modifying whatever previous value was stored in the R-S Latch.

The Set-Hold Function:

An R-S Latch has a set-hold function, which will store whatever value was previously produced via the R-S Latch’s mechanics. This is from where we get a storage aspect in the R-S Latch.

The Reset Function: