Question:
Which one of the following CIDR profix exactly represent the range of IP addresses 10.12.2.0 to 10.12.3.255?
Which one of the following CIDR profix exactly represent the range of IP addresses 10.12.2.0 to 10.12.3.255?
Updated On: Feb 12, 2024
- 10.12.2.0/24
- 10.12.2.0/23
- 10.12.2.0/22
- 10.12.0.0/22
Hide Solution
Verified By Collegedunia
The Correct Option is B
Solution and Explanation
The correct option is (B): 10.12.2.0/23
Was this answer helpful?
0
0
Top Questions on CIDR Notation
Consider routing table of an organization's router shown below:\[\begin{array}{|c|c|c|} \hline \textbf{Subnet Number} & \textbf{Subnet Mask} & \textbf{Next Hop} \\ \hline \text{12.20.164.0} & \text{255.255.252.0} & \text{R1} \\ \hline \text{12.20.170.0} & \text{255.255.254.0} & \text{R2} \\ \hline \text{12.20.168.0} & \text{255.255.254.0} & \text{Interface 0} \\ \hline \text{12.20.166.0} & \text{255.255.254.0} & \text{Interface 1} \\ \hline \text{default} & \text{R3} \\ \hline \end{array}\]Which of the following prefixes in CIDR notation can be collectively used to correctly aggregate all of the subnets in the routing table?
- GATE CS - 2022
- Computer Networks
- CIDR Notation
Questions Asked in GATE CS exam
- With respect to a TCP connection between a client and a server, which of the following is true?
- GATE CS - 2026
- Computer Networks
- Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?
- GATE CS - 2026
- Database Management Systems
- Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?
- GATE CS - 2026
- Theory of Computations
- A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
- GATE CS - 2026
- Computer Organization and Architecture
- Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of:
- GATE CS - 2026
- Computer Organization and Architecture
View More Questions