04-BS-4 · May 2016
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
National Exams, 04-BS-4 Electric Circuits and Power — May 2016. Closed book; one double-sided aid sheet permitted; any five of the seven questions constitute a complete paper (all seven are answered here as a complete study resource).
Reference texts: Sadiku & Alexander, Fundamentals of Electric Circuits, 6th ed. (circuit analysis, transients, AC steady state, magnetic circuits); Boylestad & Nashelsky, Electronic Devices and Circuit Theory (rectifiers); Mano, Digital Design (combinational logic).
Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.
Both the open-trigger and close-trigger conditions reduce, from the prose, to a single AND-of-four-literals condition — i.e. each truth table has exactly one row equal to 1 and the minimal realization is a 4-input AND gate with inverters on the literals that must be FALSE.
Open condition. The doors open only when: the train is not moving (A′), the doors are not already open — "no action if the doors are already open" (B′), the train is at a station (C), and the open button is pressed (D). Sensors E, F, G do not affect opening. $$ \text{Open} = A'\!\cdot\!B'\!\cdot\!C\!\cdot\!D. $$
| A | B | C | D | Open |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 1 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 0 |
| 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 |
Close condition. The doors close only when: the doors are currently open — "no action if the doors are closed" (B), the close button is pressed (E), the signal is green, i.e. NOT "not green" (G), and no obstruction has been detected (F′). The problem statement conditions closing on signal and obstruction only, not on train motion, so A does not appear. $$ \text{Close} = B\!\cdot\!E\!\cdot\!F'\!\cdot\!G. $$
| B | E | F | G | Close |
|---|---|---|---|---|
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 0 |
| 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 | 0 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 0 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 0 |
| 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 | 0 |
Logic circuits (parts c, d). Because each truth table has exactly one 1-row, the minimal sum-of-products IS that single product term — no Karnaugh-map reduction is needed. Each is realized directly as inverters on the negated literals feeding a single 4-input AND gate.