Entry Honkanen:1973:SCP from sigcse1970.bib

Last update: Sun Apr 22 02:03:34 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Honkanen:1973:SCP,
  author =       "Pentti A. Honkanen",
  title =        "A student-computer programming system for teaching
                 graph and network theory",
  journal =      j-SIGCSE,
  volume =       "5",
  number =       "1",
  pages =        "177--179",
  month =        feb,
  year =         "1973",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/953053.808104",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sun Nov 18 08:53:45 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1970.bib",
  note =         "Proceedings of the 3rd SIGCSE symposium on Computer
                 science education.",
  abstract =     "This paper describes a programming system used in the
                 teaching of two Computer Science courses at The
                 Pennsylvania State University (7). The courses are; an
                 upper level undergraduate-beginning graduate level
                 course in graph theory, and a graduate level course in
                 the theory of graphs and networks. As can be
                 ascertained from the description of these courses they
                 are not primarily what would normally be called
                 programming courses. However, since they are computer
                 science courses they do stress the computational
                 aspects of graph and network theory and analysis. Past
                 experiences have indicated that if a computational
                 problem of any reasonable complexity is assigned in
                 class the majority of the students focus an inordinate
                 amount of their energies to the programming problems,
                 and consequently fail to grasp the significant features
                 of the theoretical problems involved. In addition,
                 since graph and network theory encompasses not only
                 computer science, but engineering and physical, and to
                 a lesser extent, the social sciences, many of these
                 students would be unduly burdened by writing many
                 rather complex programs. On the other hand, teaching
                 the computational aspects of graph theory without doing
                 some programming is equally ludicrous. Thus, a default
                 type solution of assigning two or three problems from a
                 narrow set of problems was rapidly becoming an
                 undesirable solution to this dilema. It was at this
                 point that the concept of a dynamically growing
                 programming system, as described in this paper, began
                 to formulate itself.",
  acknowledgement = ack-nhfb,
  fjournal =     "SIGCSE Bulletin (ACM Special Interest Group on
                 Computer Science Education)",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J688",
}

Related entries