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).
Rest your fingers gently on the home row or home keys.
Rest your palms on the keyboard.
Relax your fingers.
All the above are proper keyboard techniques apart from slouch in your chair. It is always recommended to sit up straight with your feet positioned on the floor for balance. Do not cross. Center your body to the H key and have your elbows at sides and bent about 90 degrees. Use correct fingering and deploy touch typing. These and many others will help develop optimal speed and accuracy and help prevent the development of stress injury.
Answer:
B
Explanation:
the software needs to share thus should be networked
..............................................nice !