Answer:
subnets=65536
Explanation:
As we know that,
-->interface ID portion of address starts from 64
--> we have 48 network prefix
so
available bits for subnet are = 64-48= 16
so with 16 bit address we can create subnet = 2^16 = 65535
Answer:
nothing
Explanation:
Because the return type of the function is void. void means does not return any thing.
The syntax of the function:
type name( argument_1, argument_2,......)
{
statement;
}
in the declaration the type define the return type of the function.
it can be int, float, double, char, void etc.
For example:
int count( int index);
the return type of above function is int. So, it return integer.
similarly,
void count(int index);
it return type is void. So, it does not return any thing.
Answer:
The output is:
R
M
N
Explanation:
The code snippet print the beginning letter of each word in the given name.
In the for loop snippet:
first the program check if startWord is true and it is true, then it print the value of the character at index 0. Then it check if value of character is empty. If it is empty, startWord is initialized to true else it is initialized to false.
The loop only print a character when the value of i are 0, 8 and 11 which are also the beginning character of a word.
Answer:
b) Bounded Waiting
Explanation:
int currentThread = 1;
bool thread1Access = true;
bool thread2Access = true;
thread1 { thread2 {
While (true) {
While (true)
{
while(thread2Access == true)
{
while(thread1Access == true)
{
If (currentThread == 2) {
If (currentThread == 1)
{
thread1Access = false; thread2Access = false;
While (currentThread == 2);
While (currentThread == 1);
thread1Access = true; thread2Access = true;
} }
/* start of critical section */ /* start of critical section */
currentThread = 2 currentThread = 1
… ...
/* end of critical section */ /* end of critical section */
thread1Access = false; thread2Access = false;
… ...
} }
} }
} }
It can be seen that in all the instances, both threads are programmed to share same resource at the same time, and hence this is the bounded waiting. For Mutual exclusion, two threads cannot share one resource at one time. They must share simultaneously. Also there should be no deadlock. For Progress each thread should have exclusive access to all the resources. Thus its definitely the not the Progress. And hence its Bounded waiting.
