wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Computer Networks — Data Link Layer Questions

Total questions: 112

Worksheet time: 56mins

Name
Class
Date
1.

Which OSI layer is responsible for node-to-node communication?

a)

Physical Layer

b)

Network Layer

c)

Data Link Layer

d)

Transport Layer

2.

What is the main purpose of frame synchronization in the Data Link Layer?

a)

To ensure sender and receiver agree on frame boundaries

b)

To assign addresses to nodes

c)

To manage link sharing

d)

To detect errors in transmission

3.

Which responsibility of the Data Link Layer prevents data overflow at the receiver?

a)

Link Management

b)

Flow Control

c)

Addressing

d)

Error Control

4.

Error control in the Data Link Layer is mainly achieved through:

a)

Encryption

b)

Acknowledgements and retransmissions

c)

Routing algorithms

d)

IP addressing

5.

Which Data Link Layer function assigns identifiers to nodes for communication?

a)

Addressing

b)

Flow Control

c)

Error Control

d)

Frame Synchronization

6.

What is the role of link management in the Data Link Layer?

a)

To compress data

b)

To encrypt data during transmission

c)

To assign IP addresses

d)

To establish, maintain, and release links

7.

Which sublayer of the Data Link Layer decides how multiple devices share the same communication medium?

a)

Transport Layer

b)

Media Access Control (MAC)

c)

Data Link Control (DLC)

d)

Session Layer

8.

Which of the following is a common MAC protocol?

a)

IP

b)

UDP

c)

TCP

d)

CSMA/CD

9.

In the Data Link Layer, which responsibility ensures reliable delivery of frames?

a)

Media Access Control

b)

Addressing

c)

Error Control

d)

Flow Control

10.

Which of the following best describes the two main responsibilities of the Data Link Layer?

a)

Data Link Control and Media Access Control

b)

Application support and session management

c)

Encryption and compression

d)

Routing and addressing

11.

Frame synchronization ensures:

a)

Correct error detection

b)

Start and end of each frame

c)

Addressing of nodes

d)

Flow control

12.

Without frame synchronization, the receiver:

a)

Cannot detect errors

b)

Cannot identify frame boundaries

c)

Cannot assign addresses

d)

Cannot manage links

13.

Which technique is often used for frame synchronization?

a)

Bit stuffing

b)

Encryption

c)

Routing

d)

Flow control

14.

Frame synchronization is part of:

a)

Physical Layer

b)

Data Link Layer

c)

Network Layer

d)

Transport Layer

15.

Frame synchronization helps avoid:

a)

Duplicate addresses

b)

Misinterpretation of data

c)

Flow overload

d)

Link termination

16.

Flow control prevents:

a)

Frame loss due to overflow

b)

Address duplication

c)

Synchronization errors

d)

Link mismanagement

17.

Flow control ensures:

a)

Sender transmits at receiver's pace

b)

Receiver sends faster

c)

Errors are corrected

d)

Frames are synchronized

18.

A common flow control technique is:

a)

Stop-and-Wait

b)

Routing

c)

Encryption

d)

Addressing

19.

Flow control is necessary because:

a)

Receivers have limited buffer capacity

b)

Senders are always slower

c)

Errors occur in transmission

d)

Links must be managed

20.

Sliding Window is used for:

a)

Error detection

b)

Flow control

c)

Addressing

d)

Synchronization

21.

Error control deals with:

a)

Detecting and correcting bit errors

b)

Assigning addresses

c)

Synchronizing frames

d)

Managing links

22.

A common error detection method is:

a)

CRC

b)

Routing

c)

Encryption

d)

Addressing

23.

Error control ensures:

a)

Reliable delivery

b)

Faster transmission

c)

Address uniqueness

d)

Link termination

24.

Retransmission is part of:

a)

Error control

b)

Flow control

c)

Addressing

d)

Synchronization

25.

Error control uses:

a)

Acknowledgements

b)

Encryption keys

c)

Routing tables

d)

Address mapping

26.

Addressing is required in:

a)

Multipoint lines

b)

Point-to-point links only

c)

Error detection

d)

Synchronization

27.

Addressing ensures:

a)

Correct sender and receiver identification

b)

Error-free transmission

c)

Flow control

d)

Synchronization

28.

In LANs, addressing specifies:

a)

Source and destination stations

b)

Error codes

c)

Synchronization bits

d)

Flow control windows

29.

Addressing is part of:

a)

Data Link Layer

b)

Network Layer

c)

Transport Layer

d)

Application Layer

30.

Without addressing, frames:

a)

Cannot reach the intended station

b)

Cannot be synchronized

c)

Cannot be error-free

d)

Cannot be managed

31.

Control information must be:

a)

Sent on a separate path

b)

Distinguished from data

c)

Encrypted

d)

Ignored

32.

Control and data sharing the same link avoids:

a)

Extra physical paths

b)

Synchronization errors

c)

Address duplication

d)

Flow overload

33.

Control frames include:

a)

Acknowledgements

b)

User data

c)

Routing tables

d)

Encryption keys

34.

The receiver distinguishes control from data using:

a)

Frame type fields

b)

Encryption

c)

Addressing

d)

Synchronization

35.

Control information is necessary for:

a)

Managing communication

b)

Error correction only

c)

Addressing only

d)

Synchronization only

36.

Link management involves:

a)

Initiation, maintenance, termination

b)

Error detection

c)

Addressing

d)

Synchronization

37.

Link management requires:

a)

Coordination between nodes

b)

Encryption keys

c)

Routing tables

d)

Flow control

38.

Link management ensures:

a)

Proper lifecycle of communication

b)

Error-free transmission only

c)

Synchronization only

d)

Addressing only

39.

Link management procedures are needed for:

a)

Cooperation between nodes

b)

Error detection

c)

Flow control

d)

Addressing

40.

Without link management, communication:

a)

Cannot be properly established or terminated

b)

Cannot detect errors

c)

Cannot synchronize frames

d)

Cannot assign addresses

41.

What does the Physical Layer provide to ensure sender and receiver use the same timing?

a)

Framing

b)

Bit Synchronization

c)

Addressing

d)

Error Control

42.

Why does the Data Link Layer pack bits into frames?

a)

To improve routing efficiency

b)

To make each frame distinguishable

c)

To encrypt data

d)

To compress messages

43.

What additional information is added to a frame in the Data Link Layer?

a)

Error codes only

b)

Sender and destination addresses

c)

Synchronization bits only

d)

Flow control signals

44.

Why is packing a large message into one frame inefficient?

a)

It increases synchronization errors

b)

Flow and error control become inefficient

c)

It prevents addressing

d)

It reduces throughput

45.

What is the advantage of dividing a message into smaller frames?

a)

Faster encryption

b)

A single-bit error affects only one small frame

c)

Reduced addressing overhead

d)

Elimination of synchronization

46.

In fixed-size framing, how are frame boundaries determined?

a)

By special characters

b)

By bit patterns

c)

By the frame size itself

d)

By error codes

47.

Which framing method requires explicit markers to define frame boundaries?

a)

Fixed-size framing

b)

Variable-size framing

c)

Error control

d)

Flow control

48.

The character-oriented approach to variable-size framing uses:

a)

Special characters

b)

Fixed-size delimiters

c)

Bit stuffing

d)

Error codes

49.

The bit-oriented approach to variable-size framing uses:

a)

Character codes

b)

Bit patterns

c)

Frame size delimiters

d)

Error detection codes

50.

Which of the following is an advantage of fixed-size framing?

a)

No need for boundary markers

b)

Easier error detection

c)

Supports variable-length messages

d)

Requires fewer addresses

51.

What problem occurs if the flag pattern appears inside the data?

a)

Flow control failure

b)

Receiver misinterprets it as end of frame

c)

Addressing error

d)

Synchronization loss

52.

What is added to the data section to prevent confusion when a flag pattern appears?

a)

Error code

b)

Escape character (ESC)

c)

Synchronization bit

d)

Address field

53.

What does the escape character (ESC) represent?

a)

A predefined bit pattern

b)

A random sequence

c)

A synchronization signal

d)

A routing identifier

54.

If the escape character itself is part of the text, what happens?

a)

It is ignored

b)

An extra ESC is added

c)

The frame is terminated

d)

The flag is removed

55.

The use of escape characters in framing is an example of:

a)

Error control

b)

Flow control

c)

Data transparency

d)

Addressing

56.

Flow control is primarily a technique for:

a)

Error detection

b)

Speed matching of transmitter and receiver

c)

Addressing nodes

d)

Synchronization

57.

What does flow control prevent?

a)

Frame synchronization errors

b)

Receiver overflow

c)

Address duplication

d)

Bit errors

58.

Flow control refers to procedures that restrict:

a)

The number of nodes on a network

b)

The amount of data the sender can send before acknowledgment

c)

The number of bits per frame

d)

The addressing scheme

59.

Which of the following is NOT a purpose of flow control?

a)

Preventing buffer overflow

b)

Matching transmission speed

c)

Error correction

d)

Regulating sender output

60.

Feedback-based flow control relies on:

a)

Receiver sending control signals

b)

Fixed transmission rate

c)

Error detection codes

d)

Synchronization bits

61.

Rate-based flow control regulates transmission by:

a)

Receiver feedback

b)

Predefined transmission rate

c)

Error detection

d)

Addressing

62.

Which flow control method is more dynamic and adapts to receiver capacity?

a)

Rate-based

b)

Feedback-based

c)

Error-based

d)

Address-based

63.

Which flow control method is simpler but less adaptive?

a)

Feedback-based

b)

Rate-based

c)

Error-based

d)

Address-based

64.

Flow control is essential because:

a)

Receivers have limited buffer capacity

b)

Senders always transmit slower

c)

Errors occur in transmission

d)

Addresses must be unique

65.

Which of the following best describes the two types of flow control?

a)

Error-based and synchronization-based

b)

Feedback-based and rate-based

c)

Address-based and routing-based

d)

Fixed-size and variable-size

66.

Error control in the Data Link Layer involves:

a)

Only error detection

b)

Only error correction

c)

Both error detection and error correction

d)

Addressing

67.

What does error control allow the receiver to do?

a)

Assign addresses

b)

Inform the sender of lost or damaged frames

c)

Synchronize bits

d)

Manage flow

68.

How are lost or damaged frames handled in error control?

a)

Ignored

b)

Retransmitted by the sender

c)

Corrected by the receiver only

d)

Dropped permanently

69.

Error control in the Data Link Layer is based on:

a)

Routing algorithms

b)

Automatic Repeat Request (ARQ)

c)

Encryption

d)

Addressing

70.

What does ARQ stand for?

a)

Automatic Routing Query

b)

Automatic Repeat Request

c)

Address Resolution Queue

d)

Advanced Retransmission Quality

71.

Which of the following is NOT part of error control?

a)

Error detection

b)

Error correction

c)

Flow regulation

d)

Retransmission

72.

What technique is commonly used for error detection?

a)

CRC

b)

Addressing

c)

Bit stuffing

d)

Synchronization

73.

What happens when the receiver detects a damaged frame?

a)

It discards the frame silently

b)

It sends a negative acknowledgment

c)

It retransmits the frame itself

d)

It ignores the error

74.

Which of the following is a key benefit of error control?

a)

Faster transmission

b)

Reliable delivery

c)

Reduced addressing overhead

d)

Simplified synchronization

75.

ARQ ensures reliability by:

a)

Encrypting data

b)

Retransmitting lost or damaged frames

c)

Assigning addresses

d)

Synchronizing bits

76.

Routing in packet-switched networks primarily involves:

a)

Selecting the shortest cable length

b)

Selecting a route across the network between end nodes

c)

Choosing the fastest processor

d)

Assigning IP addresses

77.

Which of the following is NOT a required characteristic of routing?

a)

Correctness

b)

Simplicity

c)

Randomness

d)

Robustness

78.

Fairness in routing means:

a)

Giving priority to one node

b)

Distributing resources evenly among all stations

c)

Always using the shortest path

d)

Ignoring congestion

79.

Efficiency in routing refers to:

a)

Increasing hop count

b)

Reducing processing and transmission overhead

c)

Using maximum bandwidth always

d)

Ignoring delays

80.

Optimality in routing ensures:

a)

Best paths are chosen for highest performance

b)

Random paths are selected

c)

Congestion is ignored

d)

All nodes are visited

81.

The simplest performance criterion for route selection is:

a)

Least delay

b)

Minimum hop

c)

Maximum bandwidth

d)

Random routing

82.

Generalized performance criterion is known as:

a)

Least cost

b)

Maximum throughput

c)

Flooding

d)

Round robin

83.

Least-cost routing aims to:

a)

Minimize delay or maximize throughput

b)

Increase hop count

c)

Randomize traffic

d)

Ignore congestion

84.

Routing decisions can be made on a:

a)

Packet or virtual circuit basis

b)

Only centralized basis

c)

Random basis

d)

Fixed hardware basis

85.

Distributed routing decisions are made by:

a)

A central authority

b)

Each node independently

c)

Only the source node

d)

Routers outside the network

86.

Fixed routing uses:

a)

A single permanent route per source-destination pair

b)

Random paths

c)

Flooding

d)

Adaptive updates

87.

Main disadvantage of fixed routing:

a)

Simplicity

b)

Lack of flexibility

c)

Robustness

d)

Efficiency

88.

Flooding strategy sends packets to:

a)

One neighbor

b)

Every neighbor

c)

Only the source

d)

Central node

89.

Flooding requires packets to be:

a)

Unnumbered

b)

Uniquely numbered

c)

Randomly discarded

d)

Always prioritized

90.

Disadvantage of flooding:

a)

High traffic load

b)

No robustness

c)

No fairness

d)

No numbering

91.

Random routing selects outgoing paths:

a)

Based on least cost

b)

Randomly or round robin

c)

Using Dijkstra's algorithm

d)

Using Bellman-Ford

92.

Adaptive routing is used by:

a)

Almost all packet-switched networks

b)

Only ARPANET

c)

Fixed routing systems

d)

Random routing systems

93.

Main disadvantage of adaptive routing:

a)

Complexity and possible oscillation

b)

Simplicity

c)

Lack of robustness

d)

No updates

94.

Least-cost algorithms include:

a)

Dijkstra and Bellman-Ford

b)

Flooding

c)

Random routing

d)

ARPANET only

95.

Dijkstra's algorithm requires:

a)

Complete topology knowledge

b)

Only local info

c)

Random paths

d)

No link costs

96.

Bellman-Ford algorithm requires:

a)

Link costs to neighbors and their total costs

b)

Complete topology

c)

Random selection

d)

No updates

97.

Dijkstra's algorithm develops paths in order of:

a)

Increasing path length

b)

Random order

c)

Decreasing delay

d)

Round robin

98.

Bellman-Ford updates paths by:

a)

Iteratively increasing allowed links

b)

Flooding

c)

Random routing

d)

Fixed routing

99.

Both Dijkstra and Bellman-Ford algorithms:

a)

Converge to same solution under static topology

b)

Always diverge

c)

Never agree

d)

Ignore link costs

100.

Flooding is considered:

a)

Very robust

b)

Inefficient only

c)

Always least cost

d)

Centralized

101.

Random routing is typically:

a)

Neither least cost nor minimum hop

b)

Always optimal

c)

Always robust

d)

Always fair

102.

Adaptive routing aids in:

a)

Congestion control

b)

Increasing hop count

c)

Ignoring failures

d)

Fixed paths

103.

Evaluation of routing algorithms depends on:

a)

Processing time and information required

b)

Randomness

c)

Hop count only

d)

Flooding

104.

In flooding, duplicates are discarded using:

a)

Unique packet numbers

b)

Random selection

c)

Centralized control

d)

Round robin

105.

Hop count in flooding helps to:

a)

Limit retransmission

b)

Increase traffic

c)

Randomize routing

d)

Ignore congestion

106.

Distributed adaptive routing uses:

a)

Delay/outage info from adjacent nodes

b)

Centralized info only

c)

Random paths

d)

Fixed routes

107.

Centralized routing collects info from:

a)

All nodes

b)

Only neighbors

c)

Random nodes

d)

Source only

108.

Update timing in adaptive routing can be:

a)

Fixed or adaptive

b)

Random only

c)

Never updated

d)

Ignored

109.

Oscillation in adaptive routing occurs when:

a)

Reacting too quickly

b)

Reacting too slowly

c)

Ignoring congestion

d)

Using fixed paths

110.

Dijkstra's algorithm terminates when:

a)

All nodes are processed

b)

One path is found

c)

Random stop

d)

Flooding ends

111.

Bellman-Ford algorithm eliminates:

a)

Connections with different predecessors formed earlier

b)

All paths

c)

Random routes

d)

Fixed costs

112.

Link costs in least-cost routing may differ:

a)

In different directions

b)

Always equal

c)

Randomly ignored

d)

Fixed

Similar Resources on Wayground

Competencias, Objetivo y Contexto de PowerPoint 2016

115 questions

Competencias, Objetivo y Contexto de PowerPoint 2016

quiz

Worksheet

•

University

tinh

114 questions

tinh

quiz

Worksheet

•

University

Cybersecurity 1-112

111 questions

Cybersecurity 1-112

quiz

Worksheet

•

University

DBMS and Storage Concepts Worksheet

107 questions

DBMS and Storage Concepts Worksheet

quiz

Worksheet

•

University

Natural Language Processing Quiz

109 questions

Natural Language Processing Quiz

quiz

Worksheet

•

University

Mobile App Development Quiz

116 questions

Mobile App Development Quiz

quiz

Worksheet

•

University

АКТ және MS Office негіздері — жұмыс парағы (13-сынып)

109 questions

АКТ және MS Office негіздері — жұмыс парағы (13-сынып)

quiz

Worksheet

•

University

ICT Final

108 questions

ICT Final

quiz

Worksheet

•

University