04-BS-4 · May 2017
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
National Exams, 04-BS-4 Electric Circuits and Power — May 2017. 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.
Given. Seven binary sensors A–G (train moving, doors open, at station, open-button, close-button, obstruction, signal-green) and the stated open/close business rules, including the two "no action if already in that state" guards.
Find. The OPEN truth table and gate design (parts a, c), and the CLOSE truth table and gate design (parts b, d).
Approach. Translate each English rule directly into a Boolean AND of literals (complementing wherever the rule says "not" or "already"), then read the truth table straight off that single product term — a 1-minterm function needs only an AND gate with the appropriate input inversions, no simplification required.
| 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 |
| 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 |
| Function | Expression |
|---|---|
| OPEN | A'·B'·C·D |
| CLOSE | B·E·F'·G |