Introduction
The objective of this assignment is to demonstrate the role of definitions in technical writing. Specifically, the assignment asks us to write three definitions for a complex term that is found in our particular discipline: a parenthetical definition, a sentence definition, and an expanded definition. Through doing so, we are able to acknowledge the nuance that comes with writing for different audiences, and engage in the skills necessary to convey our understanding to those with different backgrounds.
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.
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 common example of an algorithm is a cake recipe, where a sequence of steps are followed to accomplish the task of baking a cake. Algorithms are also illustrated when we do mathematical computations, such as complex addition or long division. Most of us cannot instinctively perform long division. Instead, we follow a sequence of steps that, when done without misstep, lead us to the correct output.
An Analysis of Parts
All algorithms can be produced with just three basic building blocks: sequence, selection and iteration.
Returning to our cake example, 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 an example of sequential logic.
Selection is a decision-making block that computes a different set of steps dependent on the selected choice. For example, in baking a cake, you 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 repetition or a loop, allowing for 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, you can set the condition to continue whipping the cream and checking the consistency until the cream reaches proper consistency. We could also modify the previous selection example to repeat the knife skewer process every few minutes until the knife comes out clean.
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