Read only memory (rom), Basic Computer Science

Assignment Help:

Read only memory (rom):

The problem with RAM is that its memory is volatile, i.e. it loses all its data when the power supply is removed.  A non-volatile memory is a permanent memory that never forgets its data.  One type of non-volatile memory is the Read Only Memory (ROM).  A ROM has a pattern of 0s and 1s imprinted in its memory by the manufacturer.  It is not possible to write new data into a ROM, which is why it is called a Read-Only Memory.

The organisation of data in a ROM is similar to that of a RAM.  Thus a 256-bit ROM might be organised as a 256 X 4-bit memory, and so on.  The ROM may be regarded as the "Reference Library" of a computer.

 


Related Discussions:- Read only memory (rom)

Definition of User-Level Thread?, User-level threads apply in user-level li...

User-level threads apply in user-level libraries, before via systems calls, so thread switching does not require to call operating system and to cause interrupt to the kernel. Actu

Computer network.., what is the difference between internet and world wide ...

what is the difference between internet and world wide web?

Dataflow modeling for dsp design, Dataflow Modeling for DSP Design The ...

Dataflow Modeling for DSP Design The necessary components in the research of application-specific computer architectures are: 1) a clearly identified set of problems that can b

Counters and registers, design a synchronous, recycling, MOD-12 counter wit...

design a synchronous, recycling, MOD-12 counter with D FF''s. Use the states 0000 through 1011 in the counter.

Digital transmission, Digital Transmission: In digital transmission, w...

Digital Transmission: In digital transmission, wave patterns are translated into discrete bits and are separated by intervals. Bits (contraction for binary digits) are the sma

A* search-artificial intelligence, A* Search-Artificial intelligence:  ...

A* Search-Artificial intelligence:   A* search combines the best parts of uniform cost search that  called the fact that it's optimal and complete, and the best parts of gre

Describe the binary search algorithm, QUESTION 1 Describe the binary se...

QUESTION 1 Describe the binary search algorithm using an example of your own. QUESTION 2 (a) By showing all your workings, give a big-O estimate for f(x) = (x + 1)lo

Star topology, Ask conceptual question answer about star topology#Minimum 1...

Ask conceptual question answer about star topology#Minimum 100 words accepted#

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd