Answer:
b. The names in the list should be in alphabetical order.
Explanation:
A binary search is an algorithm used for searching for an item in a list or array. The algorithm first sorts the data structure into order and then divides it into halves. If the searched item is less than the middle item in the list, then the algorithm searches for the target in the first half, else, in the second half. This reduces the time complexity of the search.
Answer:
Explanation:
(i) L1+L2 Error:
L1=[10,12,14]
L2=[20,22,24] # {n. 2 delete}
L1+L2
ans =
30 34 38
(ii) L1*2
ans =
20 24 28
(iii) L1
L1 =
10 12 14
Answer:
The following are the description of storing bits into Hard-disk.
Explanation:
As we know computer only know the binary language, that is in the form of zero's and once's "0's and 1's". In the hard drive, it requires a magnetically covered rotating disc, that's "head" passes over its platter.
- It marked 0's and 1's on the platter as tiny electronic areas in the north.
- Its head goes to the very same location to read its information again, the north and south places pass there and assume from the 0s and 1s which are contained.
Answer:
B.) removing the saturation in a photograph intended as a magazine cover page
