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).
Answer:
By saving it in the hard drive.
Hope I helped!
Answer:
Explanation:
PDF or (Portable Document Format) this is a format standard to store, design, administrate, this standard include bit maps format, image format, objects, and text format, all these formats to show pages quickly, PDF is a standard and for the devices can show this format, devices like prints, laptops, or even cellphones.
Scan the tables to make a digital copy of them
