Test: Number Systems, Boolean Algebra & Sequential Logic Circuits

Question 1

To perform product of maxterms Boolean function must be brought into

Accepted Answer

OR terms

Answer

AND terms

Answer

NOT terms

Answer

NAND terms

Question 2

If (211)_x = (152)₈ , then the value of base x is

Accepted Answer

7

Answer

6

Answer

5

Answer

9

Question 3

11001, 1001 and 111001 correspond to the 2’s complement representation of the following set of numbers

Accepted Answer

-7, -7 and -7 respectively

Answer

25, 9 and 57 respectively

Answer

-6, -6 and -6 respectively

Answer

-25, -9 and -57 respectively

Question 4

A signed integer has been stored in a byte using 2’s complement format. We wish to store the same integer in 16-bit word. We should copy the original byte to the less significant byte of the word and fill the more significant byte with

Accepted Answer

equal to the MSB of the original byte

Answer

0

Answer

1

Answer

complement of the MSB of the original byte.

Question 5

A computer has the following negative numbers stored in binary form as shown. The wrongly stored number is

Accepted Answer

-48 as 1110 1000

Answer

-37 as 1101 1011

Answer

-89 as 1010 0111

Answer

-32 as 1110 0000

Question 6

Consider the following circuit which uses a 2-to-1 multiplexer as shown in the figure below. The Boolean expression for output F in terms of A and B is

Accepted Answer

Answer

Answer

Answer

Question 7

The counter shown in fig. is

Accepted Answer

MOD–8 down counter

Answer

MOD–8 up counter

Answer

MOD–6 up counter

Answer

MOD–6 down counter

Question 8

The counter shown in fig. counts from

Accepted Answer

1 0 0 to 0 0 0

Answer

0 0 0 to 1 1 1

Answer

1 1 1 to 0 0 0

Answer

0 0 0 to 1 0 0

Question 9

The mod-number of the asynchronous counter shown in fig. is

Accepted Answer

24

Answer

48

Answer

25

Answer

36

Question 10

The frequency of the pulse at z in the network shown in fig. is

Accepted Answer

5 Hz

Answer

10 Hz

Answer

160 Hz

Answer

40 Hz

Question 11

The three-stage Johnson counter as shown in fig. is clocked at a constant frequency of f_c from the starting state of Q₂ Q₁Q₀ = 101. The frequency of output Q₂ Q₁Q₀ will be

Accepted Answer

fc/2

Answer

fc/8

Answer

fc/6

Answer

fc/3

Question 12

The counter shown in the fig. has initially Q₂Q₁Q₀ = 000. The status of Q₂ Q₁Q₀ after the first pulse is

Accepted Answer

1 0 0

Answer

0 0 1

Answer

0 1 0

Answer

1 0 1

Question 13

A 4 bit ripple counter and a 4 bit synchronous counter are made by flips flops having a propagation delay of 10 ns each. If the worst case delay in the ripple counter and the synchronous counter be R and S respectively, then

Accepted Answer

R = 40 ns, S = 10 ns

Answer

R = 10 ns, S = 40 ns

Answer

R = 10 ns, S = 30 ns

Answer

R = 30 ns, S = 10 ns

Question 14

A 4 bit modulo–6 ripple counter uses JK flip-flop. If the propagation delay of each FF is 50 ns, the maximum clock frequency that can be used is equal to

Accepted Answer

5 MHz

Answer

10 MHz

Answer

4 MHz

Answer

20 Mhz

Question 15

The initial contents of the 4-bit serial-in-parallel-out right-shift, register shown in fig. is 0 1 1 0. After three clock pulses are applied, the contents of the shift register will be

Accepted Answer

1 0 1 0

Answer

0 0 0 0

Answer

0 1 0 1

Answer

1 1 1 1

Question 16

Consider the signed binary number A = 01010110 and B = 1110 1100 where B is the 1’s complement and MSB is the sign bit. In list-I operation is given, and in list-II resultant binary number is given.

The correct match is

Accepted Answer

1 6 2 5

Answer

3 4 2 5

Answer

3 6 8 7

Answer

1 4 8 7

Question 17

The simplified form of a logic function

Accepted Answer

AB

Answer

Answer

Answer

Question 18

If the decimal number is a fraction then its binary equivalent is obtained by ________ the number continuously by 2.

Accepted Answer

Multiplying

Answer

Dividing

Answer

Adding

Answer

Subtracting

Question 19

The Boolean equation X = [(A + B̅) (B + C)] B can be simplified to

Accepted Answer

X = AB

Answer

X = A&#773;B

Answer

X = AB&#773;

Answer

X = A̅ B̅

Question 20

Accepted Answer

X + Y

Answer

Answer

XY

Answer

GATE Electrical Engineering (EE) Test: Number Systems, Boolean Algebra

MCQ Practice Test & Solutions: Test: Number Systems, Boolean Algebra & Sequential Logic Circuits (20 Questions)

To perform product of maxterms Boolean function must be brought into

If (211)_x = (152)₈ , then the value of base x is

11001, 1001 and 111001 correspond to the 2’s complement representation of the following set of numbers

A signed integer has been stored in a byte using 2’s complement format. We wish to store the same integer in 16-bit word. We should copy the original byte to the less significant byte of the word and fill the more significant byte with

A computer has the following negative numbers stored in binary form as shown. The wrongly stored number is

Consider the following circuit which uses a 2-to-1 multiplexer as shown in the figure below. The Boolean expression for output F in terms of A and B is

The counter shown in fig. is

The counter shown in fig. counts from

The mod-number of the asynchronous counter shown in fig. is

The frequency of the pulse at z in the network shown in fig. is

The three-stage Johnson counter as shown in fig. is clocked at a constant frequency of f_c from the starting state of Q₂ Q₁Q₀ = 101. The frequency of output Q₂ Q₁Q₀ will be

The counter shown in the fig. has initially Q₂Q₁Q₀ = 000. The status of Q₂ Q₁Q₀ after the first pulse is

A 4 bit ripple counter and a 4 bit synchronous counter are made by flips flops having a propagation delay of 10 ns each. If the worst case delay in the ripple counter and the synchronous counter be R and S respectively, then

A 4 bit modulo–6 ripple counter uses JK flip-flop. If the propagation delay of each FF is 50 ns, the maximum clock frequency that can be used is equal to

The initial contents of the 4-bit serial-in-parallel-out right-shift, register shown in fig. is 0 1 1 0. After three clock pulses are applied, the contents of the shift register will be

Consider the signed binary number A = 01010110 and B = 1110 1100 where B is the 1’s complement and MSB is the sign bit. In list-I operation is given, and in list-II resultant binary number is given.
The correct match is

The simplified form of a logic function

If the decimal number is a fraction then its binary equivalent is obtained by ________ the number continuously by 2.

The Boolean equation X = [(A + B̅) (B + C)] B can be simplified to

GATE Electrical Engineering (EE) Mock Test Series 2027

GATE Electrical Engineering (EE) Mock Test Series 2027

Top Courses for Electrical Engineering (EE)

About this Electrical Engineering (EE) Practice Test

Explore more Electrical Engineering (EE) Study Resources

GATE Electrical Engineering (EE) Test: Number Systems, Boolean Algebra

MCQ Practice Test & Solutions: Test: Number Systems, Boolean Algebra & Sequential Logic Circuits (20 Questions)

To perform product of maxterms Boolean function must be brought into

If (211)x = (152)8 , then the value of base x is

11001, 1001 and 111001 correspond to the 2’s complement representation of the following set of numbers

A signed integer has been stored in a byte using 2’s complement format. We wish to store the same integer in 16-bit word. We should copy the original byte to the less significant byte of the word and fill the more significant byte with

A computer has the following negative numbers stored in binary form as shown. The wrongly stored number is

Consider the following circuit which uses a 2-to-1 multiplexer as shown in the figure below. The Boolean expression for output F in terms of A and B is

The counter shown in fig. is

The counter shown in fig. counts from

The mod-number of the asynchronous counter shown in fig. is

The frequency of the pulse at z in the network shown in fig. is

The three-stage Johnson counter as shown in fig. is clocked at a constant frequency of fc from the starting state of Q2 Q1Q0 = 101. The frequency of output Q2 Q1Q0 will be

The counter shown in the fig. has initially Q2Q1Q0 = 000. The status of Q2 Q1Q0 after the first pulse is

A 4 bit ripple counter and a 4 bit synchronous counter are made by flips flops having a propagation delay of 10 ns each. If the worst case delay in the ripple counter and the synchronous counter be R and S respectively, then

A 4 bit modulo–6 ripple counter uses JK flip-flop. If the propagation delay of each FF is 50 ns, the maximum clock frequency that can be used is equal to

The initial contents of the 4-bit serial-in-parallel-out right-shift, register shown in fig. is 0 1 1 0. After three clock pulses are applied, the contents of the shift register will be

Consider the signed binary number A = 01010110 and B = 1110 1100 where B is the 1’s complement and MSB is the sign bit. In list-I operation is given, and in list-II resultant binary number is given.The correct match is

The simplified form of a logic function

If the decimal number is a fraction then its binary equivalent is obtained by ________ the number continuously by 2.

The Boolean equation X = [(A + B̅) (B + C)] B can be simplified to

GATE Electrical Engineering (EE) Mock Test Series 2027

GATE Electrical Engineering (EE) Mock Test Series 2027

Top Courses for Electrical Engineering (EE)

About this Electrical Engineering (EE) Practice Test

Explore more Electrical Engineering (EE) Study Resources

If (211)_x = (152)₈ , then the value of base x is

The three-stage Johnson counter as shown in fig. is clocked at a constant frequency of f_c from the starting state of Q₂ Q₁Q₀ = 101. The frequency of output Q₂ Q₁Q₀ will be

The counter shown in the fig. has initially Q₂Q₁Q₀ = 000. The status of Q₂ Q₁Q₀ after the first pulse is

Consider the signed binary number A = 01010110 and B = 1110 1100 where B is the 1’s complement and MSB is the sign bit. In list-I operation is given, and in list-II resultant binary number is given.
The correct match is