12. Consider the addition of two 8-bit 2's complement integers. Which of the following is the binary representation of 6 + (-8)? (A)00000010 (B) 00001110 (C) 11110001 (D)11111110

複選題3.Which of the following about the binary search algorithm is TRUE? (A) It is not possible for a binary search to find the value 2 in the array of [1, 3, 7, 9, 4, 2, 11] (B) The maximum number of comparisons required to perform a binary search of a 1000 element array is 9 (C) The best-case time complexity of a binary search is O(log N), with N the number of elements in an array (D) An iterative implementation of the binary search has a space complexity of O(N), with N the number of elements in an array

12. Consider the addition of two 8-bit 2's complement integers. Which of the following is the binary representation of 6 + (-8)?
(A)00000010
(B) 00001110
(C) 11110001
(D)11111110

相關試題

相關試卷