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. What do you mean by Decoders?
Decoder transforms one kind of coded information to other form. A decoder has n inputs and one enable line (sort of selection line) and 2n output lines. Let's see an example of 3:8 decoder that decodes a 3 bit information and there is just one output line that gets value 1 or in other words out of 23 = 8 lines just 1 output line is selected. So depending on selected output line information of 3 bits can be identified or decoded.
Figure: 3×8 decoder
Please be certain while constructing logic figure wherever values in the truth table are appearing as zero in input and one in output the input must be fed in complemented form for example first 4 entries of truth table comprises 0 in I0 position and therefore I0 value 0 is passed by a NOT gate and fed to AND gates 'a', 'b', 'c' and'd' that implies that these gates shall be triggered/selected only if I0 is 0. If I0 value is 1 then not any of the top 4 AND gates can be selected. Similar kind of logic is valid for I1. Please note output line selected is named 000 or 010 or 111 etc. Output value of only one of lines would be 1. These 000, 010 denotes the label and imply that if you have these I0 I1 I2 input values labelled line would be activated for the output. Enable line is a good resource for joining two 3×8 decoders to make one 4×16 decoder.
Explain Resource request and allocation graph (RRAG) Deadlocks can be explained by a directed bipartite graph known as a Resource-Request-Allocation graph (RRAG).A graph G = (V
What is the necessity of Interfacing in digital ICs and what are the points to be kept in view, while interfacing between TTL gate and CMOS gate? Ans: To realize the optimum
If the throughput scales upward as time progresses and the number of Vusers enhance, this showing that the bandwidth is sufficient. If the graph were to remain relatively flat as t
Define Compilers with High Level Programming Language? All high-level programming language (except strictly interpretive languages) comes with a compiler. Effectively the compi
Determine the synchronization of bits The synchronization provided by use of start and stop bits, an extra bit known as a parity bit may optionally be transmitted along with th
What is pipelining? What are the various hazards encountered in pipelining? Explain in detail. The major characteristics of a pipeline are: a) Pipelining cannot be exe
Explain Bottom-up Parsing Techniques A parser can begin with the input and attempt to rewrite it to the start symbol. Instinctively, the parser attempts to locate the most bas
What is store program control (SPC)? In stored program control systems, a set of instructions or program to the computer is stored in its memory and instru
Q. Explain about Programmer Visible Registers? Programmer Visible Registers: These registers can be employed by machine or assembly language programmers to minimize reference
Classification Of Parallel Computers Introduction Parallel computers are those that underline the parallel processing among the operations in some way. In the last unit,
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