Introduction
The assignment objective is to demonstrate the role of definitions in technical writing. Specifically, the assignment asks to write three definitions (parenthetical, sentence, and expanded) for a complex term that is found in a professional or academic discipline. This task emphasizes the nuance that comes with writing for different audiences.
Reading Situation
A software developer explains the term algorithm for an online tutorial aimed at beginners.
Parenthetical Definition
Data processing requires the use of algorithms (a set of instructions to solve a problem).
Sentence Definition
An algorithm is an instance of logic that is characterized by a finite sequence of steps, typically to solve a problem or perform a computation.
Expanded Definition
Etymology
The word algorithm stems from the oasis region Khwãrezm in Central Asia. Resident scholar, astronomer, and mathematician Muhammad ibn Mūsa al-Khwarizmī contributed heavily to the field of algebra, and wrote a book on Hindu-Arabic numerals. The latin translation of his name produced algoritmi, which became the word algorithm in English. Though usage of the term algorithm in the typical sense can be traced to the early 20th century, the initial origin stretches back as far as the 9th century.
Visual
The following visual depicts the nature of how an algorithm functions. Note that an algorithm receives input(s), and after following a sequence of steps, produces an output.
Figure 1 High-level overview of algorithmic processing
Source: DevOpsSchool
Examples
Algorithms are fundamental to computer programming, but they also exist everywhere in the real world. A cake recipe is a typical example of an algorithm; making cakes takes a sequence of steps. Algorithms are also illustrated when one performs mathematical computations, such as complex addition or long division.
An Analysis of Parts
Sequence, selection, and iteration are the three basic building blocks of algorithms
A sequence refers to actions performed in a step-by-step order. For example, “preheat oven to 350 degrees Fahrenheit” followed by “stir together flour and baking powder” is a sequence of steps.
Selection is a decision-making block that computes a different set of steps dependent on the selected choice. In baking a cake, one might have the following selection block:
Insert a knife/skewer into the cake
Remove knife/skewer from the cake
if the knife comes out clean
remove cake from the oven
else
continue to let the cake bake for 10 minutes
Lastly, iteration refers to the repetition of a set of steps until a certain condition is met. For example, when whipping the cream for cake using an electric mixer, one can set the condition to continue whipping the cream and checking the consistency until the cream reaches proper consistency. The previous example can also be modified to repeat the knife skewer process every few minutes until the knife comes out clean.
In computer science, an iterative condition can be demonstrated as follows:
for (int i = 10, i > 0; i- -) {
print i
}
print Happy New Years!
This simple loop is printing a countdown of numbers. It starts with i = 10. The condition i > 0 means that the loop repeats as long as this condition is met. Each iteration subtracts the i by 1 (i- -). When i > 0 is no longer true, the loop stops. In this way, the countdown stops at 1. The program exits the loop and prints Happy New Years.
References
Ashwani, KJunior. “Complete Tutorials of Introduction to Algorithm.” DevOpsSchool.com, 10 June 2021, https://www.devopsschool.com/blog/complete-tutorials-of-introduction-to-algorithm/
Dalbey, John. “Algorithm Building Blocks.” Algorithm Building Blocks, http://users.csc.calpoly.edu/~jdalbey/101/Lectures/AlgorithmBuildingBlocks1.html
“How Algorithm Got Its Name.” NASA, NASA, 20 Aug. 2017, https://earthobservatory.nasa.gov/images/91544/how-algorithm-got-its-name
Leave a Reply