Answer:
- def getLargest(number_list):
- new_list = []
-
- for x in number_list:
- if(isinstance(x, int)):
- new_list.append(x)
-
- largest = max(new_list)
-
- return largest
Explanation:
Firstly, create a function <em>getLargest()</em> that take one input parameter, <em>number_list</em>.
The function will filter out the float type number from the list by using <em>isinstance() </em>method (Line 5). This method will check if a current x value is an integer. If so, the x value will be added to <em>new_list</em>.
Next, use Python built-in <em>max</em> function to get the largest integer from the <em>new_list </em>and return it as output.
Options :
A.) s1 < s2
B.) s1 <= s2
C.) s1.compareTo(s2) == −1
D.) s2.compareTo(s1) < 0
E.) s1.compareTo(s2) < 0
Answer: E.) s1.compareTo(s2) < 0
Explanation: Lexicographical ordering simply means the arrangement of strings based on the how the alphabets or letters of the strings appear. It could also be explained as the dictionary ordering principle of words based on the arrangement of the alphabets. In making lexicographical comparison between strings, the compareTo () method may be employed using the format below.
If first string = s1 ; second string = s2
To compare s1 with s2, the format is ;
s1.compareTo(s2) ;
If s1 comes first, that is, before s2, the method returns a negative value, that is a value less than 0 '< 0', which is the case in the question above.
If s2 comes first, that is, before s1, the method returns a positive value, that is a value greater than 0 '> 0'.
If both are s1 and s2 are the same, the output will be 0.
The answer to your question is b
Answer:
K1 ⊕ K2 = 9
Explanation:
Since 5 ⊕ K = 12, K must be 5 ⊕ 12 = 9.
But there are supposedly two encryptionkeys, we cannot know their individual value, only that K1 ⊕ K2 = 9.
That makes this a bit weird question.
