A selection of questions for Digital systems 1 from past test papers for you revision.

#Complete the following table by converting each number to each of the other numbering systems:
Write your answers in the blank part of the box provided below.

Decimal Hexadecimal Binary Octal
33.25
FAF
11101111
1276


#Simplify the following Boolean equations
_ _ _ _ _ _ _ _ _
2.1 F = A + B C D + A B + A + A B C D + D
_ _ _ _ _ _ _
2.2 F = P Q Z + P Q Z + P Q Z + P Q Q
_ _ _ _ _ _
2.3 F = A(A + B + C).(A + B + C)(A + B + C)(A + B +C)


2.4 X = (A+B)B.C + A + B + B.C

#Extract with the least number of loops the simplified Boolean expression from the following Karnaugh
Maps;
0 0 01 11 10
0 0
01
11
10
A B
C D

0 0 01 11 10
0 0
01
11
10
A B
C D

#Write down the minimum product of sums Boolean expression for the G segment output of a BCD to 7
Segment decoder that drives a common cathode display. The G segment is the middle horizontal segment.

#Assume the BCD input is denoted by A Write down the Boolean expression for a comparator that compares
two binary bits A and B and indicates if A > B, with an active low output.

#Design an overheat alarm for an oil fired steam boiler. Three sensors are available.
One sensor monitors the water temperature in the boiler, (BW)
One sensor monitors the chimney temperature, (.C)
One sensor follows the on off state of the burner. (OB)
An alarm signal should be generated whenever the burner is on and either the chimney or water temperature is
too hot.
Operation of the sensors:
Boiler water
0 = Water is within normal temperature range
1 = Water is too hot
Chimney
0 = Chimmney is within normal temperature range
1 = Chinmey is too hot
Oil Burner
0 = burner is off
1 = burner is on

Complete the following on the answer sheet
Truth table
Simplify the Boolean expression in a Karnaugh map.

#Design a modulo 11 up counter, counting up to 1100 in binary from any switch on value, but will then start from
0010 and continue in the loop between 0010 and 1100. Show clearly on your diagram the position of the most
significant bit
Complete the wiring of the diagram below so that it will function

J
0
K
0
FF0
CLR
Q
0
J
1
K
1
FF1
CLR
Q
1
J
2
K
2
FF2
CLR
Q
2
J
3
K
3
FF3
CLR
Q
3


Complete the output timing diagram waveforms for this counter.
Clearly show where glitches will occur.

1 2 3 4 5 6 7 8 9 10 11 12 1
CLK
CLR
Q
0
Q
1
Q
2
Q
3


#Complete the following timing diagram for a positive edge triggered J-K Flip Flop with asynchronous active
HIGH preset and clear.

CLK


J
0

K 0



PRE 0


CLR 0


Q 0




#Write a Boolean expression for X. Simplify the Boolean equation using the Karnaugh map given on this page and
re-draw the simplified circuit with least number of gates.



































Write the Simplified Boolean expression:

Re-draw the simplified circuit here




#Draw the designed full adder in 2.3 using only half adders
#Show by means of a sketch using AND and OR gates, how the data of four lines can be switched to a single line
via a multiplexer. Show the control combinations on a truth table.
#A jet plane is to be equipped with a warning system that alerts the pilot under certain conditions of danger.
The warning system monitors four instruments on the control panel
These instruments are A =altitude, S = airspeed and W = the state of the landing wheels. F = Fuel
Three conditions of danger must be detected:
1. A landing speed warning lamp must glow if the airspeed is less than the cruising speed and the landing wheels are
not down, or if the wheels are down and the pilot is at the proper landing altitude, but not at the proper landing speed
2. A airframe warning lamp must glow whenever the airspeed is too fast, or when the wheels are down and the
airspeed is above the landing speed
3. A optimum airspeed speed warning lamp must glow whenever the airspeed is a cruising speed and the fuel intake is
minimum.

Use the following truth table and Karnaugh map to derive the minimum sum of products expression for the circuit
F W S A LSW AFW OAS
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1


Simplified POS expression:________________________________________________
#The following logic circuit contains too many components. Simplify the circuit
and draw the cheaper circuit from gates of your choice.



X
Y
Z A
















1 0 0 0
1 0 0 1
1 0 1 0
1 00 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1