Description

This mock test of Test: Number Systems, Boolean Algebra & Sequential Logic Circuits for Railways helps you for every Railways entrance exam.
This contains 20 Multiple Choice Questions for Railways Test: Number Systems, Boolean Algebra & Sequential Logic Circuits (mcq) to study with solutions a complete question bank.
The solved questions answers in this Test: Number Systems, Boolean Algebra & Sequential Logic Circuits quiz give you a good mix of easy questions and tough questions. Railways
students definitely take this Test: Number Systems, Boolean Algebra & Sequential Logic Circuits exercise for a better result in the exam. You can find other Test: Number Systems, Boolean Algebra & Sequential Logic Circuits extra questions,
long questions & short questions for Railways on EduRev as well by searching above.

QUESTION: 1

To perform product of maxterms Boolean function must be brought into

Solution:

QUESTION: 2

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

Solution:

In general, since we are comfortable dealing with Decimal system, the best way to go about under the circumstances is to convert one Number into decimal Number and then with the base x, convert another Number into Decimal Number and equate them to find the value of x.

So, (152)8 is 64*1+8*5+2, which is 106 in Decimal System.

(211)x is 2x^2+ 1*x+1 in Decimal System.

Now, we solve 2x^2+x+1 = 106

i. e. 2x^2+x-105=0

Therefore 2x^2–14x+15x-105=0

Therefore 2x(x-7)+15(x-7)=0

Therefore (x-7)(2x+15)=0

Therefore either x = 7 or x = -15/2.

Obviously x = -15/2 isnot the answer. So, x = 7 is the answer, which can be very easily verified. 2*7^2+1*7+1 = 106 which issame as (152)8.

Thus the base for 211 is 7.

QUESTION: 3

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

Solution:

All are 2’s complement of 7

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

Solution:

See a example

QUESTION: 5

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

Solution:

QUESTION: 6

The circuit shown in fig. is

Solution:

From table it is clear that it is a MOD–3 counter.

QUESTION: 7

The counter shown in fig. is

Solution:

It is a down counter because 0 state of previous FFs change the state of next FF. You may trace the following sequence, let initial state be000

QUESTION: 8

The counter shown in fig. counts from

Solution:

It is a down counter because the inverted FF output drive the clock inputs. The NAND gate will clear FFs A and B when the count tries to recycle to 111. This will produce as result of 100. Thus the counting sequence will be 100, 011, 010, 001, 000, 100 etc.

QUESTION: 9

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

Solution:

It is a 5 bit ripple counter. At 11000 the output of NAND gate is LOW. This will clear all FF. So it is a Mod 24 counter. Note that when 11000 occur, the CLR input is activated and all FF are immediately cleared. So it is a MOD 24 counter not MOD 25.

QUESTION: 10

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

Solution:

10-bit ring counter is a MOD–10, so it divides the 160 kHz input by 10. therefore, w = 16 kHz. The four-bit parallel counter is a MOD–16. Thus, the frequency at x = 1 kHz. The MOD–25 ripple counter produces a frequency at y = 40 Hz. (1 kHz/25 = 40 Hz).

The four-bit Johnson Counter is a MOD-8. This, the frequency at z = 5 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_{2} Q_{1}Q_{0} = 101. The frequency of output Q_{2} Q_{1}Q_{0} will be

Solution:

We see that 1 0 1 repeat after every two cycles, hence frequency will be f_{c}/2

QUESTION: 12

The counter shown in the fig. has initially Q_{2}Q_{1}Q_{0} = 000. The status of Q_{2} Q_{1}Q_{0 } after the first pulse is

Solution:

At first cycle

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

Solution:

In ripple counter delay 4T_{d} = 40 ns.

The synchronous counter are clocked simultaneously, then its worst delay will be equal to 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

Solution:

4 bit uses 4 FF

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

Solution:

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

Solution:

QUESTION: 17

The simplified form of a logic function

Solution:

QUESTION: 18

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

Solution:

On multiplying the decimal number continuously by 2, the binary equivalent is obtained.

QUESTION: 19

Solution:

QUESTION: 20

Solution:

### Boolean Algebra and Some Combinational Circuits

Doc | 47 Pages

### Boolean Algebra

Video | 18:11 min

### Boolean Algebra

Video | 69:03 min

### Boolean Algebra

Doc | 13 Pages

- Test: Number Systems, Boolean Algebra & Sequential Logic Circuits
Test | 20 questions | 60 min

- Test: Sequential Logic Circuits
Test | 10 questions | 30 min

- Test: Boolean Algebra & Logic Gates- 2
Test | 15 questions | 45 min

- Test: Sequential Circuits- 1
Test | 10 questions | 30 min

- Test: Sequential Circuits- 2
Test | 15 questions | 45 min