Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Assuming all numbers are in 2’s complem...
Start Learning for Free
Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?
- a)11100111
- b)11100100
- c)11010111
- d)11011011
Correct answer is option 'A'. Can you explain this answer?
Verified Answer
Assuming all numbers are in 2’s complement representation, which...
MSB of 2's compliment number has a weight of - 2^(n-1).
(Trick: (from reversing sign extension) just skip all leading 1's from MSB expect but 1, and then calculate the value as normal signed binary rep. ) so by calculating, we get the given number is -5 in decimal. and options are
a. -25
b. -28
c. -41
d. -37
Therefore it is clear that - 25 is divisible by - 5. so we can say that (a.) is correct.
(Trick: (from reversing sign extension) just skip all leading 1's from MSB expect but 1, and then calculate the value as normal signed binary rep. ) so by calculating, we get the given number is -5 in decimal. and options are
a. -25
b. -28
c. -41
d. -37
Therefore it is clear that - 25 is divisible by - 5. so we can say that (a.) is correct.
Most Upvoted Answer
Assuming all numbers are in 2’s complement representation, which...
Solution:
To check whether a number is divisible by another number, we can simply divide the number and check if the remainder is zero. However, in this case, dividing a number by 11111011 is not practical, so we need to use a different approach.
We can use the fact that a number is divisible by 11111011 if and only if it is divisible by its complement, which is 00000101. Therefore, we need to check whether the given numbers are divisible by 00000101.
To check whether a number is divisible by 00000101, we can use the following algorithm:
1. Take the number and complement it by flipping all its bits.
2. Add 1 to the complement to get the two's complement of the number.
3. Add the two's complement to the original number.
4. Check if the result is divisible by 2. If it is, then the original number is divisible by 00000101.
Let's apply this algorithm to the given numbers:
a) 11100111
Complement: 00011000
Two's complement: 00011001
Sum: 11111100
11111100 is divisible by 2, therefore 11100111 is divisible by 00000101.
b) 11100100
Complement: 00011011
Two's complement: 00011100
Sum: 11100000
11100000 is not divisible by 2, therefore 11100100 is not divisible by 00000101.
c) 11010111
Complement: 00101000
Two's complement: 00101001
Sum: 11100000
11100000 is not divisible by 2, therefore 11010111 is not divisible by 00000101.
d) 11011011
Complement: 00100100
Two's complement: 00100101
Sum: 11100000
11100000 is not divisible by 2, therefore 11011011 is not divisible by 00000101.
Therefore, the only number that is divisible by 11111011 is 11100111 (option A).
To check whether a number is divisible by another number, we can simply divide the number and check if the remainder is zero. However, in this case, dividing a number by 11111011 is not practical, so we need to use a different approach.
We can use the fact that a number is divisible by 11111011 if and only if it is divisible by its complement, which is 00000101. Therefore, we need to check whether the given numbers are divisible by 00000101.
To check whether a number is divisible by 00000101, we can use the following algorithm:
1. Take the number and complement it by flipping all its bits.
2. Add 1 to the complement to get the two's complement of the number.
3. Add the two's complement to the original number.
4. Check if the result is divisible by 2. If it is, then the original number is divisible by 00000101.
Let's apply this algorithm to the given numbers:
a) 11100111
Complement: 00011000
Two's complement: 00011001
Sum: 11111100
11111100 is divisible by 2, therefore 11100111 is divisible by 00000101.
b) 11100100
Complement: 00011011
Two's complement: 00011100
Sum: 11100000
11100000 is not divisible by 2, therefore 11100100 is not divisible by 00000101.
c) 11010111
Complement: 00101000
Two's complement: 00101001
Sum: 11100000
11100000 is not divisible by 2, therefore 11010111 is not divisible by 00000101.
d) 11011011
Complement: 00100100
Two's complement: 00100101
Sum: 11100000
11100000 is not divisible by 2, therefore 11011011 is not divisible by 00000101.
Therefore, the only number that is divisible by 11111011 is 11100111 (option A).
Free Test
FREE
| Start Free Test |
Community Answer
Assuming all numbers are in 2’s complement representation, which...
11100111
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Top Courses for Computer Science Engineering (CSE)View all
Question Description
Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer?.
Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2025 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2025 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer?.
Solutions for Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer?, a detailed solution for Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? has been provided alongside types of Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Assuming all numbers are in 2’s complement representation, which of the following numbers is divisible by 11111011?a)11100111b)11100100c)11010111d)11011011Correct answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup