FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -Input: The inputs used in an algorithm must come from a specified set of elements, where the amount and type of inputs are specified. Output: The algorithm must specify the output and how it is related to the input. Definiteness: The steps in the algorithm must be clearly defined and detailed.

Detailed explanation-2: -We can express an algorithm many ways, including natural language, flow charts, pseudocode, and of course, actual programming languages. Natural language is a popular choice, since it comes so naturally to us and can convey the steps of an algorithm to a wide audience.

Detailed explanation-3: -Input. An algorithm has zero or more inputs, taken or collected from a specified set of objects. Output. An algorithm has one or more outputs having a specific relation to the inputs.

Detailed explanation-4: -Flowchart is a graphical representation of an algorithm. Programmers often use it as a program-planning tool to solve a problem. It makes use of symbols which are connected among them to indicate the flow of information and processing.

Detailed explanation-5: -An algorithm has input values from a specified set. From each set of input values, an algorithm produces output values from a specified set. The output values are the solution to the problem. The steps of an algorithm must be defined precisely.