--%>

Describe about buses

Describe about buses?

E

Expert

Verified

There are three types of buses:

Address bus: This is employed to carry the Address to the memory to fetch either Instruction or Data.

Data bus : This is employed to carry the Data from the memory.

Control bus : This is employed to carry the Control signals such as RD/WR, Select etc.

   Related Questions in Science

  • Q : Define thread Normal 0 false false

    Normal 0 false false

  • Q : What is Strong Preservation Strong

    Strong Preservation: An abstraction is strongly preserving when a set of properties with truth values of either true or false in the abstract system consists corresponding properties in the concrete system with the same truth values. Strong preservati

  • Q : V-V method that overcome Black-Box

    V-V method that overcome Black-Box tesing problem:1. Model checking can produce minimal sets of test cases that guarantee certain coverage criteria for example by using symbolic execution modes of the model checker (mitigates conditions a

  • Q : Describe nis server Normal 0 false

    Normal 0 false false

  • Q : Difference between nfs soft and hard

    Normal 0 false false

  • Q : Type of Page replacement algorithms

    Distinguished different type of Page replacement algorithms?

    Q : Mass Transport in Environmental

    The table below gives water velocity as a function of distance from the ocean-sediment interface.  Assume effects from surface winds are negligible and address the questions given below about the transfer of a chemical (A) from the sediment into water column.&nbs

  • Q : Case study of a Dust Bowl-Climatic

    During the 1930's, there were several climatic occurrences in the American Great Plains known collectively as the Dust Bowl. During this period of 5 to 7 years, severe dust storms and drought caused agricultural and ecological damage in the Plains.

  • Q : Inventor of Mouse Normal 0 false false

    Normal 0 false false

  • Q : Define A-star search A* Search: A*

    A* Search: A* (pronounced “A star”) is a best-first search that attempts to minimize the total length of the path from the initial state to the goal state. It combines advantages of breadth-first search, where the shortest path is found fi