Answer:
The resultants bits for two strings are 0111 1110
Explanation:
Given details:
two pair of strings are
10010100
11101010
comparing two pair of strings, then perform XOR operation
Rules to follow for XOR
If both the bits are same then resultant is zero 0 and if bits are different resultant is one
XOR operation:
10010100
11 1 01010
-------------
01111110
The resultants bits for two strings are 0111 1110
roster[50] is an array of "students", so roster[9] is a "student". Therefore, roster[9].name is a string.
Hexadecimal numbers are just a convenient representation of binary data. When entered as text, they consist of ASCII characters 0-9 and a-f. The numbers will then have to be converted to binary. This is accomplished by converting to uppercase, subtracting the ASCII offset (48 for 0-9 or 55 for A-F), so that the result is a number between 0 and 15 (inclusive). This can be stored in computer memory to represent 4 bits.
Hexadecimal numbers represent binary numbers in the following way:
hex | binary
0 = 0000
1 = 0001
2 = 0010
3 = 0011
4 = 0100
5 = 0101
6 = 0110
7 = 0111
8 = 1000
9 = 1001
a = 1010
b = 1011
c = 1100
d = 1101
e = 1110
f = 1111
As you can see, no other 4 bit combination exists.
Answer:
The answer is "None of these".
Explanation:
In the given question an array "sales[]" is declared, which contains 50 double type elements, and in the next line, an integer variable j is defined, which uses a for loop. In this question two options is given, in which both are not correct, that can be described as follows:
- In option (i), A loop is defined that, uses variable j which starts with 0 and ends with 48, So total elements are 48 that's why it is not correct.
- In option (ii), A loop will use variable j that, starts with 1 and ends with 49, That's why it is not correct.
