Read only memory (rom), Basic Computer Science

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.

 

Posted Date: 9/13/2012 7:02:06 AM | Location : United States







Related Discussions:- Read only memory (rom), Assignment Help, Ask Question on Read only memory (rom), Get Answer, Expert's Help, Read only memory (rom) Discussions

Write discussion on Read only memory (rom)
Your posts are moderated
Related Questions
how to get tamil information in internet

G e ne ric Techniques Developed: In  the  pursuit  of  solutions  to  many   problems  in  the  above  categories,  serval specific  techniques have sprung up which have bee

Define explicit, implicit and parametric representation and what are their advantages?


Analogue to digital converter: In an ADC a range of input values must correspond to a unique digital word.  The type of code used depends on the system but here only binary cod

Input Devices: i)  Keyboard is the most common form of input devices. It was originally designed in the last century. Since then, only minor improvements have taken place in k

Hello i am a computer science student. now we are going to start our final project. we want to work on Google App Inventor and we want to create mobile application. we are two grou

Hello - What is the turn around time for a 6 page website.

QUESTION (a) Consider a system with input x[n] and output y[n] that satisfy the difference equation:                                   Y[n] = x[n] + 0.5 x[n-2] + 0.2 x[n+1]

QUESTION (a) Give the representation of a queue as an abstract data type. (b) What is a priority queue? Give two types of priority queues. (c) The following program does