The first one is d the second one is true the third one is false
Answer:
- common = []
- num1 = 8
- num2 = 24
- for i in range(1, num1 + 1):
- if(num1 % i == 0 and num2 % i == 0):
- common.append(i)
- print(common)
Explanation:
The solution is written in Python 3.
Firstly create a common list to hold a list of the common factor between 8 and 24 (Line 1).
Create two variables num1, and num2 and set 8 and 24 as their values, respectively (Line 3 - 4).
Create a for loop to traverse through the number from 1 to 8 and use modulus operator to check if num1 and num2 are divisible by current i value. If so the remainder of both num1%i and num2%i will be zero and the if block will run to append the current i value to common list (Line 6-8).
After the loop, print the common list and we shall get [1, 2, 4, 8]
Health care robots the key word, being "robots" aren't able to act as we can as humans.
Robots and systems lack the emotional skills that we as humans have, they are not intuitive.
There are many risks in using robots for health care, although, "health care" is a vague term, so I'll cover a few in general:
- Doctor/patient confidentiality is risked when using robots to handle personal medical matters, systems are never 100% secure.
- Robots and systems cannot emphasise with patients and will make decisions based on logic and theoretics, not emotionally - for example, if a patient is in a state of bad mental health, a robot will not be able to effectively analyse the right methods to take.
- The collection, storage and passing-on of patient information is risked as system encryption is never guaranteed.
Answer:
focuses on a certain subject
Explanation:
it means that it focuses on that one subject and none others
Hope it helps c:
Answer:
boolean isEven = false;
if (x.length % 2 == 0)
isEven = true;
Comparable currentMax;
int currentMaxIndex;
for (int i = x.length - 1; i >= 1; i--)
{
currentMax = x[i];
currentMaxIndex = i;
for (int j = i - 1; j >= 0; j--)
{
if (((Comparable)currentMax).compareTo(x[j]) < 0)
{
currentMax = x[j];
currentMaxIndex = j;
}
}
x[currentMaxIndex] = x[i];
x[i] = currentMax;
}
Comparable a = null;
Comparable b = null;
if (isEven == true)
{
a = x[x.length/2];
b = x[(x.length/2) - 1];
if ((a).compareTo(b) > 0)
m = a;
else
m = b;
}
else
m = x[x.length/2];
