Curriculum analysis using a graphical technique

This 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.