Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Q. Explain about Associative Memory Organisations?
The associative memory is arranged in w words with b bits per word. In w x b array, every bit is known as a cell. Every cell is made up of a flip-flop which comprises some comparison logic gates for read-write operations and pattern match. So it is possible to write or read concurrently because of this logic structure. A set of bit cells of all the words at the same place in vertical column is termed as bit slice as displayed in Figure below.
Figure: Associative memory
In organisation of an associative memory subsequent registers are used:
• Comparand Register (C): This register is used to hold operands that are being searched for or being compared with.
• Masking Register (M): It might be possible all bit slices are not involved in parallel operations. Masking register is used to disable or enable bit slices.
• Temporary (T) and Indicator (I) Registers: Indicator register is used to hold the current match patterns and temporary registers are used to hold the prior match patterns.
What are the exceptions encountered for FP operation? The exceptions encountered for FP operation are overflow, underflow. /0, inexact and invalid values.
RISC architecture - computer architecture: What is reduced regarding it? The answer of this question is that to make all instructions the equal length the number of bits that
Phase - Thermodynamics: A phase is quantity of matter that is homogeneous throughout in chemical composition and physical structure. If the matter is all gas, all liquid or
Define Algebraic method for Simplification of the Boolean Expressions This method is depend on the by knowledge of the Boolean algebra. Expression can be making simpler by usin
Q. Calculate Register Transfer Time? A clock isn't included explicitly in any statements discussed above. But it is presumed that all transfers take place during clock edge tra
Given a cell, we must determine its neighbouring cells i.e. those with which it shares a wall. The cells with an x are the neighbours of the cell c. Write the function getneighbour
Explain any three parsing techniques. Following are three parsing techniques: Top-down parsing: This parsing can be viewed as an attempt to get left-most derivations of an
Q. What is Base Register Addressing ? An addressing technique in which content of an instruction specifies base register is added to address field or displacement field of the
Cache-Only Memory Access Model (COMA) As we have discussed previous, shared memory multiprocessor systems may use cache memories with each processor for deducting the execution
Example of Unification: Let now here, assume instead that we had these two sentences as: knows(john,X) → hates(john, X) knows(jack, mary) Thus here the predicate n
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd