Introduction to Computer Science

COS 101
Outline
 Algorithm
 Categories of algorithm
 Types of algorithm
 Characteristic of algorithm
 Flowcharting
 Flowchart
 Flowcharting symbols, and function
 Algorithms
Informally, an algorithm is any well-defined computational procedure
that takes some value, or set of values, as input and produces some value,
or set of values, as output. An algorithm is thus a sequence of
computational steps that transform the input into the output.
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 take step-by-step define how a
work is to be executed in order to get the expected results.
Algorithms
 Why do we NEED ALGORITHMS
there are several reasons why we use algorithms:
 Efficiency: algorithms can perform tasks quickly and accurately, making them an
essential tool for tasks that require a lot of calculations or data processing.
 Consistency: algorithms are repeatable and produce consistent results every time they
are executed. this is important when dealing with large amounts of data or complex
processes.
 Scalability: algorithms can be scaled up to handle large datasets or complex problems,
which makes them useful for applications that require processing large volumes of data.
 Automation: algorithms can automate repetitive tasks, reducing the need for human
intervention and freeing up time for other tasks.
 Standardization: algorithms can be standardized and shared among different teams or
organizations, making it easier for people to collaborate and share knowledge.
Real-life examples that define the use of algorithms:
• Consider a clock. We know the clock is ticking but how does the manufacturer set
those nuts and bolts so that it keeps on moving every 60 seconds, the minute hand
should move and every 60 minute, the hour hand should move? So to solve this
problem, there must be an algorithm behind it.
• Seen someone cooking your favorite food for you? Is the recipe necessary for
it? Yes, it is necessary as a recipe is a sequential procedure that turns a raw potato
into a chilly potato. This is what an algorithm is: following a procedure to get the
desired output. Is the sequence necessary to be followed? Yes, the sequence is the
most important thing that has to be followed to get what we want.
 Properties of Algorithm
• It should terminate after a finite time.
• It should produce at least one output.
• It should take zero or more input.
• It should be deterministic means giving the same output for the same input case.
• Every step in the algorithm must be effective i.e. every step should do some work.
 CHARACTERISTICS OF AN ALGORITHM
Here is a list of some of the characteristics that every algorithm are as follows;
• Input specified– During the calculation, the input is the information that needs to be changed to create
the output. An algorithm should have at least 0 all-around characterized inputs. Achieving input
exactness requires understanding what kind of information, how much, and what structure the
information should have.
• Output specified– Calculations result in the output of information. Each algorithm ought to have at least
one well-defined output, and the ideal output ought to be coordinated. The exactness of the output also
requires an understanding of what kind of information, how much and how it should be structured.
• Clear and Unambiguous– An algorithm must determine each step, and each step should be obvious in
all its actions and lead to only one meaning. This is the reason why an algorithm should be Clear and
Unambiguous. The details of each step must also be explained (including how to handle errors).
Everything must be quantitative and not subjective.
 CHARACTERISTICS OF AN ALGORITHM conti..
• Feasible– The algorithm should be effective, meaning that it must be feasible
with the resources available to get to the output. There should be no pointless or
excessive advances that would make an algorithm ineffective.
• Independent– It is important to provide step-by-step directions for an algorithm
that are independent of any program code. The end goal ought to be to
anticipate that there may be a sudden spike in demand for any of the various
programming languages.
• Finiteness– Eventually, the algorithm must stop. When the algorithm stops, you
will receive the normal output. Algorithms have a limited number of steps.
Algorithms should not be limitless and should end after a finite number of steps.
It will be pointless for us to develop an algorithm that is limitless.
 TYPES OF ALGORITHMS
• Brute Force Algorithm
• Recursive Algorithm
• Divide and Conquer Algorithm
• Dynamic Programming Algorithm
• Greedy Algorithm
• Backtracking Algorithm
• Randomized Algorithm
• Sorting Algorithm
• Searching Algorithm
• Hashing Algorithm
 Types of Algorithms
1. Brute Force Algorithm: This is the most basic and simplest type of algorithm. A
Brute Force Algorithm is the straightforward approach to a problem i.e., the first
approach that comes to our mind on seeing the problem. More technically it is
just like iterating every possibility available to solve that problem.
Example:
If there is a lock of 4-digit PIN. The digits to be chosen from 0-9 then the brute force will be
trying all possible combinations one by one like 0001, 0002, 0003, 0004, and so on until we
get the right PIN. In the worst case, it will take 10,000 tries to find the right combination.
2. Recursive Algorithm: This type of algorithm is based on recursion. In
recursion, a problem is solved by breaking it into sub-problems of the same type
and calling own self again and again until the problem is solved with the help of a
base condition. Some common problem that is solved using recursive algorithms are
Factorial of a Number. Fibanacci Series, Tower of Hanoi, Depth-First Search (DFS
for Graph, etc.
 Types of Algorithms
3. Divide and Conquer Algorithm: In Divide and Conquer algorithms, the idea is
to solve the problem in two sections, the first section divides the problem into sub-
problems of the same type. The second section is to solve the smaller problem
independently and then add the combined result to produce the final answer to
the problem. Some common problem that is solved using Divide and Conquers
Algorithms are Binary Search, Merge Sort, Quick Sort, etc.
4. Dynamic Programming Algorithms: This type of algorithm is also known as
the memorization technique because in this the idea is to store the previously
calculated result to avoid calculating it again and again. In Dynamic Programming,
divide the complex problem into smaller overlapping subprobems and store the
result for future use. The following problems can be solved using the Dynamic
Programming algorithm Knapsack Problem, Weight job Scheduling, Floyd Warshall
Algorithm. etc.
 Types of Algorithms Continue
• 5. Greedy Algorithm: In the Greedy Algorithm, the solution is built part by part. The
decision to choose the next part is done on the basis that it gives an immediate benefit. It
never considers the choices that had been taken previously. Some common problems that
can be solved through the Greedy Algorithm are Dijkstra Shortest Path Algorithm, Prim’s
Algorithm, Kruskal’s Algorithm, Huffman Coding, etc.
• 6. Backtracking Algorithm: In Backtracking Algorithm, the problem is solved in an
incremental way i.e. it is an algorithmic technique for solving problems recursively by
trying to build a solution incrementally, one piece at a time, removing those solutions that
fail to satisfy the constraints of the problem at any point of time. Some common problems
that can be solved through the Backtracking Algorithm are the Hamiltonian Cycle, M-
Coloring Problem, N Queen Problem, Rat in Maze Problem, etc.
• 7. Randomized Algorithm: In the randomized algorithm, we use a random number.it helps
to decide the expected outcome. The decision to choose the random number so it gives the
immediate benefit Some common problems that can be solved through the Randomized
Algorithm are Quicksort: In Quicksort we use the random number for selecting the pivot.
 Types of Algorithms continue.
• 8. Sorting Algorithm: The sorting algorithm is used to sort data in maybe
ascending or descending order. It is also used for arranging data in an efficient and
useful manner. Some common problems that can be solved through the sorting
algorithm are bubble sort, insertion sort, merge sort, section sort, and quick sort
are examples of the sorting algorithm.
• 9. Searching algorithm: This are the algorithm that is used for searching the
specific key in particular sorted or unsorted data. Some common problems that
can be solved through the Searching Algorithm are Binary search or linear search
is one example of a Searching algorithm.
• 10. Hashing Algorithm: Hashing algorithms work the same as the Searching
algorithm but they contain an index with a key ID i.e. a key-value pair. In hashing,
we assign a key to specific data. Some common problems can be solved through
the Hashing Algorithm in password verification.
 Advantages of Algorithms
• Easy to understand: Since it is a stepwise representation of a solution to a given
problem, it is easy to understand.
• Language Independent: It is not dependent on any programming language, so it
can easily be understood by anyone.
• Debug / Error Finding: Every step is independent / in a flow so it will be easy to
spot and fix the error.
• Sub-Problems: It is written in a flow so now the programmer can divide the tasks
which makes them easier to code.
Disadvantages of Algorithms
• Creating efficient algorithms is time-consuming and requires good logical skills.
• Understanding complex logic through algorithms can be very difficult.
• Branching and Looping statements are difficult to show in Algorithms
 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”.
Example: Draw a flowchart to input two numbers from the user
and display the largest of two numbers.
 Difference between algorithm and flowchart
S/No Algorithm Flowchart
1. An algorithm is a step-by-step procedure to solve a A flowchart is a diagram created with different shapes
problem. to show the flow of data.

2. The algorithm is complex to understand. A flowchart is easy to understand.

3. In the algorithm, plain text is used. In the flowchart, symbols/shapes are used.

4. The algorithm is easy to debug. A flowchart is hard to debug.

5. The algorithm is difficult to construct. A flowchart is simple to construct.

6. The algorithm does not follow any rules. The flowchart follows rules to be constructed.

7. The algorithm is the pseudo-code for the program. A flowchart is just a graphical representation of that
logic.
 Flowchart Symbols

Flowcharts use special shapes to represent different types of actions or steps in a

process. Lines and arrows shows the sequence of the steps, and the relationships
among them. These shapes are known as flowchart symbols.
Common Flowchart Symbols:
• Rectangle Shape - Represents a process
• Oval or Pill Shape - Represents the start or end
• Diamond Shape - Represents a decision
• Parallelogram - Represents input/output
 Benefits of Flowchart
• Gives a clear documentation of a process;
• Allows to define and offers common understanding of processes;
• Helps to build a process visual representation for analysis, discussion, and
communication;
• Allows to identify the scope of the process;
• Allows to trace and analyze the process steps;
• Helps to standardize and find areas for monitoring, improvement and increased
efficiency in a process;
• Allows to find and detach the steps of the process that are not essential;
• Helps in understanding the logic of complex problems;
• Offers a guidance for managers overseeing operations;
• Facilitates communication between programmers and business people;
Benefits of Flowchart