We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called _________ A. datawords B. blockwords C. codewords D. none of the above

We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are
called _________
A. datawords
B. blockwords
C. codewords
D. none of the above
by

1 Answer

Answer :

C. codewords
by

Related questions

We addr redundant bits toeach block to make thelength n = k + r. The resultingn-bit blocksare called _________. A) datawords B) blockwords C) codewords D) none of the above

Description : We addr redundant bits toeach block to make thelength n = k + r. The resultingn-bit blocksare called _________. A) datawords B) blockwords C) codewords D) none of the above

Last Answer : codewords

In _____coding, we divideour message into blocks, each of k bits, called ___. A) block; blockwords B) linear; datawords C) block; datawords D) none of the above

Description : In _____coding, we divideour message into blocks, each of k bits, called ___. A) block; blockwords B) linear; datawords C) block; datawords D) none of the above

Last Answer : block; datawords

In block coding, if k =2 and n =3, we have _______ invalid codewords. A) 8 B) 4 C) 2 D) none of the above

Description : In block coding, if k =2 and n =3, we have _______ invalid codewords. A) 8 B) 4 C) 2 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

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

In a linear block code, the_______ ofany two valid codewords creates another valid codeword. A) XORing B) ORing C) ANDing D) none of the above

Description : In a linear block code, the_______ ofany two valid codewords creates another valid codeword. A) XORing B) ORing C) ANDing D) none of the above

Last Answer : XORing

. ________ is the process in which the receiver tries to guess the message by using redundant bits A. Connection-Oriented Service B. Forward error correctionC. both a and b D. Confirm

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

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 channelcapacity. Assuming that processing delay is negligible, the minimum number of bits for the sequence number field in a frame for maximum utilization, when the sliding window protocol used is: a. A b. B c. C d. D

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

The ______ technique expands the bandwidthof a signal by replacing each data bit with n bits. A) FDM B) DSSS C) FHSS D) TDM

Description : The ______ technique expands the bandwidthof a signal by replacing each data bit with n bits. A) FDM B) DSSS C) FHSS D) TDM

Last Answer : DSSS

Which error detection method consists of just one redundant bit per data unit? A) Simple parity check B) Two-dimensionalparity check C) CRC D) Checksum

Description : Which error detection method consists of just one redundant bit per data unit? A) Simple parity check B) Two-dimensionalparity check C) CRC D) Checksum

Last Answer : Simple parity check

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 not divide 1+x^k, for any k not exceeding the frame length c. 1+x is a factor of G(x) d. G(x) has an odd number of terms

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)

In______ transmission, wesend1 start bit (0) at thebeginningand 1 or more stop bits (1s) at the end of each byte. A) synchronous B) asynchronous C) isochronous D) none of the above

Description : In______ transmission, wesend1 start bit (0) at thebeginningand 1 or more stop bits (1s) at the end of each byte. A) synchronous B) asynchronous C) isochronous D) none of the above

Last Answer : asynchronous

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

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

DES works by using a. permutation and substitution on 64 bit blocks of plain text b. only permutations on blocks of 128 bits c. exclusive ORing key bits with 64 bit blocks d. 4 rounds of substitution on 64 bit blocks with 56 bit keys

Description : DES works by using a. permutation and substitution on 64 bit blocks of plain text b. only permutations on blocks of 128 bits c. exclusive ORing key bits with 64 bit blocks d. 4 rounds of substitution on 64 bit blocks with 56 bit keys

Last Answer : a. permutation and substitution on 64 bit blocks of plain text 

_______ isnormally referred toas mB/nB coding; it replaceseach m-bit group with an n-bit group. A) Block coding B) Line coding C) Scrambling

Description : _______ isnormally referred toas mB/nB coding; it replaceseach m-bit group with an n-bit group. A) Block coding B) Line coding C) Scrambling

Last Answer : Block coding

A byte consists of a. One bit b. Four bits c. Eight bits d. Sixteen bits

Description : A byte consists of a. One bit b. Four bits c. Eight bits d. Sixteen bits

Last Answer : Eight bits

A byte consists of a. One bit b. Four bits c. Eight bits d. Sixteen bits

Description : A byte consists of a. One bit b. Four bits c. Eight bits d. Sixteen bits

Last Answer : Eight bits

A band is always equivalent to a. a byte b. a bit c. 100 bits d. none of above

Description : A band is always equivalent to a. a byte b. a bit c. 100 bits d. none of above

Last Answer : none of above

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

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

In IPv6,a _________address comprises 80 bits of zero, followed by16 bitsof one, followed by the 32-bit IPv4address. A) link local B) site local C) mapped D) none of the above

Description : In IPv6,a _________address comprises 80 bits of zero, followed by16 bitsof one, followed by the 32-bit IPv4address. A) link local B) site local C) mapped D) none of the above

Last Answer : mapped

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

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

A 8-Mbps tokenring has atoken holding timer value of 10 msec. What is the longest frame (assumeheader bits are negligible) that canbe sent on this ring? A. 8000 B frame B. 80,000 B frame C. 8 x 105 bit frame D. 10,000 B frame

Description : A 8-Mbps tokenring has atoken holding timer value of 10 msec. What is the longest frame (assumeheader bits are negligible) that canbe sent on this ring? A. 8000 B frame B. 80,000 B frame C. 8 x 105 bit frame D. 10,000 B frame

Last Answer : 10,000 B frame

Suppose that the one-way propagation delay for a 100 Mbps Ethernet having 48-bit jamming signal is 1.04 micro-seconds. The minimum frame size in bits is: a. 112 b. 160 c. 208 d. 256

Description : Suppose that the one-way propagation delay for a 100 Mbps Ethernet having 48-bit jamming signal is 1.04 micro-seconds. The minimum frame size in bits is: a. 112 b. 160 c. 208 d. 256

Last Answer : d. 256

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

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

In Ethernet addressing, ifall the bits are 1s, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, ifall the bits are 1s, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : broadcast

An IPv6address is _________ bits long. A) 32B) 64 C) 128 D) none of the above

Description : An IPv6address is _________ bits long. A) 32 B) 64 C) 128 D) none of the above

Last Answer : 128

An IPv6 address is _________ bits long A. 32 B. 64 C. 128 D. none of the above

Description : An IPv6 address is _________ bits long A. 32 B. 64 C. 128 D. none of the above

Last Answer : C. 128

______ provides synchronization without increasingthe number of bits. A) Scrambling B) Line coding C) Block coding D) None of the above

Description : ______ provides synchronization without increasingthe number of bits. A) Scrambling B) Line coding C) Block coding D) None of the above

Last Answer : Scrambling

The reliability of a system with n redundant components and a reliability of r is ____________ a) 1-(1-r)n b) 1-(1+r)n c) 1+(1-r)n d) All of the mentioned

Description : The reliability of a system with n redundant components and a reliability of r is ____________ a) 1-(1-r)n b) 1-(1+r)n c) 1+(1-r)n d) All of the mentioned

Last Answer : 1-(1-r)n

In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Description : In ............ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy. (A) Index (B) Linked (C) Contiguous (D) Bit Map

Last Answer : (B) Linked

Classification of protocol that interprets a frame of data as a group of successive bit combined into predetermined pattern of fixed length, usually 8 bits each.

Description : Classification of protocol that interprets a frame of data as a group of successive bit combined into predetermined pattern of fixed length, usually 8 bits each.

Last Answer : Character and Byte-oriented protocols

In hexadecimal colon notation, a 128-bit address isdivided into _______ sections, each _____hexadecimal digits in length. A) 8: 2 B) 8: 3 C) 8: 4 D) none of the above

Description : In hexadecimal colon notation, a 128-bit address isdivided into _______ sections, each _____hexadecimal digits in length. A) 8: 2 B) 8: 3 C) 8: 4 D) none of the above

Last Answer : 8: 4

In Ethernet addressing, if the least significant bit of the firstbyte is 1, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, if the least significant bit of the firstbyte is 1, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : multicast

In Ethernet addressing, if the least significant bit of the firstbyte is 0, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Description : In Ethernet addressing, if the least significant bit of the firstbyte is 0, the address is _________. A) unicast B) multicast C) broadcast D) none of the above

Last Answer : unicast

The computer abbreviation KB usually means– (A) Key Block (B) Kernel Boot (C) Key Byte (D) Kit Bit (E) Kilo Byte

Description : The computer abbreviation KB usually means– (A) Key Block (B) Kernel Boot (C) Key Byte (D) Kit Bit (E) Kilo Byte

Last Answer : Kilo Byte

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

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

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

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

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

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

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

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

The VPIof an NNI is _______ bits in length. A) 8 B) 12 C) 16 D) 24

Description : The VPIof an NNI is _______ bits in length. A) 8 B) 12 C) 16 D) 24

Last Answer : 12

The VPIof a UNI is _______ bits in length. A) 8 B) 12 C) 16 D) 24

Description : The VPIof a UNI is _______ bits in length. A) 8 B) 12 C) 16 D) 24

Last Answer : 8

_______ 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

Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s.b. 2 c. 2.5 d. 5

Description : Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s. b. 2 c. 2.5 d. 5

Last Answer : b. 2

The Internet addresses are ______ bits in length in IPV4 addressing scheme A. 16 B. 64 C. 32 D. 48

Description : The Internet addresses are ______ bits in length in IPV4 addressing scheme A. 16 B. 64 C. 32 D. 48

Last Answer : C. 32

The Internet addresses are ……….. bits in length in IPV4 addressing scheme a. 16 b. 64 c. 48 d. 32

Description : The Internet addresses are ……….. bits in length in IPV4 addressing scheme a. 16 b. 64 c. 48 d. 32

Last Answer : d. 32

Error rate is A. an error-detectingcode based ona summation operation performed onthebits to be checked. B. a checkbit appended to anarrayof binary digits to make thesum of all thebinary digits. C. a code in which each expressionconforms to specific rules of construction, so that if certain errors occur in an expression, the resulting expression will not conform to the rulesof constructionand thus thepresence of the errors isdetected. D. the ratioof the number ofdata units in error to the total number of dataunits E. None of the above

Description : Error rate is A. an error-detectingcode based ona summation operation performed onthebits to be checked. B. a checkbit appended to anarrayof binary digits to make thesum of all thebinary digits. C. a ... ratioof the number ofdata units in error to the total number of dataunits E. None of the above

Last Answer : the ratioof the number ofdata units in error to the total number of dataunits

1000Base-SX, 1000Base-LX, and 1000Base-CX use _________ block coding and ________ line coding. A) 4B/5B; NRZ B) 8B/10B; NRZ C) 4B/5B; MLT-3 D) 8B/10B; NRZ

Description : 1000Base-SX, 1000Base-LX, and 1000Base-CX use _________ block coding and ________ line coding. A) 4B/5B; NRZ B) 8B/10B; NRZ C) 4B/5B; MLT-3 D) 8B/10B; NRZ

Last Answer : 8B/10B; NRZ

A SONET system can use _________. A) STS multiplexers B) regenerators C) add/drop multiplexers D) all of theabove

Description : A SONET system can use _________. A) STS multiplexers B) regenerators C) add/drop multiplexers D) all of theabove

Last Answer : add/drop multiplexers

Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ................ (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Description : Assume that we need to download text documents at the rate of 100 pages per minute. A page is an average of 24 lines with 80 characters in each line and each character requires 8 bits. Then the required bit rate of the channel is ... ...... (A) 1.636 Kbps (B) 1.636 Mbps (C) 2.272 Mbps (D) 3.272 Kbps

Last Answer : Answer: Marks given to all