0% found this document useful (0 votes)
38 views5 pages

Data Representation Boolean Algebra Solved

The document contains solved questions on data representation and Boolean algebra, covering topics such as number systems, logical statements, and methods of representing data in computer memory. It includes very short answer type questions, short answer type questions, and long answer type questions with specific examples and conversions. Key concepts discussed include binary, octal, hexadecimal systems, logic gates, and the significance of Unicode.

Uploaded by

reshmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
38 views5 pages

Data Representation Boolean Algebra Solved

The document contains solved questions on data representation and Boolean algebra, covering topics such as number systems, logical statements, and methods of representing data in computer memory. It includes very short answer type questions, short answer type questions, and long answer type questions with specific examples and conversions. Key concepts discussed include binary, octal, hexadecimal systems, logic gates, and the significance of Unicode.

Uploaded by

reshmi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

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. 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. 3. Convert the following numbers into the other three number systems:
a) (125)₁₀

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

4. b) 98

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

5. c) (101110)₂

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

6. d) (A23)₁₆

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

7. 4. Convert the following:


a) (71.1)₁₀

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

8. b) (207.13)₁₀

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

9. c) 93.25

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

10. d) (10111011.1101)₂

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

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

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


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

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

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

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

14. 8. Methods of representing integers in computer memory

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

15. 9. Represent using all three methods:


a) -19

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

16. b) +49

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

17. c) -97

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

18. d) -127

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

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

→ -25

20. 11. Method of representing a floating point number

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

21. 12. Methods of representing characters

→ ASCII, EBCDIC, Unicode

22. 13. Significance of Unicode

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

23. 14. Matching logic functions


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

24. 15. Duals:


a) X·Y + Z

→ a) X + Y · Z

25. b) A·C + A·B + A·C

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

26. c) (A + B)·(A + B + A)

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

27. 16. Complements:


a) AB

→ a' + b'

28. b) A·B + C·D

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

29. 17. Logic Circuits

→ Draw circuits using gates for the given expressions.

30. 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 – (Suggested Headings)


31. 1. Briefly explain different methods for representing numbers in computer memory.

→ [Answer to be elaborated based on lesson content or teacher guidance]

32. 2. Briefly explain different methods for representing characters in computer memory.

→ [Answer to be elaborated based on lesson content or teacher guidance]

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

→ [Answer to be elaborated based on lesson content or teacher guidance]

34. 4. Give logic symbol, Boolean expression and truth table for three-input AND gate.

→ [Answer to be elaborated based on lesson content or teacher guidance]


35. 5. Prove that NOR gate is a universal gate by implementing all the basic gates.

→ [Answer to be elaborated based on lesson content or teacher guidance]

You might also like