Answer:
I am pretty confident that the answer is 6
Explanation:
3+3=6
The NETWORK mask is and'ed with the IP address to get the network number.
Example:
192.168.1.1 & 255.255.255.0 = 192.168.1.0/24
It's worth the effort to do this in binary, it makes much more sense.
Answer:
Running time of algorithm is O(n).
Explanation:
n is power of 2
n =2,4,8,16,32,...................................
A is an array having n elements
B is an array of size 0 to (n/2)-1
if n=4 B then (4/2)-1 =1 So B has size 2
for(i=0;i<=(n/2)-1;++)
{
B[i]=A[2i]+A[2i+1];
}
This for loop will run n/2 times so complexity in terms of Big Oh is O(n/2) =O(n)
Running time of algorithm is O(n).
It uses boolean operators and key words to match the correct web pages to the search request.
