{"title":"The inclusion of data frames illustrating data flow in control structure charts for novice students","authors":"M. V. Doran, H. Longenecker","doi":"10.1145/98949.99083","DOIUrl":null,"url":null,"abstract":"Studies [3], [5] have demonstrated the power of graphical versus textual presentations. Our postulate slates that graphical definition must include a graphical representation of the data structures used [1]. Current research addresses the representation issue, the goal being not only to visually present graphical control flows but also the data being transformed by those control structures. The initial problem solving course at the USA is designed to teach concepts of algorithm formation as a method of solving formal analytic problems. Algorithms are defined graphically in control structure charts using textual dictionaries of variables. With this method, data is visualized graphically as it flows through the al gorithm. Research has been undertaken to investigate the necessary components and features required to support the environment. This research is based on Law’s work [4] defining structure charts in the SLAW (Structure Language Algorithm Writer) environment. A graphical tree represents the control flow of the algorithm. Textual dictionaries define the data structures employed. The flow of control is indicated by a hierarchy of shapes. SLAW has successfully been used as a teaching tool [2]. The primary focus of this research is the generation and investigation of a method for algorithm develop ment, DATA (Data to Algorithm Translation Analysis), entirely free of any programming language syntax, has been developed to graphically represent data structures and flows which yield structure charts in the SLAW method of algorithm development. The user creates a structure chart. Multiple dictionaries are now defined, each using graphical iconic symbols. Each lask/action in the chart will have associated with it a dictionary bubble which will become active and expand into a data window at the execution or reference of the lask/action. The data windows allow the user to monitor the data flows.","PeriodicalId":409883,"journal":{"name":"ACM-SE 28","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM-SE 28","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/98949.99083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Studies [3], [5] have demonstrated the power of graphical versus textual presentations. Our postulate slates that graphical definition must include a graphical representation of the data structures used [1]. Current research addresses the representation issue, the goal being not only to visually present graphical control flows but also the data being transformed by those control structures. The initial problem solving course at the USA is designed to teach concepts of algorithm formation as a method of solving formal analytic problems. Algorithms are defined graphically in control structure charts using textual dictionaries of variables. With this method, data is visualized graphically as it flows through the al gorithm. Research has been undertaken to investigate the necessary components and features required to support the environment. This research is based on Law’s work [4] defining structure charts in the SLAW (Structure Language Algorithm Writer) environment. A graphical tree represents the control flow of the algorithm. Textual dictionaries define the data structures employed. The flow of control is indicated by a hierarchy of shapes. SLAW has successfully been used as a teaching tool [2]. The primary focus of this research is the generation and investigation of a method for algorithm develop ment, DATA (Data to Algorithm Translation Analysis), entirely free of any programming language syntax, has been developed to graphically represent data structures and flows which yield structure charts in the SLAW method of algorithm development. The user creates a structure chart. Multiple dictionaries are now defined, each using graphical iconic symbols. Each lask/action in the chart will have associated with it a dictionary bubble which will become active and expand into a data window at the execution or reference of the lask/action. The data windows allow the user to monitor the data flows.