Answer:
lean media
Explanation:
Dr. Thomas uses email as a medium of lean media to convey messages.
Lean media may be defined as the source of conveying messages that are short or of lean capacity. It is meant for instant messages and message and information that is not considered to be of out most importance. Whereas a rich media is a video chat or face to face communication.
Dr. Thomas send emails to her patients to follow up with them and also encourages her patients to call her for appointments or any questions. She uses email as a source of lean media for this communication.
What is the subject about?
Answer:
intelligence
Explanation:
According to my research on information technology, I can say that based on the information provided within the question if this happens then we can say that the computer has attained intelligence. This is because this is a test developed by Alan Turing in 1950, in order to observe a machine's ability to exhibit intelligent behavior equal to, or indistinguishable from, that of a human.
I hope this answered your question. If you have any more questions feel free to ask away at Brainly.
Answer:
THANK YOU SO MUCH! I AM ON MY CHROME BOOK RIGHT NOW AND WAS HESITATING TO DOWNLOAD THE UPDATE!
Explanation:
Answer:
Flowchart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" or "true" (more accurately, the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
Explanation:
Flowchart of an algorithm (Euclid's algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≥ A yields "yes" or "true" (more accurately, the number b in location B is greater than or equal to the number a in location A) THEN, the algorithm specifies B ← B − A (meaning the number b − a replaces the old b). Similarly, IF A > B, THEN A ← A − B. The process terminates when (the contents of) B is 0, yielding the g.c.d. in A. (Algorithm derived from Scott 2009:13; symbols and drawing style from Tausworthe 1977).
