Networks Flashcards
7 cards from real GATE practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 7 Networks flashcards as text
In a network with n nodes, the maximum number of edges in a simple undirected graph is:
Answer: n(n-1)/2
A simple undirected graph can have at most one edge between any two nodes, giving n(n-1)/2 edges.
Which routing algorithm guarantees the shortest path by exploring nodes in order of their cumulative distance from the source?
Answer: Dijkstra's algorithm
Dijkstra's algorithm uses a greedy approach with a priority queue to always expand the closest unvisited node, guaranteeing shortest paths in graphs with non-negative weights.
A token ring network with 4 stations has a token rotation time of 40 ms. If each station transmits for at most 10 ms, what is the maximum efficiency?
Answer: 50%
With 4 stations each transmitting 10 ms in a 40 ms rotation, total transmission = 40 ms, but overhead means efficiency = 4×10/(4×10 + token overhead); assuming 40 ms total cycle, efficiency = 40/80 = 50%.
The Nyquist theorem states that the maximum data rate of a noiseless channel with bandwidth B Hz and M discrete signal levels is:
Answer: 2B log2(M)
Nyquist's formula: Maximum data rate = 2B log2(M) bits per second for a noiseless channel.
Which field in the IPv4 header is used to prevent packets from circulating indefinitely in the network?
Answer: Time to Live (TTL)
The TTL field is decremented by each router, and a packet is discarded when TTL reaches zero, preventing infinite looping.
In TCP slow start, the congestion window (cwnd) grows:
Answer: Exponentially, doubling each RTT
In TCP slow start, cwnd doubles each RTT (one MSS added per ACK), leading to exponential growth until the slow start threshold is reached.
A subnet mask of 255.255.255.192 means the subnet has how many usable host addresses?
Answer: 62
255.255.255.192 = /26, giving 2^6 = 64 addresses; subtracting network and broadcast gives 62 usable hosts.