Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations

Phrases Previous Year Questions (PYQs)

Phrases 1s Complement 2s Complement PYQ


Phrases PYQ
Consider a 9-bit representation. Which of the following correctly gives the smallest number that can be represented in: 
(i) 1's complement, 
(ii) 2's complement





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2025 PYQ

Solution

For an n-bit system:

  • 1’s complement range: $-(2^{n-1}-1)$ to $+(2^{n-1}-1)$ ⇒ smallest $=-(2^{8}-1)={-255}$.
  • 2’s complement range: $-2^{n-1}$ to $+(2^{n-1}-1)$ ⇒ smallest $=-2^{8}={-256}$.

(9-bit means sign + 8 magnitude bits.)


Phrases PYQ
Which of the following is the representation of decimal number (- 147) in 2's compliment notation on a 12-bit machine?





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2017 PYQ

Solution


Phrases PYQ
The smallest integer that can be represented by an 8 bit number in 2's complement form is





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2017 PYQ

Solution

✅ Given Information:

An 8-bit number in 2's complement form can represent values from \(-2^{n-1}\) to \(2^{n-1} - 1\).

✅ Step 1: Calculate the smallest integer:

Smallest value = \(-2^{8-1} = -2^7 = -128\)

✅ Final Answer:

The smallest integer that can be represented by an 8-bit number in 2's complement form is: -128


Phrases PYQ
What is the 2's complement of 0011 0101 1001 1100?





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2014 PYQ

Solution


Phrases PYQ
What is the 8 bit 2's complement representation of the negative integer-93?





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2014 PYQ

Solution


Phrases PYQ
The maximum and minimum value represented in signed 16-bit 2s compliment representation are





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2023 PYQ

Solution

 Maximum & Minimum in 16-bit 2's Complement

 Total Bits: 16

Format: 1 sign bit + 15 magnitude bits

  • Maximum (positive): 0111 1111 1111 1111(2) = +32,767
  • Minimum (negative): 1000 0000 0000 0000(2) = −32,768

✅ Final Answer:
Minimum = −32,768
Maximum = +32,767


Phrases PYQ
If N is a 16-bit signed integer, then 2's complement representation of N is (F87B)16. The 2's complement representation of 8*N is





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2019 PYQ

Solution


Phrases PYQ
In an 8 bit representation of computer system the decimal number 47 has to be subtracted from 38 and the result in binary 2's complement is _________






Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2019 PYQ

Solution


Phrases PYQ
A computer with a 32 bit word size uses 2’s complement to represent numbers. The range of integers that can be represented by this computer is:





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2009 PYQ

Solution

In $n$-bit 2’s complement, range is $-2^{n-1}$ to $2^{n-1}-1$.

Phrases PYQ
When two binary numbers are added, then an overflow will never occur if





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2011 PYQ

Solution

Overflow never occurs when carry into sign bit = carry out of sign bit.

Phrases PYQ
Consider the following 4- bit binary numbers represented in the 2’s complement form : 1101 and 0100 What would be the result when we add them?





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2024 PYQ

Solution

2's Complement Addition (4-bit)

Given: 1101 and 0100 (in 2’s complement)

Step-by-step:

  • 1101 = −3 (in decimal)
  • 0100 = +4 (in decimal)
  • Sum = −3 + 4 = +1
  • +1 in 4-bit 2’s complement = 0001

✅ Final Answer: 0001


Phrases PYQ
Given that numbers A and B are two 8 bit 2’s complement numbers with A = 11111111, B = 11111111. Then sum A + B is _________





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2024 PYQ

Solution

2's Complement Addition (8-bit)

Given:

  • A = 11111111 → (−1)
  • B = 11111111 → (−1)

Sum: −1 + (−1) = −2

Convert −2 to 8-bit 2's complement:

  • +2 = 00000010
  • Invert = 11111101
  • Add 1 = 11111110

✅ Final Answer: 11111110


Phrases PYQ
Let the given number 11001, 1001 and 111001 be correspond to the 2’s complement representation. Then with which one of the following decimal number, the given numbers match





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2024 PYQ

Solution

Binary to Decimal: 2's Complement Conversion

Given binary numbers:

  • 11001 (5-bit)
  • 1001 (4-bit)
  • 111001 (6-bit)

Step-by-step (2's complement):

  • Each starts with 1 → negative number
  • Convert by inverting and adding 1
  • All result in binary 0111 → decimal 7
  • So final value = −7

✅ Final Answer: Each binary number corresponds to the decimal number −7.




Phrases PYQ
The maximum and minimum value represented in signed 16 bit 2's complement representations are





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2022 PYQ

Solution

Range of 2's complement $-2^{n-1}$ to $2^{n-1}+1$

Range for 16 bits = $-2^{16-1}$ to $2^{16-1}+1$

Range for 16 bits = $-2^{15}$ to $2^{25}+1$

Range for 16 bits = $-32768$ to $32767$

Phrases PYQ
The 2's complement representation of the number (–100)10 in an 8 bit computer is





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2016 PYQ

Solution


Phrases PYQ
Subtract (1010)2 from (1101)using first complement





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2016 PYQ

Solution


Phrases PYQ
The range of n-bit signed magnitude representation is





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2016 PYQ

Solution

For an $n$-bit Signed Magnitude Representation:
The leftmost bit (MSB) is the sign bit:
$0 \rightarrow$ Positive
$1 \rightarrow$ Negative
Remaining $(n-1)$ bits represent the magnitude
Maximum positive value:
Sign bit $= 0$, remaining $(n-1)$ bits all $1$s
$\Rightarrow +(2^{n-1} - 1)$
Maximum negative value:
Sign bit $= 1$, remaining $(n-1)$ bits all $1$s
$\Rightarrow -(2^{n-1} - 1)$
Note: $+0$ and $-0$ both exist in signed magnitude representation
$\therefore$ Range of $n$-bit Signed Magnitude Representation is:
$\therefore \boxed{-(2^{n-1}-1) \leq x \leq +(2^{n-1}-1)}$

Phrases PYQ
The addition of 4 bit, 2’s complement binary numbers 1101 and 0100 results in





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2008 PYQ

Solution

1101 is a 4-bit 2’s complement number.
Its MSB is 1, so it is negative.

1101 = −3
0100 = +4

Adding:
1101
+0100
=10001

Taking only 4 bits → 0001

Phrases PYQ
Let A = 11111010 and B = 00001010 be two 8 bit 2’s complement numbers. Their product in 2’s complement is





Go to Discussion

Phrases Previous Year PYQ Phrases NIMCET 2008 PYQ

Solution

A = 11111010 → −6
B = 00001010 → +10

Product = −60

+60 in binary = 00111100
2’s complement of 00111100 = 11000100


Phrases


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Phrases


Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

Limited Seats
× Aspire MCA Promotion

Game Changer NIMCET Test Series 2026

Boost your preparation with mock tests, analysis and rank-focused practice.

JOIN NOW
Ask Your Question or Put Your Review.

loading...