Programmable rom (prom) , Basic Computer Science

Assignment Help:

PROGRAMMABLE ROM (PROM):

The user can program a PROM after purchase.  Each memory bit element in the PROM contains a nichrome or silicon link that acts as a fuse.  The user can selectively 'but out' or 'blow' these fuses by applying pulses of current to the appropriate pins of the IC.  A memory element with a non-ruptured fuse stores a 1 and a ruptured fuse stores a 0.  The programming is irreversible, so it must be right first time.  Figure 11 shows the circuit for a PROM.

596_prom.png

PROM Circuit

PROMs are capable of high operating speeds, but consume a relatively large amount of power.  However, since they are non-volatile, they can be switched off when not being accessed. 

 


Related Discussions:- Programmable rom (prom)

Algorithmic, define it #Minimum 100 words accepted#

define it #Minimum 100 words accepted#

Magnetic memory, Magnetic Memory:  In the above section we have seen v...

Magnetic Memory:  In the above section we have seen various types of semiconductor RAMs. These high speed semiconductor storage devices (i.e. RAMs) are expensive. So we need s

Explanation of components of excel work book, Problem 1 Briefly explain...

Problem 1 Briefly explain Components of Excel Work book Explanation of Components of Excel Work book Problem 2 How do you insert a watermark in the Word docume

CAI, WHAT IS CAI ITS PITFALLS

WHAT IS CAI ITS PITFALLS

Software engineering, how will a poorly conducted feasibility study affect ...

how will a poorly conducted feasibility study affect an implemented system

Explain master slave j-k flip flop, Question 1 Convert the following binar...

Question 1 Convert the following binary numbers to its specified number system 1101.11 (2) to octal 1111 (2) to decimal 110.11 (2) to hexadecimal 1011.11 (2) to

Define Multilevel Queue Scheduling?, • A multilevel queue scheduling algori...

• A multilevel queue scheduling algorithm divides the ready queue in several separate queues, for example • In a multilevel queue scheduling processes are lastingly assigned to one

Boolean expression, Problem 1. Obtain the truth table and a Boolean exp...

Problem 1. Obtain the truth table and a Boolean expression for the following conditions: x is 0 if any two of the three variables are 1. x is 1 for all other conditions.

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