1
GATE CSE 2016 Set 2
Numerical
+1
-0
Let $$X$$ be the number of distinct $$16$$-bit integers in $$2’s$$ complement representation. Let $$Y$$ be the number of distinct $$16$$-bit integers in sign magnitude representation.
Then $$X −Y$$ is ____________.
Then $$X −Y$$ is ____________.
Your input ____
2
GATE CSE 2016 Set 2
Numerical
+1
-0
Consider an eight-bit ripple-carry adder for computing the sum of $$A$$ and $$B,$$ where $$A$$ and $$B$$ are integers represented in $$2’s$$ complement form. If the decimal value of $$A$$ is one, the decimal value of $$B$$ that leads to the longest latency for the sum to stabilize is __________ .
Your input ____
3
GATE CSE 2016 Set 1
Numerical
+1
-0
The $$16$$-bit $$2’s$$ complement representation of an integer is $$1111$$ $$1111$$ $$1111$$ $$0101;$$ its decimal
representation is ____________.
Your input ____
4
GATE CSE 2014 Set 2
Numerical
+1
-0
Consider the equation $${\left( {123} \right)_5} = {\left( {x8} \right)_y}$$ with $$x$$ and $$y$$ as unknown. The number of possible solutions is _________.
Your input ____
Questions Asked from Number Systems (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2023 (1)
GATE CSE 2022 (1)
GATE CSE 2021 Set 2 (2)
GATE CSE 2021 Set 1 (2)
GATE CSE 2019 (2)
GATE CSE 2016 Set 2 (2)
GATE CSE 2016 Set 1 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2013 (1)
GATE CSE 2010 (1)
GATE CSE 2009 (1)
GATE CSE 2004 (1)
GATE CSE 2003 (1)
GATE CSE 2002 (3)
GATE CSE 2000 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages