ISRO CSE 2014 PYQ

OSPF is a link-state interior gateway routing protocol. Routers flood link-state advertisements within an area, build a link-state database, and run Dijkstra’s shortest-path-first algorithm to calculate routes. It is not a distance-vector or path-vector protocol.

Each RAM chip is 8K $\times 4 bits = 8192 \times 4 bits$. There are 4 $\times 6 = 24 chips$, so total capacity is 24 $\times 8192 \times 4 = 786,432 bits = 98,304 bytes$. Because each address identifies one byte, the address space needs ceil(log2(98,304)) = 17 address bits ($2^16$ is too small; $2^17$ is sufficient). Therefore the correct option is 17, not 16.

For segment 2, the base is 1527 and the limit is 498. The requested offset is 1000. Since 1000 exceeds the segment limit, the address is outside the segment’s legal range. The memory-management hardware raises a protection/addressing trap; it must not calculate or fetch a physical address for this invalid logical address.

Use inclusion-exclusion. There are $2^7$ = 128 length-8 strings beginning with 1. There are $2^6$ = 64 strings ending in 00. The overlap (beginning with 1 and ending in 00) has $2^5$ = 32 strings. The union is 128 + 64 - 32 = 160.

The classic five Capability Maturity Model (CMM) levels are Initial, Repeatable, Defined, Managed, and Optimizing. “Measurable” is not one of the named maturity levels. (Some later models use different terminology, but the question explicitly refers to the classic CMM.)