Neco 2017 Data Processing Question 6

Practice essay / theory question 6 from the 2017 Neco Data Processing examination. This question covers Truth tables, Boolean algebra, Karnaugh maps, Logic circuit design, Hazard analysis .

Neco 2017 Data Processing Essay / Theory
Topics: Truth tables Boolean algebra Karnaugh maps Logic circuit design Hazard analysis
Question 6 NECO • 2017 • DATA_PROCESSING • essay

A pedestrian crossing is controlled by a digital traffic‑light system. The system has two binary inputs: S (sensor) which is 1 when a pedestrian is waiting, and T (timer) which is 1 when the minimum green‑light interval for vehicles has elapsed. The output W (Walk) should be 1 only when it is safe to allow pedestrians to cross.

Question Parts

( a )
The required behaviour is given by the truth table below. Write the Boolean expression for W in Sum‑of‑Products (SOP) form. | S | T | W | |---|---|---| | 0 | 0 | 0 | | 0 | 1 | 0 | | 1 | 0 | 0 | | 1 | 1 | 1 |
( b )
Simplify the expression obtained in part (a) using a Karnaugh map. Show the K‑map and the resulting minimized SOP expression.
( c )
Implement the minimized expression using only NAND gates. Describe the connections of the NAND gates required to realise W.
( d )
Identify any potential static‑1 hazard that could appear in the NAND‑gate implementation and suggest a modification to eliminate it.

Detailed Solution & Marking Scheme

Get the step-by-step solution, key points required by examiners and detailed marking guidance through the Edcrib AI Tutor.

Reveal Answer

About This Question

This is Neco 2017 Data Processing Question 6. It is one of the essay questions from the 2017 Neco Data Processing examination.

The question covers Truth tables, Boolean algebra, Karnaugh maps, Logic circuit design, Hazard analysis .

Master the Exam!

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows
Chat with Support