ERIC Number: ED156204
Record Type: RIE
Publication Date: 1977-Jun
Reference Count: 0
Using Networks to Net Results.
Tucciarone, John P.
As part of an introductory computer programming course, students were assigned seven programs selected to expose them to the varied applications of BASIC. Three additional programs were selected by the students themselves from other courses or from topics in the text which had not been covered in class. The topic which seemed to arouse the greatest interest was the Kemeny-Kurtz treatment of a critical path-network flow problem, a topic not normally treated in introductory courses. Even though the course, which had no prerequisites, attracted students with a varied degree of quantitative competence, most students were able to handle the programs effectively once the ideas were presented in a concrete framework and the algorithms were carefully explained. Three network problems selected on the basis of this experience are described: (1) minimum tree in a network; (2) minimal time path through a network; and (3) critical path through a network. Five student written programs discussed in the article are included as an appendix. (Author/CMV)
Publication Type: Speeches/Meeting Papers
Education Level: N/A
Authoring Institution: N/A
Identifiers: BASIC Programing Language; Mercy College NY
Note: Paper presented at the Conference on Computers in the Undergraduate Curricula (East Lansing, Michigan, June 20-22, 1977); For entire proceedings, see IR 006 142