Algorithm:
To write a logical step-by-step method to solve the problem is called an algorithm, in other words, an algorithm is a procedure for solving problems. In order to solve a mathematical or computer problem, this is the first step of the procedure. An algorithm includes calculations, reasoning and data processing. Algorithms can be presented by natural languages, pseudocode, and flowcharts, etc.
The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.
Let’s take a look at an example for a better understanding. As a programmer, we are all aware of the Linear Search program. (Linear Search)
Algorithm of linear search :
1. Start from the leftmost element of arr[] and
one by one compare x with each element of arr[].
2. If x matches with an element, return the index.
3. If x doesn’t match with any of elements, return -1.
Here, we can see how the steps of a linear search program are explained in a simple, English language.
Flowchart:
A 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 that are connected among them to indicate the flow of information and processing. The process of drawing a flowchart for an algorithm is known as “flowcharting”.
A flowchart is the graphical or pictorial representation of an algorithm with the help of different symbols, shapes and arrows in order to demonstrate a process or a program. With algorithms, we can easily understand a program. The main purpose of a flowchart is to analyze different processes. Several standard graphics are applied in a flowchart:
Terminal Box - Start / End
Input / Output
Process / Instruction
Decision
Connector / Arrow
The graphics above represent different parts of a flowchart. The process in a flowchart can be expressed through boxes and arrows with different sizes and colors. In a flowchart, we can easily highlight a certain element and the relationships between each part.
Example: Draw a flowchart to input two numbers from the user and display the largest of two numbers
For more references find the below link:
Questions on Algorithms
This set of Computer Fundamentals Multiple Choice Questions & Answers (MCQs) focuses on “Algorithms”.
1. The word ____________comes from the name of a Persian mathematician Abu Ja’far Mohammed ibn-i Musa al Khowarizmi.
a) Flowchart
b) Flow
c) Algorithm
d) Syntax
2. In computer science, algorithm refers to a special method usable by a computer for the solution to a problem.
a) True
b) False
3. This characteristic often draws the line between what is feasible and what is impossible.
a) Performance
b) System Evaluation
c) Modularity
d) Reliability
4. The time that depends on the input: an already sorted sequence that is easier to sort.
a) Process
b) Evaluation
c) Running
d) Input
5. Which of the following is incorrect?
Algorithms can be represented:
a) as pseudo codes
b) as syntax
c) as programs
d) as flowcharts
6. When an algorithm is written in the form of a programming language, it becomes a _________
a) Flowchart
b) Program
c) Pseudo code
d) Syntax
7. Any algorithm is a program.
a) True
b) False
8. A system wherein items are added from one and removed from the other end.
a) Stack
b) Queue
c) Linked List
d) Array
9. Another name for 1-D arrays.
a) Linear arrays
b) Lists
c) Horizontal array
d) Vertical array
10. A data structure that follows the FIFO principle. a) Queue b) LL c) Stack d) Union
This set of Computer Fundamentals Multiple Choice Questions & Answers (MCQs) focuses on “Flowcharts”.
1. The symbol denotes _______
a) I/O
b) Flow
c) Terminal
d) Decision
2. In computer science, algorithm refers to a pictorial representation of a flowchart.
a) True
b) False
3. The process of drawing a flowchart for an algorithm is called __________
a) Performance
b) Evaluation
c) Algorithmic Representation
d) Flowcharting
4. Actual instructions in flowcharting are represented in __________
a) Circles
b) Boxes
c) Arrows
d) Lines
5. The following box denotes?
a) Decision
b) Initiation
c) Initialization
d) I/O
6. A box that can represent two different conditions.
a) Rectangle
b) Diamond
c) Circle
d) Parallelogram
7. There should be certain set standards on the amount of details that should be provided in a flowchart.
a) True
b) False
8. A detailed flowchart is called ______
a) Stack
b) Macro
c) Micro
d) Union
9. Which of the following is not an advantage of a flowchart?
a) Better communication
b) Efficient coding
c) Systematic testing
d) Improper documentation
10. A flowchart that outlines the main segments of a program. a) Queue b) Macro c) Micro d) Union
תגובות