Which one of the following is decimal value of a signed binary number 1101010, if it is in 2's complement form? (A) -42 (B) - 22 (C) -21 (D) -106

1 Answer

Answer :

(B) - 22

Related questions

Description : When signed numbers are used in binary arithmetic, then which one of the following notations would have unique representation for zero. (A) Sign-magnitude. (B) 1’s complement. (C) 2’s complement. (D) 9’s complement.

Last Answer : (A) Sign-magnitude.

Description : The Excess-3 decimal code is a self-complementing code because (A) The binary sum of a code and its 9’s complement is equal to 9. (B) It is a weighted code. (C) Complement can be generated by inverting each bit pattern. (D) The binary sum of a code and its 10’s complement is equal to 9.

Last Answer : Answer: A, C

Description : Which of the following is the most efficient to perform arithmetic operations on the numbers? (A) Sign-magnitude (B) 1’s complement (C) 2’s complement (D) 9’s complement

Last Answer : (C) 2’s complement

Description : Which are the types of binary codes number: a. Sign magnitude b. —_1’s complement code c. 2’s complement code d. __ Allof these

Last Answer : c. 2’s complement code

Last Answer : 2's complement of binary number 0101 is 1011.

Description : Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns

Last Answer : (C) 30 ns

Description : Convert the binary equivalent 10101 to its decimal equivalent. a) 21 b) 12 c) 22 d) 31

Last Answer : Answer: a Explanation: To convert a binary number to its decimal equivalent follow these steps : 2 4 * 1 + 23 * 0 + 22 *1 + 21 * 0 + 20 * 1 = 21. Therefore, the answer is 21

Description : The number of different binary trees with 6 nodes is ............. (A) 6 (B) 42 (C) 132 (D) 256

Last Answer : (C) 132

Description : Which are the types of addition in the 2’s complement system: a. Both number positive b. A Positive number and a smaller negative number c. Anegative number and a smaller positive number

Last Answer : b. A Positive number and a smaller negative number

Description : Which are the types of important ideas to notice about these odometer readings: a. The MSB is the sign bit .O for a +sign and 1 for a— sign b. The negative number represent the 2’s complement of the positive number c. Both d. __ Allof these

Last Answer : c. Both

Description : The 2’s complement of the number 1101110 is (A) 0010001. (B) 0010001. (C) 0010010. (D) None.

Last Answer : Ans: C 1’s complement of 1101110 is = 0010001 Thus 2’s complement of 1101110 is = 0010001 + 1 = 0010010

Description : The 2’s complement of the number 1101101 is (A) 0101110 (B) 0111110 (C) 0110010 (D) 0010011

Last Answer : (D) 0010011 Ans: D The 2’s complement of the number 1101101 is 0010011 (1’s complement of the number 1101101 is 0010010 2’s complement of the number 1101101is 0010010 + 1 =0010011)

Last Answer : A four bit number is given as 0110. Its 2’s complement is 1010.

Description : The 2’s complement of 15 is ____________ a) 0000 b) 0001 c) 0010 d) 0100

Last Answer : Answer: b Explanation: 2’s complement is obtained by adding 1 to the 1’s complement of the number. Here, Binary of 15 = 1111 1’s complement of 15= 0000 2’s complement of 15= 0000+1=0001

Description : How many types of addition in the 2’s complement system. a. 3 b 4 c. 5 d. 6

Last Answer : b 4

Description : What is the 2's complement of 01101? A) 10010 B) 10011 C) 1100 D) 1001 

Last Answer : What is the 2's complement of 01101? A) 10010 B) 10011 C) 1100 D) 1001 

Description : 2’s complement of 1101100 is (A) 0010101 (B) 0010100 (C) 0010011 (D) 1010011

Last Answer : 2’s complement of 1101100 is 0010100

Description : 11001, 1001 and 111001 correspond to the 2’s complement representation of which one of the following sets of number?  (1) 25, 9 and 57 respectively (2) –6, –6 and –6 respectively (3) –7, –7 and –7 respectively (4) –25, –9 and –57 respectively

Last Answer : -7, -7, -7 

Description : FTP server listens to connections on port ……………………. A) 19 and 20 B) 20 and 21 C) 21 and 22 D) 20 and 22

Last Answer : B) 20 and 21

Description : What is the output when following code is executed ? names1 = ['Amir', 'Bear', 'Charlton', 'Daman'] names2 = names1 names3 = names1[:] names2[0] = 'Alice' names3[1] = 'Bob' sum = 0 for ls in (names1, names2, names3): ... if ls[1] == 'Bob': sum += 10 print sum a) 11 b) 12 c) 21 d) 22

Last Answer : d) 22

Description : The ball bearing is subjected to a radial load of 4000 N. Expected life for 90% bearings is 9000 hr and the shaft is rot (a) 42.21 kN (b) 37.29 kN (c) 26.33 kN (d) 35.22 kN

Last Answer : (b) 37.29 kN

Description : The decimal equivalent of Binary number 10101 is (A) 21 (B) 31 (C) 26 (D) 28

Last Answer : (A) 21

Description : The size of the ROM required to build an 8-bit adder/subtractor with mode control, carry input, carry output and two’s complement overflow output is given as

Last Answer : (B) 218 × 10

Description : The regular expression for the complement of the language L = {anbm|n≥4, m≤3} is: (A) (λ + a + aa + aaa)b* + a*bbbb* + (a + b)*ba(a + b)* (B) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ab(a + b)* (C) (λ + a ... *bbbbb* + (a + b)*ab(a + b)* (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Last Answer : (D) (λ + a + aa + aaa)b* + a*bbbbb* + (a + b)*ba(a + b)*

Description : What kind of music do you like -What is the relative frequency of students who like POP music. Leave your answer as a decimal and round to the hundredths place. 24 people like pop music 10 people like dance 22 people like hip-hop / rap 21.?

Last Answer : I like hiphop music and i would probably say something like 70% of people like pop

Description : Convert binary 110001100101 to octal. 106) A) 45778 B) 72458 C) 61458 D) 143118

Last Answer : C) 61458

Description : If X is a binary number which is power of 2, then the value of X&(X-1) is: (1) 11....11 (2) 00.....00 (3) 100.....0 (4) 000.....1

Last Answer : Answer: 2

Description : State True or False. i) While overloading operators new operator can be overloaded. ii) The binary operator such as +, -, * and must explicitly return a value. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

Description : Using p=3, q=13, d=7 and e=3 in the RSA algorithm, what is the value of ciphertext for a plain text 5? (A) 13 (B) 21 (C) 26 (D) 33

Last Answer : Answer: Marks to all Explanation: p=3, q=13, d=7, e=3, M=5, C=? C = Me mod n n = p*q  = 3*13 = 39 C = 53 mod 39 = 8 Answer is 8.

Description : The terminal value in year 6 is closest to __________. a) Rs.22.57 b) Rs.20.42 c) Rs.24.30 d) Rs.25.70

Last Answer : a) Rs.22.57

Description : 1’s complement representation of decimal number of -17 by using 8 bit representation is (A) 1110 1110 (B) 1101 1101 (C) 1100 1100 (D) 0001 0001

Last Answer : (A) 1110 1110

Description : A disk drive has 100 cylinders, numbered 0 to 99. Disk requests come to the disk driver for cyclinders 12, 26, 24, 4, 42, 8 and 50 in that order. The driver is currently serving a request at cyclinder 24. A seek takes ... (SSTF) algorithm? (A) 0.984 sec (B) 0.396 sec (C) 0.738 sec (D) 0.42 sec

Last Answer : C

Description : The number of distinct binary images which can be generated from a given binary image of right M × N are (A) M + N (B) M × N (C) 2M + N (D) 2MN

Last Answer : (D) 2MN

Description : In a binary Hamming code the number of check digits is r then number of message digits is equal to: (A) 2r-1 (B) 2r-r-1 (C) 2r-r+1 (D) 2r+r-1

Last Answer : (B) 2r-r-1

Description : Suppose that we have numbers between 1 and 1000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 221, 912, 245, 899, ... 926, 203, 912, 241, 913, 246, 364 (D) 3, 253, 402, 399, 331, 345, 398, 364 

Last Answer : (C) 926, 203, 912, 241, 913, 246, 364

Description : which shift is used for signed binary number: a. Logical b. Arithmetic c. Both d. None of these

Last Answer : b. Arithmetic

Description : -8 is equal to signed binary number (A) 10001000 (B) 00001000 (C) 10000000 (D) 11000000

Last Answer : (A) 10001000

Description : Which binary value equals 22? 84) A) 0100 B) 0001 C) 0010 D) 0011

Last Answer : A) 0100

Description : Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ? (A) 22 / 36 (B) 12 / 36 (C) 14 / 36 (D) 6 / 36

Last Answer : (C) 14 / 36 

Description : Which binary value equals 21? 65) A) 0100 B) 0010 C) 0001 D) 1000

Last Answer : B) 0010

Description : Value of sampled signal is used to produce a A. binary number B. decimal number C. octal number D. all of above

Last Answer : binary number

Description : Consider the following three SQL queries (Assume the data in the people table) : (a) Select Name from people where Age>21; (b) Select Name from people where Height>180; (c) Select Name from people where (Age>21) or (Height ... number of rows returned by the SQL query (c) ? (A) 3 (B) 7 (C) 10 (D) 21

Last Answer : (C) 10

Description : What is the difference between linear and binary search?

Last Answer : A: Linear search does not require the array to be sorted, whereas, binary search requires that the array be sorted. Linear search checks for the search item in a linear fashion from the beginning cell till the end, ... tell what is control variable in your loop. So if your loop is for(int i = 1; i

Description : When does Binary search fail?

Last Answer : A: When the array is not sorted.

Description : The command javac A) Converts a java program into binary code B) Converts a java program into bytecode C) Converts a java program into machine language D) None of the above.

Last Answer : B) Converts a java program into bytecode

Description : In general, the binary search method needs no more than ……………. comparisons. A) [log2n]-1 B) [logn]+1 C) [log2n] D) [log2n]+1

Last Answer : D) [log2n]+1

Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Last Answer : D) True, True

Description : In ……………, search start at the beginning of the list and check every element in the list. A) Linear search B) Binary search C) Hash Search D) Binary Tree search

Last Answer : A) Linear search

Description : State true or false. i) An empty tree is also a binary tree. ii) In strictly binary tree, the outdegree of every node is either o or 2. A) True, False B) False, True C) True, True D) False, False

Last Answer : C) True, True