Answer:
Sorted Array A { } = { 1, 4, 23, 32, 34, 34, 67, 78, 89, 100 }
Explanation:
Binary tree is drawn given that the binary tree do not follow both minimum heap and maximum heap property, therefore, it is not a heap.
See attached picture.
Answer:
D) Hybrid Attack
Explanation:
This type of attack is a blend of both a dictionary and brute force attack. The meaning of this is, while a dictionary attack method would capture a wordlist of passwords, the brute-force attack would be applied to each of password captured.
I'll say something is wrong with the ink or the papers jammed
The binary representation of +3997 is 1111 1001 1101.
In one's complement this is simply adding a sign bit and inverting all the bits:
1 0000 0110 0010
The two's complement is the one's complement plus 1:
1 0000 0110 0011
That's 13 bits. Normally the sign bit would be at an 8, 16 or 32,... bit boundary.
For -436 it's 10 0100 1100 and 10 bits
Answer:
c. Math.pow(-2.0,15.0) to (Math.pow(2.0,15.0) -1).
Explanation:
short represents a 16-bit signed integer. short is used to save memory because it occupies less space than integers where integers occupy 4 bytes short occupies 2 bytes.
Since it is signed so first bit is used to represent the sign if 0 then positive and 1 then the integer is negative.We are left with 15 bits.
So the range is -2¹⁵ to 2¹⁵-1.
Hence the answer is option c.
