9618 Computer Science June 2025 Question Paper 32

Write \textbf{pseudocode} to store the following details to \texttt{Flight1}:

\begin{tabular}{|l|l|} \hline \textbf{Field} & \textbf{Data} \ \hline \texttt{FlightNumber} & SB2789 \ \hline \texttt{Destination} & Dublin \ \hline \texttt{FlightDate} & 30/07/2025 \ \hline \texttt{Gate} & N03 \ \hline \texttt{Airline} & Cambridge Airways \ \hline \end{tabular}

The data type for \texttt{Gate} is changed to an enumerated data type, \texttt{GateID}.

Calculate the normalised binary floating-point representation of $+124.4375$ in this system. Show your working.

\textbf{Mantissa} \qquad\qquad\qquad\qquad\qquad\qquad\qquad \textbf{Exponent}

\framebox{$\square\,\square\,\square\,\square\,\square\,\square\,\square\,\square\,\square\,\square\,\square\,\square$} \qquad \framebox{$\square\,\square\,\square\,\square$}

Calculate the denary value of the following normalised binary floating-point number. Show your working.

\textbf{Mantissa} \qquad\qquad\qquad\qquad\qquad\qquad\qquad \textbf{Exponent}

\begin{tabular}{|c|c|c|c|c|c|c|c|c|c|c|c|} \hline 1 & 0 & 1 & 0 & 0 & 0 & 1 & 0 & 1 & 0 & 1 & 1 \ \hline \end{tabular} \qquad \begin{tabular}{|c|c|c|c|} \hline 0 & 1 & 1 & 0 \ \hline \end{tabular}

Denary value \hrulefill

Identify \textbf{two} different layers of the TCP/IP protocol suite.

Describe how the TCP/IP protocol suite is applied when a message is sent through the internet from one host to another. Do \textbf{not} describe the function of individual layers of the TCP/IP protocol suite.

Identify \textbf{three} process states.

1. \hrulefill
2. \hrulefill
3. \hrulefill

Describe the function of the shortest job first scheduling routine \textbf{and} give a benefit of this routine.

Function

Benefit

Describe the structure of a graph as used in an Artificial Intelligence (AI) system.

Explain how supervised learning and unsupervised learning differ from each other.

Complete the truth table for the given logic circuit. Show your working.

\begin{tabular}{|c|c|c|c|c|c|c|c|c|} \hline \multicolumn{4}{|c|}{} & \multicolumn{4}{c|}{Working space} & \ \hline \textbf{A} & \textbf{B} & \textbf{C} & \textbf{D} & \textbf{P} & \textbf{Q} & \textbf{R} & \textbf{S} & \textbf{Z} \ \hline 0 & 0 & 0 & 0 & & & & & \ \hline 0 & 0 & 0 & 1 & & & & & \ \hline 0 & 0 & 1 & 0 & & & & & \ \hline 0 & 0 & 1 & 1 & & & & & \ \hline 0 & 1 & 0 & 0 & & & & & \ \hline 0 & 1 & 0 & 1 & & & & & \ \hline 0 & 1 & 1 & 0 & & & & & \ \hline 0 & 1 & 1 & 1 & & & & & \ \hline 1 & 0 & 0 & 0 & & & & & \ \hline 1 & 0 & 0 & 1 & & & & & \ \hline 1 & 0 & 1 & 0 & & & & & \ \hline 1 & 0 & 1 & 1 & & & & & \ \hline 1 & 1 & 0 & 0 & & & & & \ \hline 1 & 1 & 0 & 1 & & & & & \ \hline 1 & 1 & 1 & 0 & & & & & \ \hline 1 & 1 & 1 & 1 & & & & & \ \hline \end{tabular}

Write the Boolean logic expression that corresponds to the given logic circuit as the sum-of-products.

Z = \hrulefill

Use Boolean algebra including De Morgan's laws to simplify the following expression. Show all working.

Simplified expression \hrulefill

State why \texttt{9K} is not a valid variable for the given syntax diagrams.

Complete the Backus-Naur Form (BNF) for \texttt{}.

\texttt{ ::= } \hrulefill

An expression is defined as follows:

\begin{itemize} \item A variable is assigned to a variable followed by an operator followed by another variable. \item The operator and final variable stage can be repeated as many times as necessary. \end{itemize}

Complete the syntax diagram for an expression.

A character can be a letter or a digit.

An additional constraint has been applied to the definition of variable. It must comply with the given syntax diagram, but it will only pass validation if it has at least \textbf{four} characters.

State \textbf{one} example of a valid variable.

The linked list will be organised as a binary tree.

0 is used to represent a null pointer.

Complete the binary tree, including null pointers, to show how the data will be organised after the following strings have been added:

Aa, Mm, Ss, Xx

A binary tree can be used to implement recursion.

Identify \textbf{one} feature of an algorithm that makes it beneficial to use recursion. Give \textbf{one} example of an application that could use a recursive algorithm.

Feature \hrulefill

Example \hrulefill

A medical clinic uses objects of the class \texttt{Patient} to assign a priority and a doctor to a patient. Some of the attributes required in the class are listed in the table.

\begin{tabular}{|l|l|l|} \hline \textbf{Attribute} & \textbf{Data type} & \textbf{Description} \ \hline \texttt{PatientID} & \texttt{STRING} & Unique identifier of the patient \ \hline \texttt{Name} & \texttt{STRING} & Patient's full name, surname first \ \hline \texttt{DoctorID} & \texttt{STRING} & ID of doctor administering treatment \ \hline \end{tabular}

\newline Treatment is prioritised with a numeric scale of 1 to 5.

Complete the class diagram for \texttt{Patient}, to include: \begin{itemize} \item attribute and data type for the date of birth \item attribute and data type for the priority \item methods to assign the patient ID, priority and doctor ID \item methods to return the patient ID, patient date of birth and the priority. \end{itemize}

\begin{alltt} Patient

PatientID : STRING

Name : STRING

....................................................... : ....................................................................

....................................................... : ....................................................................

DoctorID : STRING

................................................................................................................................

SetName(FullName : STRING)

SetDateOfBirth(DOB : DATE)

................................................................................................................................

................................................................................................................................

................................................................................................................................

GetName()

................................................................................................................................

................................................................................................................................

GetDoctorID() \end{alltt}