Explanation:
Simplify the Boolean expression (AB(C + BD) + AB]CD.
Computer science certification, Linux professionalism, Java certification, Python certification
Answer:
The answer is option A.
Explanation:
Negative numbers can be found by binary search, this makes option B incorrect.
Unsorted and randomized lists are also not things that support a binary search, options C and D are incorrect.
Binary search uses a technique where the middle element of the list is located and used to determine whether the search should be done within the lower indexed part of the list or the higher. So for a list to be binary search-able, it should be sorted and not randomized.
The answer is A.
I hope this helps.
Answer:
IPO means Input - Process - Output
Explanation:
The IPO model means that a computer program is given an input to process, it processes the given input and return an output as the result.
When numbers are divided, the integer portion is kept and the remainder is disregarded (meaning 10/9 would return 1). Following this format, we get the answer of <span>6 6 6 3 7 7 9 5 8 8.
I also see that this program can be optimized because you use the same for loop twice, and both of them manipulate list elements in some way. A more optimized program would be:
</span><span>int a [] = {64 , 66 , 67 , 37 , 73 , 70 , 95 , 52 , 81 , 82};
for (int i = 0; i < a.length; i++) {
a[i] = a[i] / 10;
</span>System.out.print(a[i] + " ");<span>
}
Or maybe you don't need to store the list values for later on. You could do:
</span>for (int i = 0; i < a.length; i++) {
System.out.print(a[i] / 10 + " ");
}
In any situation, your answer is choice 2.
