Consider a 3-bit counter, designed using T flip-flops, as shown below. Assuming the initial state of the counter given by $PQR$ as $000$, what are the next three states? 
Step 1: Recall the operation of a T flip-flop.
A T flip-flop toggles its output when $T = 1$ and holds its state when $T = 0$.
Step 2: Analyse the given counter circuit.
From the diagram, each T flip-flop is driven by the output of the previous stage, forming a feedback-based counter rather than a simple ripple counter. The toggle conditions depend on the current states of $P$, $Q$, and $R$.
Step 3: Determine the state transitions.
Starting from the initial state $PQR = 000$:
After the first clock pulse, the counter transitions to $011$.
After the second clock pulse, the counter transitions to $101$.
After the third clock pulse, the counter transitions back to $000$.
Step 4: Conclusion.
Thus, the next three states of the counter are $011$, $101$, and $000$.
Consider the following logic circuit diagram.

Which one of the following circuits implements the Boolean function given below?
\[ f(x,y,z) = m_0 + m_1 + m_3 + m_4 + m_5 + m_6, \] where \(m_i\) is the \(i^{\text{th}}\) minterm.


Consider the following code:
int a;
int arr[] = {30, 50, 10};
int *ptr = arr[10] + 1;
a = *ptr;
(*ptr)++;
ptr = ptr + 1;
printf("%d", a + arr[1] + *ptr);
In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative

Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[ \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\ \hline P1 & 0 & 10 \\ P2 & 1 & 13 \\ P3 & 2 & 6 \\ P4 & 8 & 9 \\ \hline \end{array} \]Find the turnaround time for each process.