Hamming distance between 100101000110 and 110111101101 is (A) 3 (B) 4 (C) 5 (D) 6

Hamming distance between 100101000110 and 110111101101 is (A) 3 (B) 4 (C) 5 (D) 6
by

1 Answer

Answer :

(D) 6
by

Related questions

Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9

Description : Consider a code with five valid code words of length ten : 0000000000, 0000011111, 1111100000, 1110000011, 1111111111 Hamming distance of the code is (A) 5 (B) 10 (C) 8 (D) 9

Last Answer : Answer: Marks to all

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

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

To guarantee correction ofup to 5 errors in all cases, the minimum Hamming distance in a block code must be________. A) 5 B) 6 C) 11 D) none of the above

Description : To guarantee correction ofup to 5 errors in all cases, the minimum Hamming distance in a block code must be________. A) 5 B) 6 C) 11 D) none of the above

Last Answer : 11

To guarantee the detectionof up to 5errors in all cases, the minimum Hamming distance in a block code mustbe _______. A) 5 B) 6 C) 11 D) none of the above

Description : To guarantee the detectionof up to 5errors in all cases, the minimum Hamming distance in a block code mustbe _______. A) 5 B) 6 C) 11 D) none of the above

Last Answer : 6

To guarantee the detection of up to 5 errors in all cases, the minimum Hamming distance in a block code must be _______ A. 5 B. 6 C. 11 D. none of the above

Description : To guarantee the detection of up to 5 errors in all cases, the minimum Hamming distance in a block code must be _______ A. 5 B. 6 C. 11 D. none of the above

Last Answer : B. 6

In block coding, ifn = 5, the maximum Hamming distance between two codewords is ________. A) 2 B) 3 C) 5 D) none of the above

Description : In block coding, ifn = 5, the maximum Hamming distance between two codewords is ________. A) 2 B) 3 C) 5 D) none of the above

Last Answer : 5

The bit positionina can be numbered from 1 through 2h, a. Hamming code word b. Hamming distance word c. Both d. None of these

Description : The bit positionina can be numbered from 1 through 2h, a. Hamming code word b. Hamming distance word c. Both d. None of these

Last Answer : a. Hamming code word

The Hamming distance between 100 and 001 is ________. A) 2 B) 0 C) 1 D) none of the above

Description : The Hamming distance between 100 and 001 is ________. A) 2 B) 0 C) 1 D) none of the above

Last Answer : 2

The Hamming distance between equal codewords is _________. A) 1 B) n C) 0 D) none of the above

Description : The Hamming distance between equal codewords is _________. A) 1 B) n C) 0 D) none of the above

Last Answer : 0

The ________ between two words is the number ofdifferences between corresponding bits. A) Hamming code B) Hamming distance C) Hamming rule D) none of the above

Description : The ________ between two words is the number ofdifferences between corresponding bits. A) Hamming code B) Hamming distance C) Hamming rule D) none of the above

Last Answer : Hamming distance

To guarantee correction of upto t errors, the minimum Hamming distance d min in a block code must be ________. a. t+1 b. t−2 c. 2t−1 d. 2t+1

Description : To guarantee correction of upto t errors, the minimum Hamming distance d min in a block code must be ________. a. t+1 b. t−2 c. 2t−1 d. 2t+1

Last Answer : d. 2t+1

The ________ between two words is the number of differences between corresponding bits A. Hamming code B. Hamming distance C. Hamming rule D. none of the above

Description : The ________ between two words is the number of differences between corresponding bits A. Hamming code B. Hamming distance C. Hamming rule D. none of the above

Last Answer : B. Hamming distance

The Hamming distance between two code-words is

Description : The Hamming distance between two code-words is (A) the number of places the code-words are same (B) same as the Euclidean distance between their decimal representation (C) is maximum of the either code-words (B) the number of places the code-words differ

Last Answer : The Hamming distance between two code-words is the number of places the code-words differ

Is the cyclic redundancy check better than hamming code?

Description : Is the cyclic redundancy check better than hamming code?

Last Answer : It depends on what you are doing.The cyclic redundancy check will only detect an error, while thehamming code can also correct many types of errors. However toperform this correction the extra ... channels, disk sectors).Normally hamming code is done on individual bytes or words ofcomputer memory.

Hamming codes was developed in _ a 1953 b. 1950 c. 1945 d. 1956

Description : Hamming codes was developed in _ a 1953 b. 1950 c. 1945 d. 1956

Last Answer : b. 1950

Error detection ata data link level is achieved by A. bit stuffing B. cyclic redundancy codes C. Hamming codes D. equalization

Description : Error detection ata data link level is achieved by A. bit stuffing B. cyclic redundancy codes C. Hamming codes D. equalization

Last Answer : cyclic redundancy codes

_______ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits. a. Hamming Code b. CRC c. VRC d. None of the above

Description : _______ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits. a. Hamming Code b. CRC c. VRC d. None of the above

Last Answer : b. CRC

Coding schemes can be divided into two broad categories…………, ……A. character coding, integer coding B. hamming coding and block coding C. Hamming coding and convolution coding D. Block Coding and Convolution Coding.

Description : Coding schemes can be divided into two broad categories…………, …… A. character coding, integer coding B. hamming coding and block coding C. Hamming coding and convolution coding D. Block Coding and Convolution Coding.

Last Answer : D. Block Coding and Convolution Coding.

Thus hamming code for the ASCII character “a” is given as ……………… A. 10111001111 B. 10111001000 C. 10111001001 D. 10111001

Description : Thus hamming code for the ASCII character “a” is given as ……………… A. 10111001111 B. 10111001000 C. 10111001001 D. 10111001

Last Answer : C. 10111001001

Water hamming effect is occurs in a) Surge tank b) Penstock c) Turbine d) Reservoir

Description : Water hamming effect is occurs in a) Surge tank b) Penstock c) Turbine d) Reservoir

Last Answer : Ans: Penstock

Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can’t cause right path to be overlooked. (C) Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Description : Which of the following statements is true for Branch-and-Bound search? (A) Underestimates of remaining distance may cause deviation from optimal path. (B) Overestimates can't cause right path to be ... Dynamic programming principle can be used to discard redundant partial paths. (D) All of the above

Last Answer : (C) Dynamic programming principle can be used to discard redundant partial paths.

Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error. (1) t + 1 (2) t (3) t - 2 (4) t/2

Last Answer : (2) t 

Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Description : Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ........... (1) automatically (2) by server (3) by exchanging information with neighbour nodes. (4) with back up database

Last Answer : Answer: 3

main() { Int a=3, b=2, c*d*e; d=&a; e=&b; c=*d+*e; } Which one of the given answers is correct? A) a=4, c-6 B) a=3, c=5 C) a=3, c=6 D) a=3, c=8

Description : main() { Int a=3, b=2, c*d*e; d=&a; e=&b; c=*d+*e; } Which one of the given answers is correct? A) a=4, c-6 B) a=3, c=5 C) a=3, c=6 D) a=3, c=8

Last Answer : B) a=3, c=5

int[ ] ={5,6,7,8,9} What is the value of a[3]? A) 9 B) 8 C) 7 D) 6

Description : int[ ] ={5,6,7,8,9} What is the value of a[3]? A) 9 B) 8 C) 7 D) 6

Last Answer : B) 8

What will be the value of top, if there is a size of stack STACK_SIZE is 5 A) 5 B) 6 C) 4 D) None

Description : What will be the value of top, if there is a size of stack STACK_SIZE is 5 A) 5 B) 6 C) 4 D) None

Last Answer : C) 4

IEEE 802.3ab defines Gigabit Ethernet transmission over unshielded twisted pair (UTP) category 5, 5e or 6 cabling known as .................... A) 1000 BASE-T B) 1000 BASE-SX C) 1000 BASE-LX D) 1000 BASE-CX

Description : IEEE 802.3ab defines Gigabit Ethernet transmission over unshielded twisted pair (UTP) category 5, 5e or 6 cabling known as .................... A) 1000 BASE-T B) 1000 BASE-SX C) 1000 BASE-LX D) 1000 BASE-CX

Last Answer : A) 1000 BASE-T

Maximum font size in HTML is ........... A) 6 B) 7 C) 5 D) 8

Description : Maximum font size in HTML is ........... A) 6 B) 7 C) 5 D) 8

Last Answer : B) 7

What will be the output? >>>my_tuple = (1, 2, 3, 4) >>>my_tuple.append( (5, 6, 7) ) >>>print len(my_tuple) a) 1 b) 2 c) 5 d) Error

Description : What will be the output? >>>my_tuple = (1, 2, 3, 4) >>>my_tuple.append( (5, 6, 7) ) >>>print len(my_tuple) a) 1 b) 2 c) 5 d) Error

Last Answer : c) 5

What is the output of the following? i = 1 while True: if i%2 == 0: break print(i) i += 2 a) 1 Page No 13 b) 1 2 c) 1 2 3 4 5 6 … d) 1 3 5 7 9 11 …

Description : What is the output of the following? i = 1 while True: if i%2 == 0: break print(i) i += 2 a) 1 Page No 13 b) 1 2 c) 1 2 3 4 5 6 … d) 1 3 5 7 9 11 …

Last Answer : d) 1 3 5 7 9 11 …

What is the output of the following? i = 5 while True: if i%0O9 == 0: break print(i) i += 1 a) 5 6 7 8 b) 5 6 7 8 9 c) 5 6 7 8 9 10 11 12 13 14 15 …. d) error

Description : What is the output of the following? i = 5 while True: if i%0O9 == 0: break print(i) i += 1 a) 5 6 7 8 b) 5 6 7 8 9 c) 5 6 7 8 9 10 11 12 13 14 15 …. d) error

Last Answer : d) error

hat is the output of the following? i = 5 while True: if i%0O11 == 0: Page No 12 break print(i) i += 1 a) 5 6 7 8 9 10 b) 5 6 7 8 c) 5 6 d) error

Description : hat is the output of the following? i = 5 while True: if i%0O11 == 0: Page No 12 break print(i) i += 1 a) 5 6 7 8 9 10 b) 5 6 7 8 c) 5 6 d) error

Last Answer : b) 5 6 7 8

What is the output of the following? i = 1 while True: if i%0O7 == 0: break print(i) i += 1 a) 1 2 3 4 5 6 b) 1 2 3 4 5 6 7 c) error d) none of the mentioned

Description : What is the output of the following? i = 1 while True: if i%0O7 == 0: break print(i) i += 1 a) 1 2 3 4 5 6 b) 1 2 3 4 5 6 7 c) error d) none of the mentioned

Last Answer : a) 1 2 3 4 5 6

If A and B are two fuzzy sets with membership functions μA(x) = {0.6, 0.5, 0.1, 0.7, 0.8} μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5} Then the value of μ(A∪B)’(x) will be (A) {0.9, 0.5, 0.6, 0.8, 0.8} (B) {0.6, 0.2, 0.1, 0.7, 0.5} (C) {0.1, 0.5, 0.4, 0.2, 0.2} (D) {0.1, 0.5, 0.4, 0.2, 0.3}

Description : If A and B are two fuzzy sets with membership functions μA(x) = {0.6, 0.5, 0.1, 0.7, 0.8} μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5} Then the value of μ(A∪B)’(x) will be (A) {0.9, 0.5, 0.6, 0.8, 0.8} (B) {0.6, 0.2, 0.1, 0.7, 0.5} (C) {0.1, 0.5, 0.4, 0.2, 0.2} (D) {0.1, 0.5, 0.4, 0.2, 0.3}

Last Answer : (C) {0.1, 0.5, 0.4, 0.2, 0.2}

If A and B are two fuzzy sets with membership functions µA(X) = {0.2, 0.5, 0.6, 0.1, 0.9} µB(X) = {0.1, 0.5, 0.2, 0.7, 0.8} Then the value of µA∩B will be (A) {0.2, 0.5, 0.6, 0.7, 0.9} (B) {0.2, 0.5, 0.2, 0.1, 0.8} (C) {0.1, 0.5, 0.6, 0.1, 0.8} (D) {0.1, 0.5, 0.2, 0.1, 0.8}

Description : If A and B are two fuzzy sets with membership functions µA(X) = {0.2, 0.5, 0.6, 0.1, 0.9} µB(X) = {0.1, 0.5, 0.2, 0.7, 0.8} Then the value of µA∩B will be (A) {0.2, 0.5, 0.6, 0.7, 0.9} (B) {0.2, 0.5, 0.2, 0.1, 0.8} (C) {0.1, 0.5, 0.6, 0.1, 0.8} (D) {0.1, 0.5, 0.2, 0.1, 0.8}

Last Answer : (D) {0.1, 0.5, 0.2, 0.1, 0.8}

The output generated by the LINUX command : $ seq 1 2 10 will be (A) 1 2 10 (B) 1 2 3 4 5 6 7 8 9 10 (C) 1 3 5 7 9 (D) 1 5 10

Description : The output generated by the LINUX command : $ seq 1 2 10 will be (A) 1 2 10 (B) 1 2 3 4 5 6 7 8 9 10 (C) 1 3 5 7 9 (D) 1 5 10

Last Answer : (C) 1 3 5 7 9

Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is : 1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1 The number of page faults in LRU and optimal page replacement algorithms are respectively (without including initial page faults to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Description : Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is :  1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 ... to fill available page frames with pages): (A) 9 and 6 (B) 10 and 7 (C) 9 and 7 (D) 10 and 6

Last Answer : (B) 10 and 7

The BCD adder to add two decimal digits needs minimum of (A) 6 full adders and 2 half adders (B) 5 full adders and 3 half adders (C) 4 full adders and 3 half adders (D) 5 full adders and 2 half adders

Description : The BCD adder to add two decimal digits needs minimum of (A) 6 full adders and 2 half adders (B) 5 full adders and 3 half adders (C) 4 full adders and 3 half adders (D) 5 full adders and 2 half adders

Last Answer : (D) 5 full adders and 2 half adders

Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), (6,1), (11,0.3)} (B) {(2,0.6), (3,1), (6,1), (11,0.3)} (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Description : Suppose the function y and a fuzzy integer number around -4 for x are given as y=(x-3)2+2 Around -4={(2,0.3), (3,0.6), (4,1), (5,0.6), (6,0.3)} respectively. Then f(Around - 4) is given by: (A) {(2,0.6), (3,0.3), ... 6), (3,1), (6,0.6), (11,0.3)} (D) {(2,0.6), (3,0.3), (6,0.6), (11,0.3)}

Last Answer : (C) {(2,0.6), (3,1), (6,0.6), (11,0.3)}

Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by Image (A) {(11,0.8), (13,1), (15,1)} (B) {(11,0.3), (12,0.5), (13,1), (14,1), (15,1), (16,0.5), (17,0.2)} (C) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,1), (16,0.5), (17,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Description : Let A and B be two fuzzy integers defined as: A={(1,0.3), (2,0.6), (3,1), (4,0.7), (5,0.2)} B={(10,0.5), (11,1), (12,0.5)} Using fuzzy arithmetic operation given by (A) {(11,0.8), (13,1), (15,1)} ( ... ,0.2)} (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Last Answer : (D) {(11,0.3), (12,0.5), (13,0.6), (14,1), (15,0.7), (16,0.5), (17,0.2)}

Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states

Description : Minimal deterministic finite automaton for the language L={ 0n | n≥0, n≠4 } will have: (A) 1 final state among 5 states (B) 4 final states among 5 states (C) 1 final state among 6 states (D) 5 final states among 6 states

Last Answer : (D) 5 final states among 6 states

A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty? (A) 6 (B) 7 (C) 5 (D) 8

Description : A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103 if the four frames are initially empty? (A) 6 (B) 7 (C) 5 (D) 8

Last Answer : (B) 7

Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 : SQ1 : Select * From R Full Join S On R.B=S.B; SQ2 : Select * From R Inner Join S On R.B=S.B; The numbers of tuples in the result of the SQL query SQ1 and the SQL query SQ2 are given by : (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively

Last Answer : (D) 4 and 2 respectively

Which of the following 8085 microprocessor hardware interrupt has the lowest priority? (A) RST 6.5 (B) RST 7.5 (C) TRAP (D) INTR

Description : Which of the following 8085 microprocessor hardware interrupt has the lowest priority? (A) RST 6.5 (B) RST 7.5 (C) TRAP (D) INTR 

Last Answer : Answer: D

Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB(x))) Then, f(A+B) is equal to (A) {(0.5,12), (0.6,13), (1,14), (0.7,15), (0.7,16), (1,17), (1,18)} (B) {(0.5,12), (0.6,13), (1,14), (1,15), (1,16), (1,17), (1,18)} (C) {(0.3,12), (0.5,13), (0.5,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Description : Compute the value of adding the following two fuzzy integers: A = {(0.3,1), (0.6,2), (1,3), (0.7,4), (0.2,5)} B = {(0.5,11), (1,12), (0.5,13)} Where fuzzy addition is defined as μA+B(z) = maxx+y=z (min(μA(x), μB( ... ,18)} (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)}

Last Answer : (D) {(0.3,12), (0.5,13), (0.6,14), (1,15), (0.7,16), (0.5,17), (0.2,18)} 

Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Description : Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite automata M. Consider the relation RM defined by M. As all states are reachable from the start state, RM has ................ equivalence classes. (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (D) 6

Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). Consider the following three lines for clipping with the given end point co-ordinates: Line AB: A(-6,2) and B(-1,8) Line CD: C(-1,5) and D(4,8) Line EF: E(-2,3) and F(1,2) Which of the following line(s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Description : Let R be the rectangular window against which the lines are to be clipped using 2D Sutherland-Cohen line clipping algorithm. The rectangular window has lower left-hand corner at (-5,1) and upper righthand corner at (3,7). ... s) is/are candidate for clipping? (A) AB (B) CD (C) EF (D) AB and CD

Last Answer : (D) AB and CD

A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below? Image (A) 2 (B) 4 (C) 5 (D) 6

Description : A clique in a simple undirected graph is a complete subgraph that is not contained in any larger complete subgraph. How many cliques are there in the graph shown below?  (A) 2 (B) 4 (C) 5 (D) 6

Last Answer : (C) 5

Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < x < 5. (A) B, A, D, E, C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Description : Five jobs A, B, C, D and E are waiting in Ready Queue. Their expected runtimes are 9, 6, 3, 5 and x respectively. All jobs entered in Ready queue at time zero. They must run in ............. order to minimize average response time if 3 < ... , C (B) C, E, D, B, A (C) E, D, C, B, A (D) C, B, A, E, D

Last Answer : (B) C, E, D, B, A