Gate
Exam
The smallest integer than can be represented by an 8-bit number in 2's complement form is
Option
(A) -256
(B) -128
(C) -127
(D) 0
Read Solution (Total 0)
Gate Other Question
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes?
Option
(A) O(1)
(B) O(log n)
(C) O(n)
(D) O(n log n)
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8) . The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is
Option
(A) 4
(B) 5
(C) 6
(D) 7