Answer:
for (int i = 0; i < a[].length; i++) {
for (int j = 0; j < a[][].length; j++) {
if (a[i][j] > 7)
return a[i][j];
}
}
Explanation:
A nested for-loop can iterate through every row and column and then perform the comparison, returning it if the condition is met.
Answer:
192.168.228.0 255.255.255.224
Explanation:
192.168.228.0 255.255.255.128
subnet mask: defines the host and the network part of a ip
CIDR notation : is the shortened form for subnet mask that uses the number of host bits for defining the host and the network part of a ip
For example: 192.168.228.0 255.255.255.128 has CIDR equivalent of 192.168.228.0\25
To have atleast 20 hosts
20 ≤ (2^x) -2
x ≈5
with 5 host bits, we have 2^5-2 = 30 hosts per subnet
and 2^3 = 8 subnets
To get the subnet mask, we have 3 network bits
1110000 to base 10 = 2^7 + 2^6 +2^5= 224
192.168.228.0 255.255.255.224
Answer:
I think...
Explanation:
because it is a reusable peice of code that accomplishes task
Answer:
26 address bits are needed to address 2∧26 locations.
There are 24 = 16 subarrays.
Explanation:
Considering a 512Mb DRAM, it means it can store 512*2∧20 bits = 2∧9X2∧20 = 2∧29. Since it is a 8 bit word, at a time, 8 bits are accessed. Therefore, the capacity can be re-written as 2∧26X 2∧3 = 2∧26X8
There are a total of 8 banks and within a bank, there are 32 subarrays.
Within each subarray there are 256K locations each of 8 bit size.
Note: " ∧" means raise to power