Computer Sciences > Gate 2022 > number-representation
Let R1 and R2 be two 4-bit registers that store numbers in 2’s complement form. For the operation R1+R2, which one of the following values of R1 and R2 gives an arithmetic overflow?
A
R1 = 1011 and R2 = 1110
B
R1 = 1100 and R2 = 1010
C
R1 = 0011 and R2 = 0100
D
R1 = 1001 and  R2 = 1111

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science