Description

This mock test of Combinational Circuit (Advance Level) - 1 for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam.
This contains 15 Multiple Choice Questions for Computer Science Engineering (CSE) Combinational Circuit (Advance Level) - 1 (mcq) to study with solutions a complete question bank.
The solved questions answers in this Combinational Circuit (Advance Level) - 1 quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE)
students definitely take this Combinational Circuit (Advance Level) - 1 exercise for a better result in the exam. You can find other Combinational Circuit (Advance Level) - 1 extra questions,
long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.

QUESTION: 1

The following circuit

Can be represented as:

Solution:

From the given diagram we can see that

QUESTION: 2

The circuit shown below converts.

Solution:

if input is 1010 it generate 1101 which is same as gray to binary code converter.

QUESTION: 3

The output of the circuit shown in following figure is equal to

Solution:

Hence (b) is the correct option.

QUESTION: 4

The circuit given in figure is to be used to implement the function What is the values should be selected I and J?

Solution:

QUESTION: 5

Minimum number of NAND gates required to implement sum in half-adder circuit is:

Solution:

QUESTION: 6

The following circuit is an implemented of:

1. Sum of full adder

2. Carry of half adder

3. Difference of full subtracte

Solution:

From the given circuit

For which only 1 and 3 satisfy. Hence correct option is (d),

QUESTION: 7

The circuit below represents function X{A, B, C, D) as:

Solution:

The given circuit represents the implementation of four variable function using 8: 1 MUX here. D as taken as the fourth i/p and A, B, C act as select lines.

QUESTION: 8

If half adders and full adders are implemented using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be

Solution:

As we know that n bit full adder circuit can represent (n + 1) bits sum. In order to represent addition of two 17 bits numbers we require minimum of 16 full adder and 1 half adder.

Note: For the first bit we can use either HA or FA. Hence, for addition of two 17 bit numbers inspire of 17 full adders we can perform the same task using 16 FA and 1 HA.

Hence (c) is the correct option.

QUESTION: 9

To realize following function 'f'

How many minimum number of 2 input NAND gates are required

Solution:

So it required 10 NAND gates.

QUESTION: 10

Minimum number of 2 x 1 multiplexers required to realize the following function, Assume that inputs are available only in true forr and Boolean constants.1 and 0 are available.

Solution:

QUESTION: 11

The number of full and half-adder required to add 16-bit numbers is

Solution:

To 16 bits number, 1 half and 15 full address or 16 full address are required.

QUESTION: 12

How many 3-to-8 line decoders with an enable input are needed to construct a 6-to-64 line decoder without using any other logic gates?

Solution:

QUESTION: 13

The following circuit implements a two-input AND gate using two 2-1 multiplexers.

What are the values of X_{1} X_{2}, X_{3}?

Solution:

QUESTION: 14

Consider excess-3 code that is used to represent integers 0 through 9 as shown below:

Which of the following expressions is the correct one for an invalid code?

Solution:

Invalid code words are 0, 4, 4, 8, 11, 5.

So code will be a'c'd' + b'c'd' + bed + acd.

QUESTION: 15

What logic function is performed by the circuit shown below:

Solution:

Hence the given circuit represents Half adder.

### Combinational Logic

Video | 08:44 min

### Combinational Logic

Doc | 6 Pages

### PPT - Combinational Logic

Doc | 32 Pages

- Combinational Circuit (Advance Level) - 1
Test | 15 questions | 45 min

- Combinational Circuit (Basic Level) - 1
Test | 10 questions | 30 min

- Pipelining (Advance Level) - 1
Test | 13 questions | 45 min

- Calculus (Advance Level) - 1
Test | 15 questions | 45 min

- Deadlock (Advance Level)- 1
Test | 14 questions | 45 min