The code of five digits is of the form:
A B C D F
Where A (the first digit) may be any of 9 digits (because 0 is excluded)
B, C, and D, may be each any of 10 digits (0 - 9)
F (the last digit) may be 0, 2, 4, 6 or 8, i.e. 5 different digits.
So the number of different available codes is:
9 * 10 * 10 * 10 * 5 = 45,000.
Answer: 45,000
Answer: Eight
Explanation:
A class B address is 255.255.0.0. We need to borrow 8 bits from the network portion to have atleast 130 host per subnet.
11111111.00000000.00000000.00000000
Answer:
i). Signed magnitude
Five bit representation = 11111
For positive 5 bit representation = 01111 = +15
For negative 5 bit representation = 11111 = -15
ii). One's complement
For positive 5 bit representation = 01111 =+15
For negative 5 bit representation = 10000 = -15
iii). Two's compliment
For positive 5 bit representation = 01111 = -15
For negative 5 bit representation = 10001 = +15
Answer:
Explanation:
The following code is written in Java. Both functions traverse the linkedlist, until it reaches the desired index and either returns that value or deletes it. If no value is found the function terminates.
public int GetNth(int index)
{
Node current = head;
int count = 0;
while (current != null)
{
if (count == index)
return current.data;
count++;
current = current.next;
}
assert (false);
return 0;
}
public int removeNth(int index)
{
Node current = head;
int count = 0;
while (current != null)
{
if (count == index)
return current.remove;
count++;
current = current.next;
}
assert (false);
return 0;
}
