Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
q what is interrupt how it is useful in controlling io operations q explain function of color graphics adopter card and diskette drive adopter
q state the difference between followingi ram and romii sram and dramiii dynamic and static mos
q explain random-access semiconductor memoriesq what is basic memory cell explain two dimension memory organization with
q determine the complete or gate and and gate decoder count for an ic memory with 4096 words of 1 bit each using the linear select memory
q perform division in binary showing contents of accumulator b register and y register during each step accumulator b y are 5-bit registers 13
perform multiplication with showing the contents of accumulator b register and y register during each step accumulator b y are 4-bit registers b06
q explain shift register with diagram and waveform q write a short note on
q what is multiplexer explain 4 x 1 multiplexer q explain the working of a binary half-adder construct a full-adder from half- adder also
q differentiate the multiplexer and demultiplexer with respect to their concept block diagram and circuitq what is the difference between synchronous
q design the counter using sequential logic with following counting sequence using rs- flip-flops000 100 101 111 010
q design a 3-bit counter using sequential logic with following counting sequence using jk- flip-flops which counts the sequence 0 3 2 7 5 and
q explain 4 bit ripple counter with necessary diagram q explain jk master-slave flip-flop with block diagram and logic design q explain jk
q give the difference between register and counter q give the difference between flip-flop and latch q draw a set of waveforms for following
q use as few gates as possible design a nand-to-and gate network that realize the following boolean algebra expressionabcd abcd abcd abcd abcd
consider the following expression assume that complement inputs are available fabcd summ 013591214 sumd 410151 find minimal expression for sop draw
design an or to and gates combinational network and nand only nw for the following boolean expressionabcd abcd abcd
qprove using boolean algebra1 x xy x2 ab ac bc ac bc3 abc abc abc abca4 abc abac ac ab5 xy xz yz xz
find the minimum sop and pos expression for the following functions using karnaugh map and realize the expression using appropriate gates also
q fabcd a b da c da b cdabcd a b c da c da b dfind the simplified function f and implement it using nor gates
q find simplified function f and implement that function using only nand gates1 fabc ab abc abc2 f abc abcbcdabcdabc3 fxyz xyz xy xyz xyz4
q explain xnor gate with three input variable and draw necessary circuits q simplify following using k-map1 m0 m1 m6 m7 m12 m13 m8 m92 m0 m2
q what is gate explain basic gates with truth table and necessary circuits q which gates are called universal gates why q give the dual of the
q fxyz summ 4678 sumd 251112 using k-map q state and prove any one of the demorgens laws show that these theorems can be extended up to any
q for function fxyz summ 12356 using truth table only 1 find pos expression2 implement this simplified expression using two level or-to-and gate
q for function fxyz summ01267 using truth table only 1 find sop expression2 implement this simplified expression using two level and-to-or gate