‹ Back to the paper
Question 4(i)
5 marks
Computer ScienceISC 2026 Improvement Computer Science Paper 1Truth tableBoolean Algebra
Answer the following using a truth table.
An automated parking gate uses four binary sensors. The parking gate should open under any one of…
An automated parking gate uses four binary sensors. The parking gate should open under any one of the following conditions:
• Vehicle detected and parking slot available
OR
• Parking slot available and either payment confirmed or VIP access granted
OR
• Payment not confirmed but VIP access granted
The inputs are:
(In all the above cases, 1 indicates YES and 0 indicates NO)
Output: X - Denotes opening of the parking gate (1 = Open, 0 = Close)
Draw the truth table for the inputs and outputs given above. Write the SOP expression for $X(V, S, P, I)$.
| INPUTS | |
|---|---|
| V | Vehicle detected |
| S | Parking slot available |
| P | Payment confirmed |
| I | VIP access granted |
Answer
Answer
| V | S | P | I | VS + S(P + I) + P'I |
| 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 1 | 1 |
| 0 | 0 | 1 | 0 | 0 |
| 0 | 0 | 1 | 1 | 0 |
| 0 | 1 | 0 | 0 | 0 |
| 0 | 1 | 0 | 1 | 1 |
| 0 | 1 | 1 | 0 | 1 |
| 0 | 1 | 1 | 1 | 1 |
| 1 | 0 | 0 | 0 | 0 |
| 1 | 0 | 0 | 1 | 1 |
| 1 | 0 | 1 | 0 | 0 |
| 1 | 0 | 1 | 1 | 0 |
| 1 | 1 | 0 | 0 | 1 |
| 1 | 1 | 0 | 1 | 1 |
| 1 | 1 | 1 | 0 | 1 |
| 1 | 1 | 1 | 1 | 1 |
Minimal SOP: $X = VS + SP + SI + P'I$ reduces to $X = VS + SP + P'I$, which is the same function. Canonical SOP: $X = \Sigma(1, 5, 6, 7, 9, 12, 13, 14, 15)$ in the order V, S, P, I.