Data Communications - Data Link Layer

20 Questions | By Bievangelista | Updated: Dec 2, 2022 | Attempts: 709

Questions

Settings

Create your own Quiz

Data Communications - Data Link Layer - Quiz

The quiz covers the introduction of data link layer

Questions and Answers

1.

For a 12-bit data string 101100010010, determine the position of the error in the transmitted data string 11010000110100010 using Hamming bits to detect/correct an error. Hamming bits are placed in positions 4, 8, 9,13 and 17.
- A.
  
  10
- B.
  
  11
- C.
  
  12
- D.
  
  14
- E.
  
  15
2.

For a 12-bit data string 101100010010, determine the transmitted data string using Hamming bits to detect/correct an error. Hamming bits are placed in positions 2, 4, 7,11 and 15.
- A.
  
  10111010010000110
- B.
  
  10111010010000100
- C.
  
  10011010010000110
- D.
  
  10111010010001110
- E.
  
  10111010010000110
3.

For a 12-bit data string 101100010010, determine the position of the error in the transmitted data string 11010100111100010 using Hamming bits to detect/correct an error. Hamming bits are placed in positions 4, 8, 9,13 and 17.
- A.
  
  5
- B.
  
  6
- C.
  
  7
- D.
  
  10
- E.
  
  11
4.

For a binary stream of 1100010, determine the transmitted data using Hamming codes.
- A.
  
  10101000010
- B.
  
  00111001010
- C.
  
  11101000010
- D.
  
  10101001010
- E.
  
  00101000010
5.

Determine the transmitted frame using the calculation of the polynomial code checksum of the following given with 4 zero bits appended to the frame.Frame: 1011100100Generator: 10011
- A.
  
  101110010010
- B.
  
  10111001000010
- C.
  
  1011100100010
- D.
  
  101110010001
- E.
  
  10111001001110
6.

For the given data steam of 11000111101000, determine the number of Hamming bits required.
7.

For the given data steam of 11000111101000110100111011001101101, determine the number of Hamming bits required.
8.

It provides the functional and procedural means to transfer data between network entities in the layered architecture.
9.

The data units are transmitted and received without being acknowledged.
- A.
  
  Unacknowledged connectionless service
- B.
  
  Acknowledged connectionless service
- C.
  
  Acknowledged connection-oriented service
10.

The user protocol at the source is notified with an acknowledment when the data is received by the destination's user protocol and considered a guaranteed delivery service.
- A.
  
  Unacknowledged connectionless service
- B.
  
  Acknowledged connectionless service
- C.
  
  Acknowledged connection-oriented service
11.

It is similar to carrying a normal telephone conversation where a connection is established and information is exchanged.
- A.
  
  Unacknowledged connectionless service
- B.
  
  Acknowledged connectionless service
- C.
  
  Acknowledged connection-oriented service
12.

It is performed when a byte within a frame has the same pattern as the FLAG or ESC.
- A.
  
  Bit stuffing
- B.
  
  Byte stuffing
- C.
  
  Hamming codes
13.

It is how the receiver detects the start and end of a frame.
- A.
  
  Error control
- B.
  
  Flow control
- C.
  
  Framing
14.

DeIt regulates flow so that slow receivers are not swamped by fast senders.
- A.
  
  Error control
- B.
  
  Flow control
- C.
  
  Framing
15.

It is an acknowledment which means that information was received with errors and retransmission is required.
16.

Determine the transmitted frame using the calculation of the polynomial code checksum of the following given with 4 zero bits appended to the frame.Frame: 1100011011Generator: 11100
17.

For a binary stream of 1111100, determine the transmitted data with Hamming codes.
18.

For a binary stream of 1011110, determine the transmitted data with Hamming codes.
19.

For a 12-bit data string 101100010111, determine the position of the error in the transmitted data string 11010110100100111 using Hamming bits to detect/correct an error. Hamming bits are placed in positions 4, 8, 9,13 and 17.
20.

For the given data steam of 101010111000111101000110100111011001101101, determine the number of Hamming bits required.