Henley, Ernest J.2022-11-102022-11-1019752713419https://hdl.handle.net/10657/12553This thesis develops an algorithm suitable for curriculum analysis. The program is based on a path finding algorithm developed by Caceres and Henley. The program is simple to use and requires only a module diagram for the system. Such a diagram is similar to a block diagram. It is easy to draw for a person specialized in the topic being analyzed, even if he is not familiar with flow graph analysis. The diagram shows direct prerequisite relations in a curriculum of a specified field, the elements (modules) of the diagram include an identification flag to differentiate between the "AND" and "OR" modules. The final output is a fault tree, with the concept to be studied as the top event.application/pdfenThis item is protected by copyright but is made available here under a claim of fair use (17 U.S.C. Section 107) for non-profit research and educational purposes. Users of this work assume the responsibility for determining copyright status prior to reusing, publishing, or reproducing this item for purposes other than what is allowed by fair use or other copyright exemptions. Any reuse of this item in excess of fair use or other copyright exemptions requires express permission of the copyright holder.Curriculum analysis using a graphical techniqueThesisreformatted digital