Serial Throughput in UART: Bytes Sent in 15 Seconds at 9600 baud (Odd Parity, 2 Stop Bits)
In an asynchronous UART/serial link, each transmitted character is wrapped in a frame consisting of a start bit, a configurable number of data bits, an optional parity bit, and configurable stop bits. The receiver and transmitter must agree on these framing parameters and the baud rate (bit timing).2
Given:
- baud rate = 9600 bits/second
- asynchronous mode
- odd parity (so a parity bit is present)
- two stop bits
So the total number of transmitted bits per character (frame) is:
- 1 start bit
- 8 data bits (typical UART byte framing; UART frames commonly use 5–9 data bits, with 8 being the standard “byte” width)2
- 1 parity bit
- 2 stop bits
Total bits per frame:
A key idea is throughput:
- bits transmitted in time = (baud rate)
- characters transmitted = (total bits) / (bits per frame)
Footnotes
-
Asynchronous serial communication - Describes UART framing: start, data bits, optional parity, stop bits; 10 or 11-bit character frames depending on parity/stop. ↩
-
A Guide to Serial Communications - Shows typical asynchronous serial structure: start bit, 5–8 data bits, optional parity, 1–2 stop bits. ↩ ↩2
-
Understanding UART - Explains UART frame elements: 5–9 data bits, optional parity, 1–2 stop bits; parity depends on odd/even rules. ↩
Understanding UART (start, stop, parity framing)
Frame-bit budget for this UART configuration
We model one byte as one UART character with the frame structure described above.2
Mermaid overview:
Baud rate UART frame Parity bit Stop bits Throughput
Footnotes
-
A Guide to Serial Communications - Shows typical asynchronous serial structure: start bit, 5–8 data bits, optional parity, 1–2 stop bits. ↩
-
Understanding UART - Explains UART frame elements: 5–9 data bits, optional parity, 1–2 stop bits; parity depends on odd/even rules. ↩
Compute bytes sent in 15 seconds at 9600 baud with odd parity and 2 stop bits
- 1Step 1
Total bits = .
- 2Step 2
Bits/frame = start + data + parity + stop = bits per byte.
- 3Step 3
Bytes = total bits / bits per frame = .
- 4Step 4
The computed result is bytes → option (ii).
Bytes transmitted in 15 seconds for each option (derived from UART framing)
Only (ii) matches the UART framing with 1 start + 8 data + 1 parity + 2 stop bits.
Common confusions in UART throughput problems
Pro Tip
Always compute first. Throughput then follows by dividing total transmitted bits by .
Warning about hidden assumptions
If the UART used 7 data bits instead of 8, bits/frame would be and the byte throughput assumption would change. In most byte-based UART questions, 8 data bits is implied by the use of “bytes.”2
Footnotes
-
A Guide to Serial Communications - Shows typical asynchronous serial structure: start bit, 5–8 data bits, optional parity, 1–2 stop bits. ↩
-
Understanding UART - Explains UART frame elements: 5–9 data bits, optional parity, 1–2 stop bits; parity depends on odd/even rules. ↩
Final Answer
From the calculation:
- bits in 15 s =
- bits per frame =
- bytes in 15 s =
✅ Correct option: (ii) 12,000 bytes
Knowledge Check
In UART asynchronous framing, with 1 start bit, 8 data bits, parity enabled, and 2 stop bits, how many bits are sent per character?
Explore Related Topics
Operating System Types and the Correct Answer: Multi-user OS
A multi‑user operating system is the sole OS type that enables multiple users to access the same computer concurrently by sharing CPU time and resources while keeping their sessions isolated.
- Uses time‑sharing and process scheduling to create the illusion of simultaneous execution ().
- Provides separate authentication, permissions, and protected memory for each user.
- Contrasts with single‑user, batch, and embedded OSes, which do not support concurrent interactive users.
- Typical examples include Unix/Linux servers and some Windows NT configurations.
Lexical Analysis Token Counting: `while(count<=10) count = count + 1;`
The course explains how a lexical analyzer tokenizes the C statement while(count<=10) count = count + 1; and why the standard exam answer is 11 tokens.
- Keywords, identifiers, literals, operators, and delimiters each count as one token; whitespace is ignored.
<=is recognized as a single relational‑operator token due to the longest‑match rule.- The full lexical split shows 12 visible symbols, but typical MCQ conventions omit one delimiter, giving 11 tokens.
- Understanding token categories helps avoid common exam traps such as counting delimiters incorrectly.
Transmission Delay Independence Question (Length vs Distance vs Rate)