Your most logical answer is B 3. :)
Answer:
I. Algorithms can be written using pseudocode.
II. Algorithms can be visualized using flowcharts.
Explanation:
An algorithm can be defined as a standard formula or procedures which comprises of set of finite steps or instructions for solving a problem on a computer. The time complexity is a measure of the amount of time required by an algorithm to run till its completion of the task with respect to the length of the input.
The two statements which are true about algorithms are;
I. Algorithms can be written using pseudocode. A pseudocode refers to the description of the steps contained in an algorithm using a plain or natural language.
II. Algorithms can be visualized using flowcharts. A flowchart can be defined as a graphical representation of an algorithm for a process or workflow.
Basically, a flowchart make use of standard symbols such as arrows, rectangle, diamond and an oval to graphically represent the steps associated with a system, process or workflow sequentially i.e from the beginning (start) to the end (finish).
<span>The <em><u>message box</u></em> method displays a message to the user and contains one button.</span>
Answer:
0.7
Explanation:
Atenuation is the loss of power of a signal.
Attenuation = output power/input power
= 1.4/2
= 0.7
Here are a few examples:
•] Keep away from windows or vents to prevent it from turning warm.
•] Clean off dust that’s on the computer.
•] Remove all the things that are blocking air to pass to let it cool down.
•] Putting a soft item below the computer is a action that is prohibited as it blocks the airways which causes it to overheat instead put it on a sturdy flat surface to prevent the aforementioned information.
•] To never overcharge your computer too 100% overnight or any time of the day since it overheats and causes battery life to be short, instead put it to charge when you’re conscious while keeping an eye on it, perhaps set a timer/alarm to notify you if you forget.
