Answer:
Explanation:
The following Python code is a function that takes in an array as a parameter, it then loops through the array determining if the element is divisible by 3. If it is it leaves it alone, otherwise it changes it to a 0. Then ouputs the array. A test case is shown in the attached image below using a sample array.
def divisible_by_three(array):
for x in array:
if x % 3 == 0:
pass
else:
array[array.index(x)] = 0
return array
Answer: (A) Tactical support
Explanation:
GIS is the global information system in which the data is delivered worldwide in the form of information system. The global information system achieve long term goals in an organization.
- The tactical support is used in the global information system for concentrating the activities on the medium range in an organization.
- The tactical support is one of the effective way to producing the desirable result and also achieve the main strategic objective.
Therefore, Option (A) is correct.
I would suggest the answer would be both A and D, mail merge is used to specify different field for different recipients.
Answer:
When the element is not found we return -1.
Explanation:
When we use binary search we use BinarySearch() method of an array or list type when the element is found we return the index of the element if found if the element is not found we return -1.
We can decode this value since it is less than 0 and the indexing of arrays and lists starts with 0 upto the size-1.So -1 index is not present in the array or list.We have to check if the index is < 0 then the element is not present in the array or list.
for ex:-
if(index<0)
{
System.out.println("Element is not present in the array");
}
Answer:
Explanation:
The following code is written in Java. Both functions traverse the linkedlist, until it reaches the desired index and either returns that value or deletes it. If no value is found the function terminates.
public int GetNth(int index)
{
Node current = head;
int count = 0;
while (current != null)
{
if (count == index)
return current.data;
count++;
current = current.next;
}
assert (false);
return 0;
}
public int removeNth(int index)
{
Node current = head;
int count = 0;
while (current != null)
{
if (count == index)
return current.remove;
count++;
current = current.next;
}
assert (false);
return 0;
}
