GATE & PSUs - Computer Science & Information Technology (CS & IT)

Routing Protocols (Distance Vector, Link State, BGP) question bank (Computer Networks)

Practice 6 free GATE & PSUs - Computer Science & Information Technology (CS & IT) Computer Networks - Routing Protocols (Distance Vector, Link State, BGP) questions with answers and step-by-step solutions.

Q1.

GATE Technical Standard: In computational modeling of 'Routing Protocols (Distance Vector, Link State, BGP) - Advanced Problem Solving', what constitutes the primary performance trade-off regarding asymptotic efficiency and resource conservation?

(A)

Minimizing peak algorithmic runtime and memory latency through optimal dynamic constraints (Routing Protocols (Distance Vector, Link State, BGP) - Advanced Problem Solving)

(B)

Maximizing redundant register transfers to force artificial synchronization

(C)

Arbitrary thread serialization without mutex coordination or race mitigation

(D)

Unbounded stack consumption with circular recursive invocation

Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view

Sign up free to access all 1 questions

Unlock every Routing Protocols (Distance Vector, Link State, BGP) question, generate papers, and practice at your own pace.