The Gateway to Computer Science Excellence

+25 votes

Best answer

+8 votes

**Explanation:** Here, we have

A = 1111 1010 = – 6_{10} (A is a 2’s complement number)

B = 0000 1010 = 10_{10} (B is a 2’s complement number)

A x B = – 60_{10} = 1 011 1100_{2} = 1 100 0011 (1’s complement) = 1 100 0100 (2’s complement)

Thus, the product of A and B in 2’s complement is 1100 0100, which is option A.

So, A is the correct option

0

for this question wht I did first,simply multiply both numbers and the result which I got 000100111000100

after taking 2's complement of this -2500 came.plz someone verify this.

I long it is taking long time but I want to know my mistake [email protected] @debashish

after taking 2's complement of this -2500 came.plz someone verify this.

I long it is taking long time but I want to know my mistake [email protected] @debashish

+2 votes

In 2's complement form

**A = 11111010 = -128+64+32+16+8+2 = -6**

**B = 00001010 = 10**

Now A* B = -60

**-60 = -128+64+4 =11000100**

**Option : A**

+2 votes

There are sequence of 1's in left side delete all consecutive 1's except last one i.e;(delete four 1's from starting) This is shortcut of finding a decimal number from 2's compliment form

First write +60 in binary (using 8 bit because here all options are in 8 bits)

+60 in binary=00111100

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,385 answers

198,556 comments

105,368 users