The answers are:
C
A
Hope it helps :)
Answer:
Initially if x = a = 2437 and y = 875, condition (1) that is x>y is true and output would be x = 1562 with y = 87
Explanation:
According to pseudo code the code will run until x becomes equal to y. Initially if x = a = 2437 and y = 875, condition (1) that is x>y is true. So next step would be x=x-y and output would be x = 1562 with y = 875. With initial values x = a = 2437 and y = 875, x becomes equal to y after 21 iterations and output is x=y=1
X Y
- 2437 875
- 1562 875
- 687 875
- 687 188
- 499 188
- 311 188
- 123 188
- 123 65
- 58 65
- 58 7
- 51 7
- 44 7
- 37 7
- 30 7
- 23 7
- 16 7
- 9 7
- 2 7
- 2 5
- 2 3
- 2 1
- 1 1
The graph would have to be pointing completely down to be falling freely.
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.
