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 Operand Address Calculation?
In actual machines effective address can be a register address, memory or I/O port address. Register reference instructions for example complement R1, clear R2 etc.usually don't need any memory reference (presuming register indirect addressing isnot being used) and can directly go to execute cycle. However memory reference instruction can use various addressing modes. Relying on type of addressing effective address (EA) of operands in memory is calculated. Calculation of effective address may require more memory fetches (for example in case of indirect addressing) so in this step we may calculate effective address as below:
So the address part of IR now comprises the effective address which is direct address of operand.
Explain the working of a 2-bit digital comparator with the help of Truth Table. Ans. Digital comparator is a combinational circuit which compares two numbers, A and B; and
Define system space. Management routines are part of the operating system of the computer. It is suitable to assemble the OS routines into a virtual address space.
Performance of computer system: Computer performance is frequently described in terms of clock speed (usually in MHz or GHz). It refers to the cycles per second of the main cl
How does a hybrid in telephone networks work ? The circuit operation is as follows: The input signal is coupled to the B and F windings similarly. By the C winding, the i
Fail-first - artificial intelligence: Alternatively one such dynamic ordering procedure is known like "fail-first forward checking". In fact the idea is to take advantage of i
Random Search - artificial intelligence: Some problems to be solved by a search agent are more creative in nature, for example, like in writing poetry. In this case, it is oft
Explain the Features of Major scheduling algorithms. The Features of Major scheduling algorithms is given below: FCFS - i.e. First come first served scheduli
(i) A multiplexer combines four 100-Kbps channels using a time slot of 4 bits. Each Frame has the size of 16 bits. a) Show the output with the four inputs as shown in the figu
Concept of Multithreading: This problem rises in design of large scale multiprocessors like MPP. So a solution for optimizing this latency must be acquired at. The idea of Mul
Explain overlay structured program ? A program having overlays is termed as overlay structured program, here an overlay is a part of program that has similar load origin as som
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