An engineer's guide to algorithmic structures

✍ Scribed by A.A. Kaposi

• Publisher: Elsevier Science
• Year: 1977
• Tongue: English
• Weight: 490 KB
• Volume: 9
• Category: Article
• ISSN: 0010-4485
• DOI: 10.1016/0010-4485(77)90064-1

✦ Synopsis

This tutorial paper introduces the basic concepts of the theory of algorithms, defines regular algorithmic structures and illustrates some of the advantages of using such structures for the solution of engineering problems.

Algorithms are instruments for solving problems by reasoning. The problems may be quantitative (such as the solution of equations, the transformation of the branch-node description of a structure into a connection matrix, etc.) or non-quantitative (such as finding a name on a record, assigning a binary code to the letters of the Latin alphabet). Most modern engineering problems can be solved by algorithmic methods. Knowledge of the theory of algorithms and understanding of algorithmic structures is particularly important when solving complex engineering problemst. This paper aims to introduce the reader to the basic concepts of the theory of algorithms, defines regular algorithmic structures and illustrates some of their merits in problem-solving. The subject matter of the paper is relevant to all engineers but is of particular interest to those working in the field of CAD.