Explain the programmable rom (prom) - computer memory, Computer Engineering

Assignment Help:

Explain the Programmable ROM (PROM) - Computer Memory?

This is a kind of ROM that can be programmed using special equipment it can be written to, but only once and this is useful for companies that make their own ROMs from software they write, since when they change their code they can create new PROMs without requiring expensive equipment. This is alike to the way a CD-ROM recorder works by letting you "burn" programs onto blanks once and then letting you read from them many times. Indeed, programming a PROM is as well called burning, identical to burning a CD-R, and it is comparable in terms of its flexibility.


Related Discussions:- Explain the programmable rom (prom) - computer memory

Explain cause effect graphing, Explain cause effect graphing . Cause-ef...

Explain cause effect graphing . Cause-effect graphing is a test case design method that gives a concise representation of logical conditions and corresponding actions.  The

What is a match code, What is a Match Code? Match code is a tool to hel...

What is a Match Code? Match code is a tool to help us to find for data records in the system. Match Codes are an proficient and user-friendly search aid where key of a record i

Explain isdn addressing with a example, Explain ISDN Addressing with a exam...

Explain ISDN Addressing with a example. A sub address, though a part of the ISDN address, is not seems as an integral part of the numbering scheme. Sub-address is carried in a

Layered architecture of edi, Layered Architecture of EDI: EDI is most c...

Layered Architecture of EDI: EDI is most commonly applied in the implementation and settlement phases of the trade cycle. In implementation of a simple trade exchange, the cust

What is the size limitation of an access database, Size limitation does not...

Size limitation does not relate to number of records in a table within a database. Forms, reports, macros, and modules also add to database size, but is rather minimal compared to

Bernstein conditions for detection of parallelism, Bernstein Conditions for...

Bernstein Conditions for Detection of Parallelism For implementation of instructions or block of instructions in parallel, it should be guaranteed that the instructions are ind

Prove using boolean algebra, Q.Prove using Boolean Algebra 1. X (X+Y) = ...

Q.Prove using Boolean Algebra 1. X (X+Y) = X 2. AB + AC + BC' = AC + BC' 3. (A+B+C) (A+B'+C') (A+B+C') (A+B'+C)=A 4. (A+B'+C) (AB+A'C) = (A+C) (A'+B) 5. XY + XZ + YZ

Accessing a cache - computer architecture, Accessing a Cache:  Direct ...

Accessing a Cache:  Direct mapping: (Block address) modulo (Number of cache block in the cache) The valid bit indicate whether an entry contain a valid address.

Show the decimal equivalent of a binary number, Q. Show the Decimal equival...

Q. Show the Decimal equivalent of a binary number? In binary numbers we have two digits 0 and 1 in addition they can also be signified as a string of these two-digits known as

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