Digital Electronics Set 6
On This Page
This set of Digital Electronics Multiple Choice Questions & Answers (MCQs) focuses on Digital Electronics Set 6
Q1 | Each product term of a group, w’.x.y’ and w.y, represents the in that group.
- input
- pos
- sum-of-minterms
- sum of maxterms
Q2 | It should be kept in mind that don’t care terms should be used along with the terms that are present in
- minterms
- expressions
- k-map
- latches
Q3 | Using the transformation method you can realize any POS realization of OR-AND with only.
- xor
- nand
- and
- nor
Q4 | In case of XOR/XNOR simplification we have to look for the following
- diagonal adjacencies
- offset adjacencies
- straight adjacencies
- both diagonal and offset adjencies
Q5 | In which of the following gates the output is 1 if and only if at least one input is 1?
- and
- nor
- nand
- or
Q6 | The time required for a gate or inverter to change its state is called
- rise time
- decay time
- propagation time
- charging time
Q7 | Odd parity of word can be conveniently tested by
- or gate
- and gate
- nand gate
- xor gate
Q8 | The number of full and half adders are required to add 16-bit number is
- 8 half adders, 8 full adders
- 1 half adders, 15 full adders
- 16 half adders, 0 full adders
- 4 half adders, 12 full adders
Q9 | An OR gate can be imagined as
- switches connected in series
- switches connected in parallel
- mos transistor connected in series
- bjt transistor connected in series
Q10 | In parts of the processor, adders are used to calculate
- addresses
- table indices
- increment and decrement operators
- all of the mentioned
Q11 | How many full adders are required to construct an m-bit parallel adder?
- m/2
- m
- m-1
- m+1
Q12 | In which operation carry is obtained?
- subtraction
- addition
- multiplication
- both addition and subtraction
Q13 | If A and B are the inputs of a half adder, the sum is given by
- a and b
- a or b
- a xor b
- a ex-nor b
Q14 | If A and B are the inputs of a half adder, the carry is given by
- a and b
- a or b
- a xor b
- a ex-nor b
Q15 | Half-adders have a major limitation in that they cannot
- accept a carry bit from a present stage
- accept a carry bit from a next stage
- accept a carry bit from a previous stage
- accept a carry bit from the following stages
Q16 | The difference between half adder and full adder is
- half adder has two inputs while full adder has four inputs
- half adder has one output while full adder has two outputs
- half adder has two inputs while full adder has three inputs
- all of the mentioned
Q17 | If A, B and C are the inputs of a full adder then the sum is given by
- a and b and c
- a or b and c
- a xor b xor c
- a or b or c
Q18 | If A, B and C are the inputs of a full adder then the carry is given by
- a and b or (a or b) and c
- a or b or (a and b) c
- (a and b) or (a and b)c
- a xor b xor (a xor b) and c
Q19 | How many AND, OR and EXOR gates are required for the configuration of full
- 1, 2, 2
- 2, 1, 2
- 3, 1, 2
- 4, 0, 1
Q20 | Half subtractor is used to perform subtraction of
- 2 bits
- 3 bits
- 4 bits
- 5 bits
Q21 | How many outputs are required for the implementation of a subtractor?
- 1
- 2
- 3
- 4
Q22 | Let the input of a subtractor is A and B then what the output will be if A = B?
- 0
- 1
- a
- b
Q23 | Let A and B is the input of a subtractor then the output will be
- a xor b
- a and b
- a or b
- a exnor b
Q24 | Let A and B is the input of a subtractor then the borrow will be
- a and b’
- a’ and b
- a or b
- a and b
Q25 | What does minuend and subtrahend denotes in a subtractor?
- their corresponding bits of input
- its outputs
- its inputs
- borrow bits