Menu

Question Discussion & Solution

MCQ

Q.

In block coding, if n = 5, the maximum Hamming distance between two codewords is ________

A

2

B

3

C

5

D

none of the above

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

In cyclic redundancy checking, the divisor is _______ the CRC

A

The same size as

B

one bit less than

C

one bit more than

D

none of the above

Discussion

MCQ

2.

_______codes are special linear block codes with one extra property. If a codeword is rotated, the result is another codeword

A

Non-linear

B

Convolution

C

Cyclic

D

none of the above

Discussion

MCQ

3.

. In modulo-2 arithmetic, we use the ______ operation for both addition and subtraction.

A

XOR

B

OR

C

AND

D

none of the above

Discussion

MCQ

4.

The Hamming distance between 100 and 001 is ________

A

2

C

1

D

none of the above

Discussion

MCQ

5.

Which error detection method consists of just one redundant bit per data unit?

A

Simple parity check

B

Two-dimensional parity check

C

CRC

D

Checksum

Discussion

More Data Communication and Computer Network Topics

Data Communication and Computer Network Basics

30 MCQs

Network Models

47 MCQs

Data and Signals

27 MCQs

Transmission

74 MCQs

Multiplexing

17 MCQs

Transmission Media

82 MCQs

Error Detection and Correction

27 MCQs

Data

298 MCQs

Network Addressing

76 MCQs

Network Layer Internet Protocols

19 MCQs

Nework Layer Routing

68 MCQs

Process

71 MCQs

Congestion Control and Quality of Service

40 MCQs

Domain Name System

26 MCQs

Remote Logging, Mail and File Transfer

43 MCQs

WWW and HTTP

28 MCQs

Network Management

20 MCQs

Multimedia

30 MCQs

Network Security

85 MCQs

Mixed

10 MCQs

Introduction to Computer Networks

0 MCQs

Networks Layers and Models

0 MCQs

Network Devices

0 MCQs

Fundamentals of Mobile Communication

0 MCQs