- IB
- A1.2 Data representation and computer logic
Practice A1.2 Data representation and computer logic with authentic IB Computer Science (First Exam 2027) exam questions for both SL and HL students. This question bank mirrors Paper 1, 2, 3 structure, covering key topics like programming concepts, algorithms, and data structures. Get instant solutions, detailed explanations, and build exam confidence with questions in the style of IB examiners.
Complete the truth table for the following circuit: [4]
A B NOT B Output 0 0
0 1
1 0
1 1
Make it markdown format
Draw the logic gate symbol for an XOR gate. [1]
Construct a Boolean expression for the circuit: A AND (B OR C). [1]
Explain how a half-adder circuit can add two single-bit binary numbers. [2]
A digital audio system processes sound data at different bit depths and sampling rates.
Calculate the file sizes and complete the table for one minute of audio:
| Bit Depth | Sampling Rate | Channels | File Size (MB) | Quality Level |
|---|---|---|---|---|
| -bit | CD Quality | |||
| -bit | ||||
| -bit | Studio Master |
Analyze how quantization affects audio quality and explain why higher bit depths reduce quantization noise.
A digital security system uses various logic circuits for access control.
Design and complete the truth table for a security system that grants access when: Card Reader AND (Fingerprint OR PIN) is satisfied:
| Card Reader | Fingerprint | PIN | Fingerprint OR PIN | Access Granted |
|---|---|---|---|---|
| 0 | 0 | 0 | ||
| 0 | 0 | 1 | ||
| 0 | 1 | 0 | ||
| 0 | 1 | 1 | ||
| 1 | 0 | 0 | ||
| 1 | 0 | 1 | ||
| 1 | 1 | 0 | ||
| 1 | 1 | 1 |
Construct Boolean expression and explain gate implementation.
A security system uses various data encoding methods.
Explain the difference between lossy and lossless data compression.
State one example each of lossy and lossless compression formats.
Outline why ASCII encoding is limited for international applications.
A data compression algorithm analyzes file types for optimal compression strategies.
Complete the compression analysis table for different file types:
| File Type | Original Size | Compressed Size | Compression Ratio | Compression Type | Quality Loss |
|---|---|---|---|---|---|
| Text (.txt) | None | ||||
| Image (.jpg) | Lossy | Some | |||
| Audio (.mp3) | Some | ||||
| Video (.mp4) | Some | ||||
| Archive (.zip) | Lossless | None |
Analyze why different compression algorithms are more suitable for specific data types and discuss the trade-offs between compression ratio and quality.
A telecommunications company needs to implement error detection in their data transmission system.
Complete the following table for even parity by determining the parity bit and the final 8-bit code for each value. The parity bit should be placed in the most significant bit (leftmost) position.
| Data Bits | 7-bit Binary Representation | Parity Bit (Even) | Complete 8-bit Code |
|---|---|---|---|
| 65 (A) | 1000001 | ||
| 90 (Z) | 1011010 | ||
| 48 (0) | 0110000 | ||
| 127 | 1111111 |
Explain how parity bits enable error detection and discuss their limitations for error correction.
A computer graphics application processes color data in different formats.
Convert between different color representation systems and complete the table:
| RGB Values | Hexadecimal | Decimal Equivalent | Color Description |
|---|---|---|---|
| Medium Gray | |||
| Purple |
Explain why hexadecimal notation is preferred over decimal for representing color values in web development and graphics programming.
Data must be represented in binary format for computer processing.
Convert the decimal number 156 to binary.
Convert the hexadecimal number 2F to decimal.
Explain why hexadecimal notation is commonly used in computing.
A computer uses 8-bit two's complement representation. Calculate the decimal equivalent of the binary number 11010110.
State the range of values that can be represented using 8-bit two's complement.
Digital image processing requires understanding of data representation.
Calculate the file size of an uncompressed pixel image using -bit color depth. Express your answer in .
Explain how dithering is used when converting images to lower bit depths.
Compare raster and vector image representations in terms of scalability and file size.
Practice A1.2 Data representation and computer logic with authentic IB Computer Science (First Exam 2027) exam questions for both SL and HL students. This question bank mirrors Paper 1, 2, 3 structure, covering key topics like programming concepts, algorithms, and data structures. Get instant solutions, detailed explanations, and build exam confidence with questions in the style of IB examiners.
Complete the truth table for the following circuit: [4]
A B NOT B Output 0 0
0 1
1 0
1 1
Make it markdown format
Draw the logic gate symbol for an XOR gate. [1]
Construct a Boolean expression for the circuit: A AND (B OR C). [1]
Explain how a half-adder circuit can add two single-bit binary numbers. [2]
A digital audio system processes sound data at different bit depths and sampling rates.
Calculate the file sizes and complete the table for one minute of audio:
| Bit Depth | Sampling Rate | Channels | File Size (MB) | Quality Level |
|---|---|---|---|---|
| -bit | CD Quality | |||
| -bit | ||||
| -bit | Studio Master |
Analyze how quantization affects audio quality and explain why higher bit depths reduce quantization noise.
A digital security system uses various logic circuits for access control.
Design and complete the truth table for a security system that grants access when: Card Reader AND (Fingerprint OR PIN) is satisfied:
| Card Reader | Fingerprint | PIN | Fingerprint OR PIN | Access Granted |
|---|---|---|---|---|
| 0 | 0 | 0 | ||
| 0 | 0 | 1 | ||
| 0 | 1 | 0 | ||
| 0 | 1 | 1 | ||
| 1 | 0 | 0 | ||
| 1 | 0 | 1 | ||
| 1 | 1 | 0 | ||
| 1 | 1 | 1 |
Construct Boolean expression and explain gate implementation.
A security system uses various data encoding methods.
Explain the difference between lossy and lossless data compression.
State one example each of lossy and lossless compression formats.
Outline why ASCII encoding is limited for international applications.
A data compression algorithm analyzes file types for optimal compression strategies.
Complete the compression analysis table for different file types:
| File Type | Original Size | Compressed Size | Compression Ratio | Compression Type | Quality Loss |
|---|---|---|---|---|---|
| Text (.txt) | None | ||||
| Image (.jpg) | Lossy | Some | |||
| Audio (.mp3) | Some | ||||
| Video (.mp4) | Some | ||||
| Archive (.zip) | Lossless | None |
Analyze why different compression algorithms are more suitable for specific data types and discuss the trade-offs between compression ratio and quality.
A telecommunications company needs to implement error detection in their data transmission system.
Complete the following table for even parity by determining the parity bit and the final 8-bit code for each value. The parity bit should be placed in the most significant bit (leftmost) position.
| Data Bits | 7-bit Binary Representation | Parity Bit (Even) | Complete 8-bit Code |
|---|---|---|---|
| 65 (A) | 1000001 | ||
| 90 (Z) | 1011010 | ||
| 48 (0) | 0110000 | ||
| 127 | 1111111 |
Explain how parity bits enable error detection and discuss their limitations for error correction.
A computer graphics application processes color data in different formats.
Convert between different color representation systems and complete the table:
| RGB Values | Hexadecimal | Decimal Equivalent | Color Description |
|---|---|---|---|
| Medium Gray | |||
| Purple |
Explain why hexadecimal notation is preferred over decimal for representing color values in web development and graphics programming.
Data must be represented in binary format for computer processing.
Convert the decimal number 156 to binary.
Convert the hexadecimal number 2F to decimal.
Explain why hexadecimal notation is commonly used in computing.
A computer uses 8-bit two's complement representation. Calculate the decimal equivalent of the binary number 11010110.
State the range of values that can be represented using 8-bit two's complement.
Digital image processing requires understanding of data representation.
Calculate the file size of an uncompressed pixel image using -bit color depth. Express your answer in .
Explain how dithering is used when converting images to lower bit depths.
Compare raster and vector image representations in terms of scalability and file size.