G

Cruz, Karishmah L.
11-12-2019
Darwin - 8
Maam Tayamora
Homework # 1
3rd Quarter

1. What is Algorithm?
- An algorithm is a procedure or formula for solving a problem, based on
conducting a sequence of specified actions. It is commonly used for data
processing, calculation and other related computer and mathematical operations. It
is also used to manipulate data in various ways, such as inserting a new data item,
searching for a particular item or sorting an item.

2. Give the type of Algorithm and Define each part.

Recursive Algorithms
- Solves the base case directly and then recurs with a simpler or easier input every
time (A base value is set at the starting for which the algorithm terminates). It is
use to solve the problems which can be broken into simpler or smaller problems of
same type.

Dynamic Programming Algorithm

- A dynamic programming algorithm also known as dynamic optimization algorithm,
remembers the past result and uses them to find new result means it solve complex
problems by breaking it down into a collection of simpler subproblems, then solving
each of those subproblems only once, and storing their solution for future use
instead of recomputing their solutions again.

Backtracking Algorithm
- Backtracking 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.

Divide and Conquer Algorithm

- Divide and conquer consist of two parts, first of all it divides the problems into
smaller subproblems of the same type and solve them recursively and then
combine them to form the solution of the original problem

Greedy Algorithm
- Greedy algorithm is an algorithm that solves the problem by taking optimal
solution at the local level (without regards for any consequences) with the hope of
finding optimal solution at the global level. It is used to find the optimal solution but
it is not necessary that you will definitely find the optimal solution by following this
algorithm.

Brute Force Algorithm

- A brute force algorithm simply tries all the possibilities until a satisfactory solution
is found. Such types of algorithm are also used to find the optimal solution as it
checks all the possible solutions and also used for finding a satisfactory solution,
simply stop as soon as a solution of the problem is found.

Randomized Algorithm
- A randomized algorithm uses a random number at least once during the
computation to make a decision. It is typically used to reduce either the running
time, or time complexity; or the memory used, or space complexity.

3. What are the 8 basic symbols of flowchart?

- Arrow - Process - Decision - Off-page Connector
- Terminal - Preparation - On-Page Connector - Input / Output

4. Give the functions and draw / print each symbol

Arrow / Flowline
- It connects the symbol in a flowchart and guides the reader through the sequence
of process steps. Flow moves in the direction in which the arrow points

Terminal
- Represented as circles, ovals, and stadiums. It signal the start and end of a
process. It usually contain words inside such as “Start“ or “End” and “submit
inquiry” or “receive product”.

Process
- Represented as rectangles. It is the instructions or internal operations inside the
processor or memory. This shape is used to show that something is performed.

Decision
- Represented as a diamond. Shows a conditional operation that determines which
one of the two paths the program will take. The operation is usually a Yes/No
question or True/False test

Input / Output
- Represented as a parallelogram. Indicates the process of inputting and outputting
data, as in entering data or displaying results.

Preparation
- Represented as a elongated hexagon. Represents a set-up to another step in the
process.
On-page Connector
- Represented by a small circle with a letter inside. Pairs of labeled connectors
replace long or confusing lines on a flowchart page.

Off-page Connector
- Represented as a home plate-shaped pentagon. A labeled connector for use when
the target is on another page.

References:
https://www.techopedia.com/definition/3739/algorithm
https://whatis.techtarget.com/definition/algoritm
https://www.geeksforgeeks.org/backtracking-introduction/
https://www.includehelp.com/data-structure-tutorial/algorithm-and-its-types.aspx
https://brilliant.org/wiki/randomized-algorithms-overview/
https://courses.lumenlearning.com/ivytech-sdev-dev-1/chapter/flowchart-symbols-8-
3-13/