Step 1: Recall TCP three-way handshake.
The handshake consists of:
1) $P \rightarrow Q$: SYN with SEQ = $X$
2) $Q \rightarrow P$: SYN-ACK with SEQ = $Y$ and ACK = $X+1$
3) $P \rightarrow Q$: ACK with SEQ = $X+1$ and ACK = $Y+1$
Step 2: Identify the response sent by $Q$.
When $Q$ accepts the connection request, it sends a SYN-ACK segment. This segment must have SYN = 1, ACK = 1, SEQ = $Y$, and ACK number = $X+1$.
Step 3: Match with the options.
Option (C) exactly matches these fields and correctly represents the TCP header sent by $Q$ to $P$.
Step 4: Conclusion.
Therefore, the correct option is (C).
The TCP connection establishment process involves a 3-way handshake. Which of the following steps correctly represents the 3-way handshake?
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
Consider the following C code segment:
int x = 126, y = 105;
do {
if (x > y)
x = x - y;
else
y = y - x;
} while (x != y);
printf("%d", x);
The output of the given C code segment is ____________. (Answer in integer)
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________ (answer in integer).
Consider the following C program
The value printed by the given C program is __________ (Answer in integer).