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).
A Would be the answer, Sir.!
Answer:
yes it is...................
Answer:
1: work ethic/presentation.
2: communication.
3: adaptability.
4: creativity.
(these are all guesses so i'm not 100% sure)
Explanation:
Answer : True
Explanation: Vectors can hold, data of the same type and can automatically expand accordingly and change it’s size. The date stored in vectors should be linear.
- The syntax for vector is vector<int>v;
- Mostly this is used in C++ as an alternative to arrays
- If you want to use vector in your program then define it in the header first i.e.
#include <vector>
- Push back is a function, that is used to insert an element into the vector
- Pop back removes the element from the vector
