![placeholder image to represent content](/_next/image?url=%2Fassets%2Fquiz_default_logo.jpg&w=256&q=75)
Module-2 Network layer design issues
Quiz by Rashmi K
Feel free to use or edit a copy
includes Teacher and Student dashboards
Measure skillsfrom any curriculum
Tag the questions with any skills you have. Your dashboard will track each student's mastery of each skill.
- edit the questions
- save a copy for later
- start a class game
- automatically assign follow-up activities based on students’ scores
- assign as homework
- share a link with colleagues
- print as a bubble sheet
- Q1
Which of the following switch methods creates a point-to-point physical connection between two or more computers?
Packet switching
Circuit switching
None of these
Message switching
30s - Q2
Which of the following layers does the HTTP protocol work on?
Application layer
None of the these
Physical layer
Data-link layer
30s - Q3
What is the size of the sender window in the Go Back N (ARQ) protocol?
0
1
n
10
30s - Q4
How many characters consist of the entire hostname?
31 characters
127 characters
511 characters
255 characters
30s - Q5
MAC address is also called ______.
Destination address
Source address
Physical address
Logical address
30s - Q6
Which network is suitable for a building?
MAN
PAN
WAN
LAN
30s - Q7
Select the subset of a network that contains all the routers but has no loops is known as
none of the mentioned
Both a and b
spider tree
spanning-tree
spider structure
30s - Q8
Select from the following which command is used to operate TCP/IP routing table
Traceroute
None of these
Show IP route
Route
Ipconfig
30s - Q9
What is the primary goal of Shortest Path Routing algorithms?
Maximize network security
Maximize bandwidth
Minimize latency
Minimize data loss
30s - Q10
What is the main characteristic of the Flooding routing algorithm?
Calculates shortest paths
Minimizes latency
Broadcasts packets to all neighbors
Uses dynamic routing tables
30s - Q11
What information does a node in a Distance Vector Routing algorithm maintain in its routing table?
Only the next hop for each destination
Only the distance to each destination
The entire network topology
The distance and next hop for each destination
30s - Q12
What information does a node in a Link State Routing algorithm exchange with other nodes?
Only the next hop for each destination
Entire routing table
Distance to each destination
State of its links
30s - Q13
What advantage does Hierarchical Routing provide in terms of scalability?
It increases the complexity of routing tables.
It increases the number of levels in the hierarchy.
It reduces the number of routers at each level.
It eliminates the need for routing protocols.
30s - Q14
In Broadcast Routing, what is the term used for the message sent to all nodes in the network?
Multicast
Datagram
Unicast
Broadcast packet
30s - Q15
What is the term used for the group of nodes that receive a multicast message?
Multicast tree
Multicast segment
Unicast Group
Multicast group
30s