Entry Augenstein:1976:LRS 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{Augenstein:1976:LRS,
  author =       "Moshe Augenstein and Aaron Tenenbaum",
  title =        "A lesson in recursion and structured programming",
  journal =      j-SIGCSE,
  volume =       "8",
  number =       "1",
  pages =        "17--23",
  month =        feb,
  year =         "1976",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/952989.803442",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sun Nov 18 08:53:52 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1970.bib",
  note =         "Proceedings of the SIGCSE--SIGCUE joint symposium on
                 Computer science education.",
  abstract =     "Students in middle level courses in data structures
                 and programming languages often do not have a full
                 appreciation of recursion. The study of the simulation
                 of recursion can be an excellent tool in improving this
                 situation. It is shown how to construct a nonrecursive
                 routine to solve a problem whose solution is naturally
                 recursive. This nonrecursive routine is then used as a
                 foundation from which one can construct a simpler and
                 better structured program than the original version.
                 The advantages of this activity are also discussed.",
  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