Computer Fundamentals

Table of Contents
Prelim Topics Page
Chapter 01 Introduction to Algorithm (History and Role) 01
Chapter 02 02
Chapter 03 03
Chapter 04 04
Chapter 05 05
Chapter 01:

Introduction to 

Algorithm
History  Scalability: It aids in your understanding of
 The term “algorithm” is derived from the scalability. When you have a sizable real-
name of a Persian mathematician world problem, you must break it down into
Muhammad ibn Musa al-Khwarizmi, who small steps to analyze it quickly.
lived in the 9th century and was dubbed as  Performance: The real world is
the father of algebra. challenging to break down into smaller
 Set of commands that must be followed for steps. If a problem can be easily divided
a computer to perform calculations or other into smaller steps, it indicates that the
operations. problem is feasible.
 Finite set of instructions carried out in  An algorithm provides a step-by-step
specific order to perform a specific task. procedure on how a solution can be derived.
It also acts as a blueprint on how a program
 Often used in mathematics, computer
will start and end, including what processes
science, data science, and so forth.
and computations are involved.
 Is simple logic to a problem represented as
an informal description in the form of a
flowchart or pseudocode (a detailed yet Types of Algorithms
readable description of what a computer  Brute Force Algorithm: A straightforward
program or algorithm should do.) approach that exhaustively tries all possible
solutions, suitable for small problem
How do algorithms work? instances but may become impractical for
larger ones due to its high time complexity.
 Input: Algorithms take input data, which
 Recursive Algorithm: A method that
can be in various formats, such as numbers,
breaks a problem into smaller, similar
text, or images.
subproblems and repeatedly applies itself to
 Processing: The algorithm processes the
solve them until reaching a base case,
input data through a series of logical and
making it effective for tasks with recursive
mathematical operations, manipulating and
structures.
transforming it as needed.
 Encryption Algorithm: Utilized to
 Output: After the processing is complete,
transform data into a secure, unreadable
the algorithm produces an output, which
form using cryptographic techniques,
could be a result, a decision, or some other
ensuring confidentiality and privacy in
meaningful information.
digital communications and transactions.
 Efficiency: A key aspect of algorithms is
 Backtracking Algorithm: A trial-and-error
their efficiency, aiming to accomplish tasks
technique used to explore potential
quickly and with minimal resources.
solutions by undoing choices when they
 Optimization: Algorithm designers
lead to an incorrect outcome, commonly
constantly seek ways to optimize their
employed in puzzles and optimization
algorithms, making them faster and more
problems.
reliable.
 Searching Algorithm: Designed to find a
 Implementation: Algorithms are
specific target within a dataset, enabling
implemented in various programming
efficient retrieval of information from
languages, enabling computers to execute
sorted or unsorted collections.
them and produce desired outcomes.
 Sorting Algorithm: Aimed at arranging
elements in a specific order, like numerical
Role of Algorithm
 or alphabetical, to enhance data  Swimlane Flowchart: Visualizes multiple
organization and retrieval. flows of information or categories to help
 Hashing Algorithm: Converts data into a clarify roles and responsibility.
fixed-size hash value, enabling rapid data  Yes/No Flowchart: Also known as
access and retrieval in hash tables, dichotomous keys. It make visualization of
commonly used in databases and password different paths easy based on yes/no
storage. decisions.
 Divide and Conquer Algorithm: Breaks a Flowchart Shapes
complex problem into smaller subproblems,  Oval: Also called a terminator. It
solves them independently, and then symbolizes the start or end of a process,
combines their solutions to address the which is why it is often used at the two end
original problem effectively. points of the flowchart.
 Greedy Algorithm: Makes locally optimal  Arrow: It connects the other shapes in the
choices at each step in the hope of finding a flowchart to illustrate the flow or sequence
global optimum, useful for optimization of steps. It represents the direction in which
problems but may not always lead to the the process progresses.
best solution.  Rectangle: It represents a
 Dynamic Programming Algorithm: process/step/operation within the algorithm.
Stores and reuses intermediate results to The actions to be taken are indicated inside
avoid redundant computations, enhancing the shape through text.
the efficiency of solving complex problems.  Parallelogram: Represents the input or
 Randomized Algorithm: Utilizes output operations. The text inside indicates
randomness in its steps to achieve a the data inputs and outputs in the operation.
solution, often used in situations where an  Diamond: This shape employs that there is
approximate or probabilistic answer a decision to be made. The flowchart
suffices. provides different paths depending on the
decision. The diamond contain the
Flowchart condition being tested. From there, the
 A graphical representation of the steps a flowchart branches into a “Yes” and a “No”
program takes to process data. It uses as an alternative for the decision made.
several geometric patterns to illustrate the
numerous actions the program carries out. Example of a Flowchart
 Helps to efficiently segregate various  Sales Flowchart:
elements of the process. Also, it facilitates
the analysis by giving a step-by-step Start
instruction on the problem.
Gather
Types of Flowcharts costumer
 Process Flow Diagrams: Illustrates the data.
general flow of a process and the Campaign
relationship between the major components.
 Data Flow Diagrams: Visualizes how data
No Rethink the
is processed in an information system from Success?
input to output. strategy
 Workflow Diagrams: Illustrates the steps Ye
involved to complete a task or execute a s
process in an efficient way. Opportunity
for sales

Unsuccessful
No
Buy? sale