A packet with the destination IP address 145.36.109.70 arrives at a router whose routing table is shown. Which interface will the packet be forwarded to?
A packet with the destination IP address 145.36.109.70 arrives at a router whose routing table is shown. Which interface will the packet be forwarded to?
Show Hint
- E1
- E2
- E3
- E5
The Correct Option is A
Solution and Explanation
1. Convert the IP address to binary form:
The given IP address is \( 145.36.109.70 \), and in binary form it is: \[ 145 = 10010001, \quad 36 = 00100100, \quad 109 = 01101101, \quad 70 = 01000110 \] So, the binary form of \( 145.36.109.70 \) is: \[ 10010001.00100100.01101101.01000110 \]
2. Check against the routing table:
For Subnet
145.36.0.0/16:
The subnet address
145.36.0.0 with the subnet mask /16 covers addresses from 145.36.0.0 to 145.36.255.255.
The given IP address
145.36.109.70 falls within this range. Therefore, it matches this subnet.
3. Conclusion:
Since the IP address \( 145.36.109.70 \) falls under the subnet
145.36.0.0/16, it will be forwarded to Interface E1.
Thus, the correct answer is \( \boxed{A} \).
Top Questions on Computer Architecture
- Given Data:
- Two processors: \( M_1 \) and \( M_2 \)
- Four processes: \( P_1, P_2, P_3, P_4 \)
- CPU bursts: \( P_1 = 20 \), \( P_2 = 16 \), \( P_3 = 25 \), \( P_4 = 10 \)
- Priority order for \( M_1 \): \( P_1 > P_3 > P_2 > P_4 \)
- Priority order for \( M_2 \): \( P_2 > P_3 > P_4 > P_1 \)
- Scheduling: Non-preemptive priority scheduling
Step 1: Assigning Processes to Processors
At \( t = 0 \), both processors are free. The highest-priority process for each processor is scheduled:
- \( M_1 \) gets \( P_1 \) (highest priority on \( M_1 \), burst = 20 ms).
- \( M_2 \) gets \( P_2 \) (highest priority on \( M_2 \), burst = 16 ms).
Step 2: Scheduling Remaining Processes
- \( P_2 \) finishes at \( t = 16 \), so \( M_2 \) picks the next highest-priority process, \( P_3 \) (burst = 25 ms).
- \( P_1 \) finishes at \( t = 20 \), so \( M_1 \) picks \( P_4 \) (burst = 10 ms).
- \( P_4 \) finishes at \( t = 30 \), and \( P_3 \) finishes at \( t = 41 \).
Step 3: Calculate Waiting Times
- \( P_1 \) starts at 0, so waiting time = \( 0 \) ms.
- \( P_2 \) starts at 0, so waiting time = \( 0 \) ms.
- \( P_3 \) starts at 16, so waiting time = \( 16 \) ms.
- \( P_4 \) starts at 20, so waiting time = \( 20 \) ms.
Step 4: Compute Average Waiting Time
\[ \text{Average waiting time} = \frac{(0 + 0 + 16 + 20)}{4} = \frac{36}{4} = 9 \text{ ms}. \]
Final Answer: The average waiting time of the processes is \( 9 \) milliseconds.- GATE CS - 2025
- Computer Science and IT Engineering
- Computer Architecture
- A processor has 64 general-purpose registers and 50 distinct instruction types. An instruction is encoded in 32-bits. What is the maximum number of bits that can be used to store the immediate operand for the given instruction?
- GATE CS - 2025
- Computer Science and IT Engineering
- Computer Architecture
- Flip flops can be generated using
- TANCET - 2024
- Computer Awareness
- Computer Architecture
- Which is the layer of a computer system between the hardware and the user program?
- TANCET - 2024
- Computer Awareness
- Computer Architecture
- The central processing unit consist of:
- IPU CET - 2023
- Computer Awareness
- Computer Architecture
Questions Asked in GATE CS exam
The value printed by the given C program is __________ (Answer in integer).
- GATE CS - 2025
- Programming and Data Structures
Refer to the given 3-address code sequence. This code sequence is split into basic blocks. The number of basic blocks is __________. (Answer in integer)
1001: i = 1
1002: j = 1
1003: t1 = 10i
1004: t2 = t1+j
1005: t3 = 8t2
1006: t4 = t3-88
1007: a[t4] = 0.0
1008: j = j+1
1009: if j <= 10 goto 1003
1010: i = i+1
1011: if i <= 10 goto 1002
1012: i = 1
1013: t5 = i-1
1014: t6 = 88t5
1015: a[t6] = 1.0
1016: i = i+1
1017: if i <= 10 goto 1013- GATE CS - 2025
- Memory hierarchy
- GATE CS - 2025
- Programming in C
Suppose in a multiprogramming environment, the following C program segment is executed. A process goes into the I/O queue whenever an I/O related operation is performed. Assume that there will always be a context switch whenever a process requests an I/O, and also whenever the process returns from an I/O. The number of times the process will enter the ready queue during its lifetime (not counting the time the process enters the ready queue when it is run initially) is _________ (Answer in integer).
- GATE CS - 2025
- Programming in C
- In a double hashing scheme, \( h_1(k) = k \mod 11 \) and \( h_2(k) = 1 + (k \mod 7) \) are the auxiliary hash functions. The size \( m \) of the hash table is 11. The hash function for the \( i \)-th probe in the open address table is \( [h_1(k) + i \cdot h_2(k)] \mod m \). The following keys are inserted in the given order: 63, 50, 25, 79, 67, 24. The slot at which key 24 gets stored is:
- GATE CS - 2025
- Programming and Data Structures