Computer Sciences > Gate 2024 Set-1 > Digital Logic
Consider a system that uses 5 bitsfor representing signed integers in 2’s complement format. In this system, two integers 𝐴 and 𝐡 are represented as 𝐴=01010 and 𝐡=11010. Which one of the following operations will result in either an arithmetic overflow or an arithmetic underflow?
A
𝐴 + 𝐡
B
𝐴 βˆ’ 𝐡
C
𝐡 βˆ’ 𝐴
D
2 βˆ— 𝐡

Explanation

Correct : a

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