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
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
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
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
Description : The Hamming distance between 100 and 001 is ________. A) 2 B) 0 C) 1 D) none of the above
Last Answer : 2
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
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
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
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
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
Description : The Hamming distance between equal codewords is _________. A) 1 B) n C) 0 D) none of the above
Last Answer : 0
Description : Thus hamming code for the ASCII character “a” is given as ……………… A. 10111001111 B. 10111001000 C. 10111001001 D. 10111001
Last Answer : C. 10111001001
Description : The ________ modeprovides synchronizationfor the entire stream of bits must. In other words, it guarantees that the data arrive ata fixed rate. A) synchronous B) asynchronous C) isochronous D) none of the above
Last Answer : isochronous
Description : Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto _____ bits of error. a. t + 1 b. t c. t - 2 d. t / 2
Last Answer : b. t
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
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.
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
Description : The least significant 23 bits in a 48-bit Ethernet address identify a ________. A) multicast router B) host C) multicast group D) noneof the above
Last Answer : multicast group
Description : . ________ is the process in which the receiver tries to guess the message by using redundant bits A. Connection-Oriented Service B. Forward error correction C. both a and b D. Confirm
Last Answer : B. Forward error correction
Description : The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channel capacity. Assuming that processing ... maximum utilization, when the sliding window protocol used is: a. A b. B c. C d. D
Last Answer : c. C
Description : Number of bits per symbol used in Baudot code is a. 7 b. 5 c. 8 d. 9
Description : Which type of Sframe in HDLC exhibit the correspondence of last three bits [N(R)] by defining the negative acknowledgement (NAK) number with the code value of '01'? a. Receive ready b. Receive not ready c. Reject d. Selective Reject
Last Answer : c. Reject
Description : Which of the following summation operations is performed onthe bits to checkanerror-detecting code? A. Codec B. Coder-decoder C. Checksum D. Attenuation
Last Answer : Checksum
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 : Hamming distance between 100101000110 and 110111101101 is (A) 3 (B) 4 (C) 5 (D) 6
Last Answer : (D) 6
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.
Description : When a key is pressed on the keyboard, which standard is used for converting the keystroke into the corresponding bits? A) ANSI B) ASCII C) EBCDIC D) ISO
Last Answer : Answer : A
Description : When a key is pressed on the keyboard,which standard is used for converting the keystroke into the corresponding bits 1) ANSI 2) ASCII 3) EBCDIC 4) ISO
Last Answer : 1) ANSI
Description : When a key is pressed on the keyboard,which standard is used for converting thekeystroke into the corresponding bits 1 ANSI 2 ASCII 3 EBCDIC 4 ISO
Last Answer : 1 ANSI
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
Description : If the Hammingdistancebetweena dataword and the corresponding codewordis three, thereare _____bits in error. A) 3 B) 4 C) 5 D) none of the above
Last Answer : 3
Description : ______ is the cell relay protocol designed by the corresponding Forum and adopted by the ITU-T. A) X.25 B) Frame Relay C) ATM D) none of the above
Last Answer : ATM
Description : Match the following IEEE No to their corresponding Name for IEEE 802 standards for LANs. i) 802.3 a) WiFi ii) 802.11 b) WiMa iii) 802.15.1 c) Ethernet iv) 802.16 d) Bluetooth a. i-b, ii-c, iii-d, iv-a b. i-c, ii-d, iii-a, iv-b c. i-c, ii-a, iii-d, iv-b d. i-b, ii-d, iii-c, iv-a
Last Answer : c. i-c, ii-a, iii-d, iv-b
Description : Which form of byte assigning strategy is adopted in class B type of network corresponding to IP addresses? a. Network.Node.Node.Node b. Network.Network.Node.Node c. Network.Network.Network.Node d. Network.Node.Node.Node
Last Answer : b. Network.Network.Node.Node
Description : Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error? a. G(x) contains more than two terms b. G(x) does ... exceeding the frame length c. 1+x is a factor of G(x) d. G(x) has an odd number of terms
Last Answer : c. 1+x is a factor of G(x)
Description : If in a computer, 16 bits are used to specify address in a RAM, the number of addresses will be a. 216 b. 65,536 c. 64K d. Any of the above
Last Answer : 65,536
Description : In Go-Back-N ARQ, if 5 is the number of bits for thesequencenumber, then the maximum size of the receive window mustbe _____ A) 15 B) 16 C) 31 D) 1
Last Answer : 1
Description : In Go-Back-N ARQ, if 5 is the number of bits for thesequencenumber, then the maximum size of the send window must be _____ A) 15 B) 16 C) 31 D) 1
Last Answer : 31
Description : ______ provides synchronization without increasingthe number of bits. A) Scrambling B) Line coding C) Block coding D) None of the above
Last Answer : Scrambling
Description : The _____ layer uses data compression to reduce the number of bits to be transmitted. a. presentation b. network c. data link d. application
Last Answer : a. presentation
Description : The proper definition of a modern digital computer is a. An electronic automated machine that can solve problems involving words and numbers b. A more sophistic and modified electronic pocket calculator c. Any machine that can perform mathematical operations d. A machine that works on binary code
Last Answer : A machine that works on binary code
Description : A burst error means that two or more bits in the dataunit havechanged. A) double-bit B) burst C) single-bit D) none of the above
Last Answer : burst
Description : Consider a source computer(S) transmitting a file of size 106 bits to a destination computer (D)over a network of two routers (R1 and R2) and three links(L1, L2, and L3). L1connects S to R1; L2 connects R1 to ... file from S to D? a. 1005 ms b. 1010 ms c. 3000 ms d. 3003 ms Answer: Option(a)
Last Answer : a. 1005 ms
Description : How many bytes of data can be sent in 15 seconds over a serial link with baud rate of 9600 in asynchronous mode with odd parity and two stop bits in the frame? a. 10,000 bytes b. 12,000 bytes c. 15,000 bytes d. 27,000 bytes
Last Answer : b. 12,000 bytes
Description : How many 8-bit characters can be transmitted per second over a 9600 baud serial communication link using asynchronous mode of transmission with one start bit, eight data bits, two stop bits, and one parity bit ? a. 600 b. 800 c. 876 d. 1200
Last Answer : b. 800
Description : the storage capacity of a disk system depends on the bits per inch of track and the tracks per inch of a. Cylinder b. Hum c. Cluster d. Surface
Last Answer : Surface
Description : A byte consists of a. One bit b. Four bits c. Eight bits d. Sixteen bits
Last Answer : Eight bits
Description : a computer which CPU speed around 100 million instruction per second and with the word length of around 64 bits is known as a. Super computer b. Mini computer c. Micro computer d. Macro computer
Last Answer : Super computer