Solved Questions – Data Representation

and Boolean Algebra

Very Short Answer Type – Solved
1. What is the place value of 9 in (296)₁₀?
→ The place value of 9 is 90 (9 × 10).

2. Find octal equivalent of the decimal number 55.

→ Octal equivalent of 55 is (67)₈.

3. Find missing terms in the following series:

a) 101, __, 1010, __, 1111
→ a) 101, 110, 1010, 1101, 1111

b) 15, 16, 17, __

→ b) 18

c) 18₁₆, 1A₁₆, 1C₁₆, __

→ c) 1E₁₆

4. If (X)₂ + (1010)₂ = (10000)₂ then find X.

→ (X)₂ = (10000)₂ - (1010)₂ = (10000 - 1010)₂ = (01010)₂ = (1010)₂

5. Name the coding system that can represent almost all the characters used in the human
languages in the world.
→ Unicode

6. Find out the logical statement(s) from the following:

→ c) India is my country.

7. List three basic logic gates.

→ AND, OR, NOT

8. Which gate is called inverter?

→ NOT gate

9. List two complementarity laws.

→ A + A' = 1 and A · A' = 0

10. The Boolean expression (A + B) represents which gate?

→ c) OR
Short Answer Type – Solved
1. 1 Define the term data representation.

→ It is the method used to represent data and instructions in a computer using binary (0s
and 1s).

2. What do you mean by a number system? List any four number systems.

→ A number system is a writing system for expressing numbers. Four types: Decimal,
Binary, Octal, Hexadecimal.

3. Convert the following numbers into the other three number systems:
a) (125)₁₀

→ Binary: 1111101, Octal: 175, Hex: 7D

b) 98

→ Binary: 1100010, Octal: 142, Hex: 62

c) (101110)₂

→ Decimal: 46, Octal: 56, Hex: 2E

d) (A23)₁₆

→ Decimal: 2595, Binary: 101000100011, Octal: 5043

4. 4. Convert the following:

a) (71.1)₁₀

→ Binary: 1000111.00011, Octal: 107.1, Hex: 47.19

b) (207.13)₁₀

→ Binary: 11001111.00100011..., Octal: 317.10..., Hex: CF.21...

c) 93.25

→ Binary: 1011101.01, Octal: 135.2, Hex: 5D.4

d) (10111011.1101)₂

→ Decimal: 187.8125, Octal: 273.64, Hex: BB.D

5. 5. If (X)₂ = (Y)₈ = (Z)₁₆ = (28)₁₀, then find X, Y and Z.

→ X = 11100₂, Y = 34₈, Z = 1C₁₆

6. . Arrange in descending order:
a) (101)₂ = 5
b) (110)₁₀ = 110
c) (111000)₂ = 56
d) (251)₈ = 169

→ Descending: (251)₈, (110)₁₀, (111000)₂, (101)₂

7. . Find X, if (X)₂ = (10111)₂ + (11011)₂ - (11100)₂

→ X = (10111 + 11011 - 11100)₂ = (10010)₂

8. . Methods of representing integers in computer memory

→ Sign and magnitude, 1’s complement, 2’s complement

9. Represent using all three methods:

a) -19

→ Sign-Mag: 10010011, 1's Comp: 11101100, 2's Comp: 11101101

b) +49

→ Sign-Mag: 00110001, 1's & 2's: same as magnitude

c) -97

→ Sign-Mag: 11000001, 1's: 10011110, 2's: 10011111

d) -127

→ Sign-Mag: 11111111, 1's: 10000000, 2's: 10000001

10. . Integer represented as (10011001)₂ in sign and magnitude method

→ -25

11. . Method of representing a floating point number

→ Using IEEE 754 format: 1 sign bit, 8 exponent bits, 23 mantissa bits.

12. . Methods of representing characters

→ ASCII, EBCDIC, Unicode

13. . Significance of Unicode

→ It can represent characters from all major writing systems worldwide.

14. . Matching logic functions

→ i–b, ii–d, iii–a, iv–c

15. . Duals:
a) X·Y + Z

→ a) X + Y · Z

b) A·C + A·B + A·C

→ b) A + C · A + B · A + C

c) (A + B)·(A + B + A)

→ c) (A · B) + (A · B · A)

16. . Complements:
a) AB

→ a' + b'

b) A·B + C·D

→ (A'+B') · (C'+D')

17. . Logic Circuits

→ Draw circuits using gates for the given expressions.

18. . Why NAND/NOR are universal?

→ Because any logic gate (AND, OR, NOT) can be implemented using only NAND or only
NOR gates.

Long Answer Type

19. . Briefly explain different methods for representing numbers in computer memory.

In computers, numbers are stored using binary (0s and 1s). There are different methods
for representing numbers based on whether they are integers or real (decimal) numbers.

1. Sign and Magnitude Method:

 The leftmost bit is used as the sign bit (0 for positive, 1 for negative).
 The remaining bits represent the magnitude (absolute value) of the number.
 Example: +5 = 0101, –5 = 1101 (in 4-bit representation).

2. 1's Complement Method:

  Positive numbers are the same as binary.
 Negative numbers are formed by inverting all bits of the positive number.
 Example: +5 = 0101, –5 = 1010 (1's complement of 0101).

3. 2's Complement Method:

 Similar to 1’s complement, but after inverting, add 1.

 This method is widely used in computers.
 Example: +5 = 0101, –5 = 1011 (invert 0101 → 1010, then add 1 → 1011).

4. Floating Point Representation:

 Used for real numbers (like 3.14, –0.001).

 Stored in the format: Sign bit | Exponent | Mantissa (based on IEEE 754
standard).
 It allows very large or very small values to be stored efficiently.

5. BCD (Binary Coded Decimal):

 Each decimal digit is represented by a 4-bit binary number.

 Example: 59 = 0101 1001 in BCD (5 = 0101, 9 = 1001).

20. . Briefly explain different methods for representing characters in computer memory.

Characters such as letters, digits, and symbols are stored in computer memory using
binary codes. Several coding systems are used for this purpose:

1. ASCII (American Standard Code for Information Interchange):

 It uses 7 bits to represent characters (can represent 128 characters).

 Includes uppercase and lowercase letters, digits, punctuation marks, and control
characters.
 Example: 'A' = 65, 'a' = 97, '0' = 48.

2. Extended ASCII:

 Uses 8 bits (1 byte), allowing 256 characters.

 It includes all standard ASCII characters and extra symbols like graphical and
special characters.

3. EBCDIC (Extended Binary Coded Decimal Interchange Code):

 Developed by IBM, uses 8 bits.

 Mainly used in mainframe computers.
 Not compatible with ASCII.
4. Unicode:

 A universal coding system that can represent characters from all human
languages.
 Common formats:
o UTF-8 (1 to 4 bytes per character),
o UTF-16 (2 or 4 bytes),
o UTF-32 (4 bytes).
 Example: 'A' = U+0041, 'क' = U+0915.

5. ISCII (Indian Script Code for Information Interchange):

 Developed for representing Indian languages like Hindi, Tamil, Malayalam, etc.
 Supports various Indian scripts under a single standard.

21. . What are the file formats for storing image, sound and video data?

Different types of media data—images, sounds, and videos—are stored using specific file
formats. These formats help in organizing, compressing, and retrieving data efficiently.

1. Image File Formats:

 JPEG (.jpg or .jpeg):

o Widely used for photos and web images.
o Compressed format; reduces file size with some quality loss.
 PNG (.png):
o Supports transparency and lossless compression.
o Used in web graphics and digital art.
 GIF (.gif):
o Supports simple animations.
o Limited to 256 colors.
 BMP (.bmp):
o Uncompressed format.
o High quality, but large file size.

2. Sound File Formats:

 MP3 (.mp3):
o Popular compressed audio format.
o Small file size with good sound quality.
 WAV (.wav):
o Uncompressed format used in high-quality audio.
 o Large file size.
 AAC (.aac):
o Better sound quality than MP3 at similar bitrates.
o Used by Apple devices.
 FLAC (.flac):
o Lossless compression.
o Preserves original sound quality.

3. Video File Formats:

 MP4 (.mp4):
o Most common video format.
o Supports high compression with good quality.
o Supports audio, video, and subtitles.
 AVI (.avi):
o Developed by Microsoft.
o Less compressed, so file size is larger.
 MKV (.mkv):
o Open-source format that supports multiple audio and subtitle tracks.
o Suitable for high-definition videos.
 MOV (.mov):
o Developed by Apple.
o Commonly used in Mac devices.

22. Give logic symbol, Boolean expression and truth table for three-input AND gate.
The Three-input AND gate have three inputs. The AND gate can be cascaded together to
form any number of individual inputs. There are total of 23=8 combinations of inputs
possible. The Boolean expression of logic AND gate is defined as the binary operation
dot(.)
Boolean expression X=A.B.C
23. . Prove that NOR gate is a universal gate by implementing all the basic gates.

NAND Gate
The truth table and symbol of the NAND gate is as shown below. The two inputs are A
and B.
NAND Gate as OR Gate

NAND Gate as AND Gate

NOR Gate

The truth table and symbol of the NOR gate is as shown below.
NOR Gate as NOT Gate

NOR Gate as OR Gate

NOR Gate as AND Gate

The above diagrams makes it clear that the combination of NAND and NOR Gates can result
into any of the basic gates (AND, OR and NOT Gates). Hence, NAND and NOR Gates are called
as Universal Gates