Easy -1.8 This question tests basic definitional understanding of graph theory terminology and simple circuit analysis. Part (a) requires only careful reading comprehension to identify correct/incorrect definitions—no problem-solving or mathematical manipulation. Part (b) involves systematically listing 8 switch combinations and tracing current paths, which is routine and mechanical. This is significantly easier than average A-level questions which typically require applying techniques or multi-step reasoning.
A graph is simple if it contains neither loops nor multiple arcs, ie none of the following:
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_81_134_219_1683}
or
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_79_589_301_328}
In an examination question, students were asked to describe in words when a graph is simple. Mark the following responses as right or wrong, giving reasons for your decisions if you mark them wrong.
A graph is simple if there are no loops and if two nodes are connected by a single arc.
A graph is simple if there are no loops and no two nodes are connected by more than one arc.
A graph is simple if there are no loops and two arcs do not have the same ends.
A graph is simple if there are no loops and there is at most one route from one node to another.
The following picture represents a two-way switch
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_149_138_932_1119}
It can either be in the up state
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_104_104_1128_790}
or in the down state • or in the down state .
Two switches can be used to construct a circuit in which changing the state of either switch changes the state of a lamp.
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_309_543_1448_762}
Georgios tries to connect together three two-way switches so that changing the state of any switch changes the state of the lamp. His circuit is shown below. The switches have been labelled 1,2 and 3.
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_496_547_1946_760}
List the possible combination of switch states and determine whether the lamp is on or off for each of them.
Say whether or not Georgios has achieved his objective, justifying your answer.
Use a truth table to show that \(( \mathrm { A } \wedge ( \mathrm { B } \vee \mathrm { C } ) ) \vee \sim ( \sim \mathrm { A } \vee ( \mathrm { B } \wedge \mathrm { C } ) ) \Leftrightarrow \mathrm { A }\).
1
\begin{enumerate}[label=(\alph*)]
\item A graph is simple if it contains neither loops nor multiple arcs, ie none of the following:\\
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_81_134_219_1683}\\
or\\
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_79_589_301_328}
In an examination question, students were asked to describe in words when a graph is simple. Mark the following responses as right or wrong, giving reasons for your decisions if you mark them wrong.
\begin{enumerate}[label=(\roman*)]
\item A graph is simple if there are no loops and if two nodes are connected by a single arc.
\item A graph is simple if there are no loops and no two nodes are connected by more than one arc.
\item A graph is simple if there are no loops and two arcs do not have the same ends.
\item A graph is simple if there are no loops and there is at most one route from one node to another.
\end{enumerate}\item The following picture represents a two-way switch\\
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_149_138_932_1119}
It can either be in the up state\\
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_104_104_1128_790}\\
or in the down state • or in the down state .
Two switches can be used to construct a circuit in which changing the state of either switch changes the state of a lamp.\\
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_309_543_1448_762}
Georgios tries to connect together three two-way switches so that changing the state of any switch changes the state of the lamp. His circuit is shown below. The switches have been labelled 1,2 and 3.\\
\includegraphics[max width=\textwidth, alt={}, center]{a09472cd-8f65-4cca-9683-c386053e66aa-2_496_547_1946_760}
\begin{enumerate}[label=(\roman*)]
\item List the possible combination of switch states and determine whether the lamp is on or off for each of them.
\item Say whether or not Georgios has achieved his objective, justifying your answer.
\end{enumerate}\item Use a truth table to show that $( \mathrm { A } \wedge ( \mathrm { B } \vee \mathrm { C } ) ) \vee \sim ( \sim \mathrm { A } \vee ( \mathrm { B } \wedge \mathrm { C } ) ) \Leftrightarrow \mathrm { A }$.
\end{enumerate}
\hfill \mbox{\textit{OCR MEI D2 2013 Q1 [16]}}