Wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Networking Concepts Quiz

Total questions: 38

Worksheet time: 26mins

Name
Class
Date
1.

Which of the following is an example of Bluetooth?

a)

wide area network

b)

virtual private network

c)

local area network

d)

personal area network

2.

What is the full form of OSI?

a)

optical service implementation

b)

open service Internet

c)

open system interconnection

d)

operating system interface

3.

How many layers are there in the ISO OSI reference model?

a)

7

b)

5

c)

4

d)

6

4.

Which one of the following is not a function of network layer?

a)

congestion control

b)

error control

c)

routing

d)

inter-networking

5.

Which of the following devices forwards packets between networks by processing the routing information included in the packet?

a)

firewall

b)

bridge

c)

hub

d)

router

6.

Which layer does the data link layer take packets from and encapsulate them into frames for transmission?

a)

transport layer

b)

application layer

c)

network layer

d)

physical layer

7.

Which topology requires a multipoint connection?

a)

Ring

b)

Bus

c)

Star

d)

Mesh

8.

What was the name of the first network?

a)

ASAPNET

b)

ARPANET

c)

CNNET

d)

NSFNET

9.

What is the hamming distance between the words 1010101, 1100110?

a)

4

b)

5

c)

8

d)

3

10.

In the sliding window method of flow control, the receiver window _______ size when frames are received

a)

increases in

b)

decreases in

c)

doubles in

d)

remains its original

11.

The stop-and-wait flow control method is the same as the sliding window method with a window size of _______.

a)

0

b)

1

c)

2

d)

none of the above

12.

Which sublayer of the data link layer performs data link functions that depend upon the type of medium?

a)

logical link control sublayer

b)

media access control sublayer

c)

network interface control sublayer

d)

error control sublayer

13.

CRC stands for __________

a)

cyclic redundancy check

b)

code repeat check

c)

code redundancy check

d)

cyclic repeat check

14.

When 2 or more bits in a data unit has been changed during the transmission, the error is called ____________

a)

random error

b)

burst error

c)

inverted error

d)

double error

15.

Which of the following is the multiple access protocol for channel access control?

a)

CSMA/CD

b)

CSMA/CA

c)

Both CSMA/CD & CSMA/CA

d)

HDLC

16.

How tables are updated in the distance vector routing algorithm?

a)

Using flooding technique

b)

By retrieving the information from all the nodes directly

c)

By interchanging the information with neighbour nodes

d)

By exchanging the information with a central device

17.

What are the various categories of routing algorithms?

a)

Non-adaptive Algorithm

b)

Adaptive Algorithm

c)

a & b

d)

Accumulative Algorithm

18.

Which of the following is a disadvantage of Distance Vector Routing?

a)

High computational overhead

b)

Count-to-infinity problem

c)

Requires global knowledge of the network

d)

Complex shortest path calculation

19.

Link State Routing uses which algorithm to compute shortest paths?

a)

Bellman-Ford Algorithm

b)

Dijkstra’s Algorithm

c)

Kruskal’s Algorithm

d)

Floyd-Warshall Algorithm

20.

In flooding, a packet is:

a)

Sent to a single shortest path

b)

Sent to all outgoing links except the one it arrived on

c)

Sent only if the link is free

d)

Dropped if no route exists

21.

The main difference between static and dynamic routing is:

a)

Static routing adapts automatically, dynamic does not

b)

Dynamic routing adapts automatically, static does not

c)

Both update automatically

d)

Both require manual updates

22.

Which protocol uses Bellman-Ford Algorithm?

a)

RIP

b)

OSPF

c)

BGP

d)

ICMP

23.

Which of the following problems is solved by Split Horizon in Distance Vector Routing?

a)

Loops

b)

Packet loss

c)

Congestion

d)

Error detection

24.

Which error detection method is most powerful?

a)

Parity Check

b)

Checksum

c)

CRC

d)

Hamming Code

25.

Hamming Code can detect and correct:

a)

Detect 1-bit error, Correct 1-bit error

b)

Detect 2-bit error, Correct 1-bit error

c)

Detect burst errors of any length

d)

Correct 2-bit errors

26.

Which of the following is an error control mechanism?

a)

Stop-and-Wait ARQ

b)

Go-Back-N ARQ

c)

Selective Repeat ARQ

d)

All of the above

27.

In Go-Back-N ARQ, if frame i is lost, then:

a)

Only frame i is resent

b)

All frames from i onwards are resent

c)

Transmission continues ignoring frame i

d)

Only the last frame is resent

28.

Which of the following is a congestion control mechanism?

a)

Stop-and-Wait

b)

Go-Back-N

c)

Leaky Bucket

d)

Bit Stuffing

29.

Which technique prevents congestion by regulating data entry into the network?

a)

Open-loop congestion control

b)

Closed-loop congestion control

c)

Flow control

d)

Bit stuffing

30.

Choke packet technique is an example of:

a)

Open-loop congestion control

b)

Closed-loop congestion control

c)

Error control

d)

Flow control

31.

The leaky bucket algorithm is used to:

a)

Detect errors in transmission

b)

Shape traffic and control congestion

c)

Encrypt data packets

d)

Establish connections

32.

Which encoding scheme uses two voltage levels to represent bits 0 and 1?

a)

A) NRZ (Non-Return to Zero)

b)

B) Manchester Encoding

c)

C) Differential Manchester

d)

D) AMI

33.

A 100 Mbps Ethernet (IEEE 802.3) has a minimum frame size of 512 bits.
What is the minimum frame transmission time?

a)

A) 5.12 μs

b)

B) 3.4 μs

c)

C) 6.1 μs

d)

D) 5.60 μs

34.

Consider a token bucket with capacity 1 MB and a token rate of 10 Mbps.
If a burst of 5 MB arrives, how much data is transmitted immediately and how much is dropped?

a)

2 MB sent immediately, 3 MB dropped

b)

1 MB sent immediately, 4 MB dropped

c)

1 MB sent immediately, 3MB dropped

d)

2MB sent immediately, 4 MB dropped

35.

A CRC generator polynomial is G(x)=x3+x+1 G(x) = x^3 + x + 1 G(x)=x3+x+1.
For a data sequence D(x)=1011 D(x) = 1011 D(x)=1011, compute the CRC bits.

a)

111

b)

101

c)

011

d)

110

36.

A 7-bit Hamming code is used to transmit data. What is the maximum number of data bits it can carry?

a)

5

b)

3

c)

4

d)

6

37.

In bit stuffing, a frame is transmitted using the HDLC flag 01111110.
If the data to be transmitted is: 1111101111110

What will be the stuffed output?

a)

1111100 0011100 0

b)

1111100 1111100 0

c)

1011100 1111100 0

d)

1111100 1111100 1

38.

In bit stuffing, the receiver’s job is to:

a)

A) Add extra 0s after 5 ones

b)

B) Remove the stuffed 0s after 5 ones

c)

C) Replace stuffed 0 with 1

d)

D) Recompute CRC after stuffing

Similar Resources on Wayground

Preliminary Examination - OOP

40 questions

Preliminary Examination - OOP

quiz

Worksheet

•

University

Napkin Folding and Hospitality Quiz

34 questions

Napkin Folding and Hospitality Quiz

quiz

Worksheet

•

7th Grade - University

EXAMEN FINAL_TIC

40 questions

EXAMEN FINAL_TIC

quiz

Worksheet

•

University

Quiztronic

40 questions

Quiztronic

quiz

Worksheet

•

University

Lecture Activity 2: IOT

40 questions

Lecture Activity 2: IOT

quiz

Worksheet

•

University

UH Topologi Jaringan Komputer

35 questions

UH Topologi Jaringan Komputer

quiz

Worksheet

•

11th Grade - University

Quiz on Systems Architecture

33 questions

Quiz on Systems Architecture

quiz

Worksheet

•

University

Berpikir komputasi dan pemograman

40 questions

Berpikir komputasi dan pemograman

quiz

Worksheet

•

11th Grade - University