(Summer 2025, Georgia Tech) – Questions with Verified
Answers
Introduction:
This study set covers all major topics from Georgia Tech’s CS6250
Computer Networks course, preparing students for Exam 1 in
Summer 2025. It includes over 60 verified multiple-choice and
short-answer questions with correct answers, spanning network
fundamentals, TCP/UDP protocols, routing algorithms (link-state,
distance-vector, BGP), congestion control, IXPs, and the OSI model.
The material thoroughly reviews both conceptual and applied
networking principles used in the course quizzes and exams.
Exam Questions and Answers
At an IXP, the members have a choice to peer privately or publicly
--- correct answer ---True
IXPs leading incentive to establish route servers was to charge the
participants for using it --- correct answer ---False
AN IXP route server does not need to run the BGP protocol to
facilitate the establishment of multi-lateral peering sessions -
Answer:-False
For multi-lateral BGP peering sessions at an IXP, the participants
,have the choice to advertise routes, either directly to other
participants, or to the route server --- correct answer ---False
The data plane functions of a traditional router are implemented in
hardware --- correct answer ---True
The control plane functions of a traditional router are implemented
in software --- correct answer ---True
,The forwarding plane operations take place in shorter time scales
than the control plane operations --- correct answer ---True
The forwarding functions of a traditional router refer to
transferring packets from the input ports to the appropriate output
ports --- correct answer ---True
The control plane functions can either be implemented in the
router's processor or they can be "outsourced" for implementation
at a remote controller --- correct answer ---True
In traditional routers, traffic forwarding is performed based on:
Destination IP address only
Source IP address only
Both source and destination IP addresses --- correct answer ---
Destination IP address only
Consider a router with the forwarding table:
, Prefix Match Output Link 11100000
00* A
11100000 01000000* B
1110000* C
11100001 1* D
otherwise E
Given that the router uses longest prefix matching, determine the
output link for packet with destination IP address:
10001000 11110001 01010001 11110101
A
B
C
D