1 Data Representation

Computer Architecture · Unit 1 · 4 hrs

Data Representation

Exam-focused notes for Data Representation (Computer Architecture, CSC213): what the TU syllabus asks and how it has actually been tested, with 5 solved past questions from this unit.

What this unit covers

  • Data Representation: Binary Representation, BCD, Alphanumeric Representation, Complements, Fixed Point representation, Representing Negative Numbers, Floating Point Representation, Arithmetic with Complements, Overflow, Detecting Overflow
  • Other Binary Codes: Gray Code, self Complementing Code, Weighted Code, Excess-3 Code, EBCDIC
  • Error Detection Codes: Parity Bit, Odd Parity, Even parity, Parity Generator & Checker

Error Detection Codes

20815 marks

How parity bit is generated in even parity? Demonstrate with suitable table and circuit diagram. [5]

Parity is an extra bit added with the original message to detect errors during data transmission. In even parity, we count the number of 1's in the binary digit: - If the count of 1's is even → parity bit = 0 - If the count of 1's is odd → parity bit = 1 Th...

Full solved answer →
20805 marks

What do you mean by error correction codes? Explain any one of error correction technique. [5]

An error correction code is a binary code that not only detects errors that occur during data transmission but also corrects those errors automatically without requiring retransmission. Unlike error detection codes (such as parity bits) which can only indic...

Full solved answer →
2075.16 marks

Explain the error detection codes with example. [6]

An error detection code is a binary code that detects digital errors during data transmission. The detected errors cannot be corrected but their presence is indicated to the receiver. --- Parity is an extra bit added to the original message to detect errors...

Full solved answer →

Data Representation

20805 marks

What is arithmetic overflow? How can it be detected? [5]

Arithmetic overflow occurs when the result of an arithmetic operation on two n-bit binary numbers produces a result that requires more bits than the available n bits can hold. In other words, while adding two n-bit binary numbers, the result may be a number...

Full solved answer →
20795 marks

What are different methods for representing signed numbers? Represent (-71) in those formats. [5]

- Number to represent: $-71$ - Assumed word size: 8 bits (standard for such problems) --- There are three standard methods: 1. Signed Magnitude Representation 2. 1's Complement Representation 3. 2's Complement Representation In each method, the MSB is the s...

Full solved answer →