Exams › GATE › Technical
The forwarding table of a router is shown below.
Subnet Number | Subnet Mask | Interface ID
200.150.0.0 | 255.255.0.0 | 1
200.150.64.0 | 255.255.224.0 | 2
200.150.68.0 | 255.255.255.0 | 3
200.150.68.64 | 255.255.255.224 | 4
Default | 0
A packet addressed to a destination address 200.150.68.118 arrives at the router. It will be forwarded to the interface with ID _________.
- 1
- 2
- 3
- 4
Correct answer: 3
Solution
200.150.68.118 matches 200.150.68.0/24 (interface 3) but not 200.150.68.64/27 (range .64-.95, and 118>95). The longest matching prefix is the /24 entry, so it is forwarded to interface 3 (index 2).
Related GATE Technical questions
- Which one of the following sequences when stored in an array at locations A[1],..., A[10] forms a max-heap?
- Let SLLdel be a function that deletes a node in a singly-linked list given a pointer to the node and a pointer to the head of the list. Similarly, let DLLdel be another function that deletes a node in a doubly-linked list given a pointer to the node and a pointer to the head of the list. Let n denote the number of nodes in each of the linked lists. Which one of the following choices is TRUE about the worst-case time complexity of SLLdel and DLLdel?
- Consider the Deterministic Finite-state Automaton (DFA) A shown below. The DFA runs on the alphabet {0,1}, and has the set of states {s,p,q,r}, with s being the start state and p being the only final state.
Which one of the following regular expressions correctly describes the language accepted by A?
- Which one of the options given below refers to the degree (or arity) of a relation in relational database systems?
- Suppose two hosts are connected by a point-to-point link and they are configured to use Stop-and-Wait protocol for reliable data transfer. Identify in which one of the following scenarios, the utilization of the link is the lowest.
- An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let k be the number of keys, m be the number of slots in the hash table, and k > m.
Which one of the following is the best hashing strategy to counteract the adversary?
⚔️ Practice GATE Technical free + battle 1v1 →