The switching circuit in Fig. 1.1 shows switches, s for a car's sidelights, h for its dipped headlights and f for its high-intensity rear foglights. It also shows the three sets of lights.
\includegraphics{figure_1}
(Note: s and h are each "ganged" switches. A ganged switch consists of two connected switches sharing a single switch control, so that both are either on or off together.)
- Describe in words the conditions under which the foglights will come on. [2]
Fig. 1.2 shows a combinatorial circuit.
\includegraphics{figure_2}
- Write the output in terms of a Boolean expression involving s, h and f. [2]
- Use a truth table to prove that \(s \wedge h \wedge f = \sim (\sim s \vee \sim h) \wedge f\). [3]
- A car's first gear can be engaged (g) if either both the road speed is low (r) and the clutch is depressed (d), or if both the road speed is low (r) and the engine speed is the correct multiple of the road speed (m).
- Draw a switching circuit to represent the conditions under which first gear can be engaged. Use two ganged switches to represent r, and single switches to represent each of d, m and g. [2]
- Draw a combinatorial circuit to represent the Boolean expression \(r \wedge (d \vee m) \wedge g\). [4]
- Use Boolean algebra to prove that \(r \wedge (d \vee m) \wedge g = ((r \wedge d) \vee (r \wedge m)) \wedge g\). [2]
- Draw another switching circuit to represent the conditions under which first gear can be selected, but without using a ganged switch. [1]