1
ITM207 Midterm Exam 30 Questions and 100% Correct
Answers Latest Fall 2025/26 Update -Toronto Metropolitan
University.
1. What’s the 1’s complement of 1000?
a) 0111
b) 1111
c) 111
d) 0001
2. What’s the 2’s complement of the following binary number: 1000
a) 1000
b) 0111
c) 1111
d) 0000 0001
3. What’s the 2’s complement of the binary number 10 using 8 bits?
a) 1111 1110
b) 0000 0001
c) 0000 1101
d) 0000 0010
4. What is the binary representation of the decimal number -1 using 3 bits?
a) 111
b) 000
c) 110
d) 100
5. What would be the binary representation of the decimal number -1.1 using 4 bits? 2 bits to
represent the negative part and 2 bits to represent the fraction part. Total 4 bits.
a) 11.00
b) 10.01
c) 11.11
d) Binary representation of the given number using 5 bits is not possible
6. If A=1, B=1, C=0 then what is the value of the following Boolean expression?
AA’+BB’+ A’B’C
a) 1
b) 0
c) 000001
ITM207 Midterm Exam - TRSM-ITM, TMU
, 2
d) 111110
7. Which of the following Boolean expression will always output 1.
a) (X+X’)YY’
b) (XX’)(YY’)
c) (X+X’)(Y+Y’)
d) (X+X’)’(YY’)’
8. Which of the following Boolean expression is known as De Morgan’s law.
a) (XY)’ = X’+Y’
b) X(Y+Z) = (X+Y)(X+Z)
c) (A+B)’ = A’+ B’
d) (AB)’ = (A+B)’
9. What is the Boolean expression of the following logic circuit diagram.
a) X’Y + (Y’+Z’)
b) (XY)’ + (YZ)’
c) X’Y (Y+Z’)
d) X’Y + (Y+Z)’
10. The truth table of the following Boolean expression is equivalent to which gate?
(A + B)’
a) XNOR
b) XOR
c) NOR
d) NAND
11. If the original text size is 4 byte and the compressed text size is 8 bit then what’s the compression
ratio?
a) 25%
b) 50%
c) 33.33%
d) 66.67%
ITM207 Midterm Exam - TRSM-ITM, TMU
ITM207 Midterm Exam 30 Questions and 100% Correct
Answers Latest Fall 2025/26 Update -Toronto Metropolitan
University.
1. What’s the 1’s complement of 1000?
a) 0111
b) 1111
c) 111
d) 0001
2. What’s the 2’s complement of the following binary number: 1000
a) 1000
b) 0111
c) 1111
d) 0000 0001
3. What’s the 2’s complement of the binary number 10 using 8 bits?
a) 1111 1110
b) 0000 0001
c) 0000 1101
d) 0000 0010
4. What is the binary representation of the decimal number -1 using 3 bits?
a) 111
b) 000
c) 110
d) 100
5. What would be the binary representation of the decimal number -1.1 using 4 bits? 2 bits to
represent the negative part and 2 bits to represent the fraction part. Total 4 bits.
a) 11.00
b) 10.01
c) 11.11
d) Binary representation of the given number using 5 bits is not possible
6. If A=1, B=1, C=0 then what is the value of the following Boolean expression?
AA’+BB’+ A’B’C
a) 1
b) 0
c) 000001
ITM207 Midterm Exam - TRSM-ITM, TMU
, 2
d) 111110
7. Which of the following Boolean expression will always output 1.
a) (X+X’)YY’
b) (XX’)(YY’)
c) (X+X’)(Y+Y’)
d) (X+X’)’(YY’)’
8. Which of the following Boolean expression is known as De Morgan’s law.
a) (XY)’ = X’+Y’
b) X(Y+Z) = (X+Y)(X+Z)
c) (A+B)’ = A’+ B’
d) (AB)’ = (A+B)’
9. What is the Boolean expression of the following logic circuit diagram.
a) X’Y + (Y’+Z’)
b) (XY)’ + (YZ)’
c) X’Y (Y+Z’)
d) X’Y + (Y+Z)’
10. The truth table of the following Boolean expression is equivalent to which gate?
(A + B)’
a) XNOR
b) XOR
c) NOR
d) NAND
11. If the original text size is 4 byte and the compressed text size is 8 bit then what’s the compression
ratio?
a) 25%
b) 50%
c) 33.33%
d) 66.67%
ITM207 Midterm Exam - TRSM-ITM, TMU