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. Implementation of BUS
Construction of a bus system for four registers employing 4×1 multiplexers is displayed below. Every register has four bits which are numbered 0 through 3. Every multiplexer has 4 data inputs, numbered 0 through 3 and two control or selection lines which are C0 and C1. The data inputs of 0th MUX are associated to the respective 0th input of each register to form four lines of the bus. The 0th multiplexer multiplexes the four 0th bits of the registers and in the same way for the three other multiplexers.
Because the same selection lines C0 and C1 are connected to all multiplexers so they choose the four bits of one register and transfer them in four-line common bus.
Figure: Implementation of BUS
When C1C0 = 00 the 0th data input of all multiplexers are selected and this causes bus lines to receive content of register A because the outputs of register A are associated to the 0th data inputs of the multiplexers which is then applied to output which forms the bus. In the same way when C1C0 = 01, register B is selected and so on. The subsequent table displays the register which is selected for every of the four possible values of selection lines:
Figure: Bus Line Selection
To create a bus for 8 registers of 16 bits each you would need 16 multiplexers one for every line in the bus. Number of multiplexers required to construct the bus is equal to number of bits in every register. Every multiplexer should have eight data input lines as well as three selection lines (23 = 8) to multiplex one bit in eight registers.
What is an expression tree? How an expression is evaluated using an expression tree? Algebraic expressions is as given here a/b+(c-d)e That has an inherent tree-like structure
What is Hamiltonian path? A Hamiltonian path in a directed graph G is a directed path that goes by each node exactly once. We consider a special case of this difficulty where
Register-to-Register Architecture In this organization results and operands are not accessed straight from main memory by scalar or vector registers. The vectors that are neede
How many two input AND gates and two input OR gates are required to realize Y = BD+CE+AB ? Ans. Here three product terms, therefore three AND gates of two inputs are needed.
Calculate the maximum access time that can be permitted for the data and control memories in a TSI switch with a single input and single output trunk multiplexing 2500 channels. Al
Q. Show Independent loops in fortran program? In the subsequent code portion the directives point to the outer two loops are independent. The inner loop allocates elements of A
In a report with an LDB attribute, you do not have to explain how the information should be retrieved from the database tables, but only how the data should be shown on the screen.
Define the terms- Action Semantics and ArgoUML Action Semantics : Action semantics is a group of firms that have responded to the OMG's RFP to define the action semantics fo
Define secondary memory. This memory holds those pages that are not present in main memory. The secondary memory is usually a high speed disk. It is known as the swap evice, an
what are the different types of tablets?
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