Memories are made up of registers. Each register in the memory is one storage location. Storage location is also called as memory location. Memory locations are identified using Address. The total number of bit a memory can store is its capacity.
A storage element is called a Cell. Each register is made up of storage element in which one bit of data is stored. The data in a memory are stored and retrieved by the process called writing and reading respectively.
A word is a group of bits where a memory unit stores binary information. A word with group of 8 bits is called a byte.
A memory unit consists of data lines, address selection lines, and control lines that specify the direction of transfer. The block diagram of a memory unit is shown below:
Data lines provide the information to be stored in memory. The control inputs specify the direction transfer. The k-address lines specify the word chosen.
When there are k address lines, 2k memory word can be accessed.
Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.
- Difference between Volatile Memory and Non-Volatile Memory
- Random Access Memory (RAM) and Read Only Memory (ROM)
- Difference between Byte Addressable Memory and Word Addressable Memory
- Difference between Random Access Memory (RAM) and Content Addressable Memory (CAM)
- Difference between Virtual memory and Cache memory
- Difference between Uniform Memory Access (UMA) and Non-uniform Memory Access (NUMA)
- Introduction of Secondary Memory
- Introduction of Compact Disk (CD) optical memory
- Peterson's Algorithm for Mutual Exclusion | Set 2 (CPU Cycles and Memory Fence)
- Classification and Programming of Read-Only Memory (ROM)
- MCQ on Memory allocation and compilation process
- Allocating kernel memory (buddy system and slab system)
- Memory mapped I/O and Isolated I/O
- 2D and 2.5D Memory organization
- Read and Write operations in Memory
- Difference between Memory based and Register based Addressing Modes
- Locality of Reference and Cache Operation in Cache Memory
- Subroutine, Subroutine nesting and Stack memory
- Memory Hierarchy Design and its Characteristics
- Difference between Simultaneous and Hierarchical Access Memory Organisations
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.