Bissoy.com
Doctors Medicines MCQs Q&A

Which memory is nonvolatile and may be written only once?

Which memory is nonvolatile and may be written only once? Correct Answer PROM

PROM memory is non-volatile and may be written only once. A programmable read-only memory (PROM) or field programmable read-only memory (FPROM) or one-time programmable non-volatile memory (OTP NVM) is a form of digital memory where the setting of each bit is locked by a fuse or antifuse.

Related Questions

With regard to computer memory, which of the following statement(s) is/are TRUE?  (A) Cache memory is 'volatile' memory. (B) Magnetic memory is 'volatile' memory.  (C) Flash memory is 'volatile' memory. (D) RAM is 'volatile' memory. Choose the correct answer from the option given below:
In a certain code language, O is written as R, R is written as A, A is written as I, I is written as N, N is written as E, E is written as P, P is written as T, C is written as M and L is written as L. How will PORCELAIN be written as in that language?
In a certain code language, W is written as B, K is written as H, L is written as U, N is written as A, O is written as M, E is written as R, D is written as G, G is written as E, then how will KNOWLEDGE be written in that code?
Which of the following is/are wrong? a) RAM and ROM are volatile memories b) ROMs, PROMs and EPROMs are nonvolatile memories c) RAM and Dynamic RAM are same d) A random-access memory (RAM) is a read write memory
In a certain code language, U is written as C, K is written as H, L is written as U, N is written as E, S is written as L, E is written as K, and C is written as N. How will ‘KNUCKLES’ be written in that language?
If in a certain code, G is written as E, L is written as B, V is written as L, E is written as T, A is written as V, T is written as A and B is written as G, then how will VEGETABLE be written in that code?
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each of the processes Y and Z reads x from memory, decrements by two, stores it to memory, and then terminates. Each process before reading x invokes the P operation (i.e., wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the semaphore S after storing x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory page is available in memory, and D units if the memory access causes a page fault. It has been experimental measured that the average time taken for a memory access in the process is X units. Which one of the following is the correct expression for the page fault rate experienced by the process?
Assume a memory access to main memory on a cache "miss" takes 30 ns and a memory access to the cache (on a cache "hit") takes 3 ns. If 80% of the processor's memory requests results in a cache "hit", what is the average memory access time?
If D is written as O, O is written T, N is written as F, G is written as A, U is written as B and R is written as C, then how is the Word GROUND written?