Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
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
q convert the following into sop form 1 ab bc a c2 ac abac acb3 ab cb qconvert the following into pos form 1 wyz xyz wxy wxyz2 xy xz
q reduce following to minimum literals and derive their complements 1 abaabb2 abcabc abc abc3 acd acd
q what is the draw back of access-3 code give suggestion to over come this
q what do you mean by true complement method explain in detailq show ieee format for 127510q what are the various ways to represent negative numbers
q consider the three bcd numbers listed below0001 1000 0101 10000010 0001 0011 10000100 0011 0101 0101a convert these numbers to their decimal
q do the following operations with 8 bit bytes and indicate the condition of the overflow and carry bitsa 10111011 00000011 b 11101101 11111001c
q do as directeda hexadecimal addition 101 abcb 4325 10-8975 10 using 1s complementc octal subtraction 123-777d 1236 4356 6e abc - 123 using
q convert the following from octal to binary decimal hexadecimal and bcd a 77 b 4037 c
q convert the following from hexadecimal to binary decimal bcd and octala 111 b abc25 c 2cq convert the following from bcd to binary decimal
q determine the odd parity bit for fq convert the following from binary to decimal hexadecimal bcd and octala 1000000011 b 0001010110101