Class 11 | Data Representation | COA Notes

UNIT 2
Class 11 COA Data Representation

Data Representation

Original Scanned PDF – View Notes

01

Data

  • Data represent symbols that represent people, events, things and ideas.
  • Data can be a name, a number, the color in a photograph or notes in a musical composition.
02

Data Representation

  • It refers to the form in which data is stored, processed and transmitted.
  • Devices such as smart phones, iPods and computers store data in digital format that can be handled by electronic circuit.
  • The 0s and 1s are used to represent digital data.
  • A bit is either ‘0’ or ‘1’.
  • For representing number digital devices use binary number system.
  • For representing Text, Digital devices use several type of coding technique like ASCII, unicode (16 bit).
03

ASCII

  • ASCII (American Standard Code for Information Interchange) required 7 bit for each computer.
  • The ASCII code for an uppercase A is 1000001.
  • Extended ASCII is a superset of ASCII that uses 8 bit for each other.
  • Using 8 bit instead of 7 bit allows Extended ASCII to provide code for 256 character.
04

Unicode

Unicode using 16 bit and provide codes for 65000 character.

05

State Unit of Measurement in Computer

Bits and Bytes

  • All of the data stored and transmitted by digital devices in encoded as bits.
  • Bits and Bytes is used to describe storage capacity and network speed.
  • Bit is denoted by b.
  • A group of 8 bits is called a byte.
  • It is denoted by B.
UnitValue
BitOne binary digit
Byte8 bits
Kilobit1024 or 210 bits
Kilobyte1024 or 210 bytes
Megabit1,048,576 or 220 bit
Megabyte1,048,576 or 220 bytes
Gigabit230 bits
Gigabyte230 bytes
Terabyte240 bytes
Petabyte250 bytes
Exabyte260 bytes
  • Uses bits for data rates such as internet connection speeds and movie download speeds.
  • Uses bytes for files sizes and storage capacities.
06

Signed Number Representation

  • A signed number is a number with positive (+) or negative (−) associated with it.
  • In binary, signed number can be represented in three ways.
  1. Signed bit
  2. 1’s complement
  3. 2’s complement

1. Signed Bit

  • The MSB (Most Significant Bit) represents the sign of the number.
  • Magnitude is represented by other bit than MSB i.e (n−1).
  • For −ve, MSB is ‘0’.
  • For +ve, MSB is ‘1’.
Source note: The positive/negative MSB wording above is transcribed exactly as written in the scan, even though the following tables use 0 for positive and 1 for negative.

Positive Number

SignMagnitudeDecimal
0000+0
0001+1
0010+2
0011+3
0100+4
0101+5
0110+6
0111+7

Negative Number

SignMagnitudeDecimal
1000−0
1001−1
1010−2
1011−3
1100−4
1101−5
1110−6
1111−7

2. 1’s Complement

A 1’s complement is a system in which negative numbers are represented by the inverse of the binary representation of their corresponding positive number.

In such a system, a number is negated (converted from positive to negative or vice versa) by computing its ones’ complement.

For positive numbers representation as same are signed bit.

For negative number 1’s complement of 0 is 1 and 1’s complement is 0.

Positive Number

SignMagnitudeDecimal
0000+0
0001+1
0010+2
0011+3
0100+4
0101+5
0110+6
0111+7

Negative Number

SignMagnitudeDecimal
1111−0
1110−1
1101−2
1100−3
1011−4
1010−5
1001−6
1000−7

3. 2’s Complement

  • 2’s complement is a mathematical operation to reversibly convert a positive binary number into a negative binary number with equivalent value, using the binary digit with the greatest place value to indicate whether the binary number is positive or negative.
  • For +ve numbers the representation rules are same as the signed bit.
  • For −ve numbers, simply take 1’s complement and 1 to it.
Circular 4-bit two’s complement number representation from minus eight through plus seven −8 (1000) −7 (1001) −6 (1010) −5 (1011) −4 (1100) −3 (1101) −2 (1110) −1 (1111) 0 (0000) +1 (0001) +2 (0010) +3 (0011) +4 (0100) +5 (0101) +6 (0110) +7 (0111)
2’s complement number circle as shown in the scan
07

Floating Point Representation

To convert the floating point into decimal we have 3 elements in a 32 bit floating point representation:

  1. Sign
  2. Exponent
  3. Mantissa

1. Sign

  • It is the first bit of the binary representation.
  • ‘1’ implies negative and ‘0’ implies positive number.
Example: 11000011101000000000000000000000 This is negative number.

2. Exponent

It is decided by next 8 bits of binary representation after sign bit.

3. Mantissa

  • It is calculated from remaining 23 bits of binary representation.
  • The general structure of a floating point representation of a binary number.
Exponent
Mantissa × 2
General structure shown in the source

Example: Convert 111101.1000110 into floating value.

Ans. 111101.1000110 = 1.111011000110 × 25

08

Binary Coded Decimal (BCD)

  • BCD is a process of binary encoding of decimal number.
  • Each decimal digit is represented by using four or eight bit.
  • The four bit BCD code for 0–9 decimal digit is given as:
DecimalBinary (BCD)
00000
10001
20010
30011
40100
50101
60110
70111
81000
91001

Numbers larger than 9 have two or more digits in decimal system are expressed in digital by each digit.

Example: BCD representation of decimal number 1895 is

1
0001
8
1000
9
1001
5
0101

(1895)10 = (0001100010010101)2 = (1100010010101)2

Discussion

Share a helpful question, idea, or explanation with other students.

Leave a Comment

Write a clear question, answer, or helpful explanation.
Your email will not be published.

Download Our Offline App

Study class-wise notes even when internet is not available. Get the app from Play Store.

Nepal eNotes offline app preview
Get it on Google Play