Which statement correctly distinguishes routing from forwarding in an IP network?
Packets, Links, and Network Performance Online Quiz Questions
Use this free practice quiz with 20 questions to review Packets, Links, and Network Performance, test your knowledge, and prepare for your next test or exam.
Which statements about link-layer frames are correct? Select all that apply.
- A
A frame normally contains an IP packet.
- B
A frame is unchanged from the source host to the destination host.
- C
A new frame appropriate for the next link is created at each router.
- D
A frame may include a link-layer trailer for error detection.
True or false: An application's successfully delivered throughput can be lower than the nominal bandwidth of the link it uses.
- A
True
- B
False
A packet is 8 megabits long and is sent over a 100-Mb/s link. What is its transmission delay? Enter the value in milliseconds. No rounding tolerance is allowed.
Complete the statements: A router temporarily stores packets in a when an outgoing link cannot transmit them immediately. The waiting packets form a .
Which statements correctly compare circuit switching and packet switching? Select all that apply.
- A
Circuit switching reserves resources for a session.
- B
Packet switching reserves a dedicated end-to-end path in basic IP service.
- C
Packet switching is usually efficient for bursty computer traffic.
- D
Circuit switching always uses capacity efficiently during silence or inactivity.
Which protocol provides connectionless, best-effort delivery in the material? Enter its standard uppercase abbreviation.
True or false: Bufferbloat can create high latency even when a link appears fully utilized.
- A
True
- B
False
A packet travels through several routers. What normally happens to its link-layer frame at each router?
- A
The transport segment is replaced, but the frame remains unchanged.
- B
The old frame is removed and the IP packet is placed in a new frame for the next link.
- C
The IP packet is converted directly into a physical signal without a frame.
- D
The application message is divided into a new set of messages at every router.
Which option correctly distinguishes routing from forwarding in an IP network?
- A
Routing transmits bits on a physical medium, while forwarding creates application messages.
- B
Routing checks packet contents for errors, while forwarding retransmits lost packets.
- C
Routing determines paths and builds forwarding information, while forwarding sends an individual packet using that information.
- D
Routing reserves a circuit, while forwarding releases it after delivery.
Which component of end-to-end delay is determined by packet length and link rate, rather than by the physical distance to the destination?
- A
The time to place all packet bits onto the link.
- B
The time for the signal to travel through the medium.
- C
The time spent examining headers and selecting an interface.
- D
The time spent waiting behind packets already in a queue.
A router's average packet-arrival rate remains higher than the transmission rate of its outgoing link. What is the most likely long-term result?
- A
The queue must empty immediately because the link is busy.
- B
The queue remains fixed at one packet because buffers cannot grow.
- C
The outgoing link automatically increases its rate to match arrivals.
- D
The queue grows until the buffer is full, after which arriving packets may be discarded.
Why is packet switching generally efficient for bursty computer traffic compared with a reserved circuit?
- A
It reserves capacity for each session, even during silence.
- B
It allows other flows to use capacity when one flow is idle.
- C
It guarantees a fixed end-to-end delay for every packet.
- D
It eliminates the need for endpoints to handle reliability.
True or false: UDP itself guarantees that datagrams arrive reliably, in order, and without duplicates.
- A
True
- B
False
An 8-megabit packet is sent over a 100-megabit-per-second link. Ignoring all other delays, what is the transmission delay in seconds? Enter the exact numerical value; no tolerance is allowed.
What is the name of the mechanism in which network devices mark packets to signal congestion before waiting for buffer overflow and packet loss? Enter the acronym or full term.
A path contains links rated at 1 Gb/s, 500 Mb/s, and 100 Mb/s. Ignoring protocol overhead and competing traffic, which rate most strongly limits the path's long-term throughput?
- A
1 Gb/s, because it is the fastest link on the path.
- B
500 Mb/s, because it is the middle link rate.
- C
100 Mb/s, because it is the narrowest link on the path.
- D
The sum of all three link rates.
A network link remains fully utilized, but packets experience very high delay because an oversized buffer retains them for a long time. What is this condition called?
- A
Bufferbloat
- B
Fast recovery
- C
Propagation delay
- D
Circuit reservation
A path has a rate of 1 Gb/s and a round-trip time of 40 milliseconds. Approximately how much data can be in transit on the path at once? Complete the statement: The bandwidth-delay product is about .
A network designer is choosing between small and large packets for an application that needs both efficiency and responsive performance. Explain the main performance tradeoffs of the two choices and why neither size is always best.
Related study packs and tools
1. Computing, Culture, and Society
A progressive guide to how computing reshapes culture, economic life, public institutions, and individual opportunities, with frameworks for evaluating digital equity, bias, cybersecurity, encryption, and collective participation.
01. Introduction to Programming and Algorithmic Problem Solving
A medium-difficulty assessment of programming fundamentals, algorithmic problem solving, control flow, data structures, testing, debugging, complexity, and decidability. Questions progress from foundational understanding to applied reasoning.
6. Cybersecurity and Digital Safety
A practical guide to recognizing cybersecurity threats, protecting accounts and devices, and responding safely when information or systems may be compromised.
7. Encryption, Privacy, and Trust
A guided introduction to how encryption, authentication, hashing, secure protocols, and key management establish confidentiality, integrity, privacy, and trust while creating practical and legal trade-offs.
AP Computer Science A: Integrated Java Problem Solving
A practical review of the integrated Java skills, debugging habits, algorithm reasoning, and free-response strategies needed for AP Computer Science A.
Java ArrayList and Collections: Operations, Traversals, and Algorithms
Learn how to create, modify, traverse, and analyze Java lists with ArrayList, wrapper types, standard algorithms, and the Collections utility class for AP Computer Science A.
Java Boolean Logic and Selection
Build a clear understanding of Java Boolean expressions, logical operators, selection statements, nested branching, equivalent logic, and systematic code tracing for AP Computer Science A.
Java Foundations and Program Design
A practical introduction to Java program structure, data types, operators, input and output, problem-solving strategy, testing, and debugging for AP Computer Science A.
Java Inheritance and Polymorphism
A practical guide to Java inheritance, constructor chaining, method overriding, polymorphism, access control, and object behavior for tracing and writing AP Computer Science A programs.
Java Objects, Classes, and the String API
A focused guide to Java classes, object references, constructors, methods, strings, wrapper classes, and API usage for AP Computer Science A.
Java Primitive Types and Expression Evaluation
A focused guide to Java primitive types, expression evaluation, numeric conversion, floating-point behavior, integer overflow, and common methods in the Math class for AP Computer Science A.
Java Primitive Types and Expressions
A focused review of Java primitive types, expression evaluation, numeric conversion, arithmetic behavior, Math methods, randomness, and tracing techniques for AP Computer Science A.