Entry Davis:1977:RMT 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{Davis:1977:RMT,
  author =       "Ronald L. Davis",
  title =        "``Recommended mathematical topics for computer science
                 majors''",
  journal =      j-SIGCSE,
  volume =       "9",
  number =       "3",
  pages =        "51--55",
  month =        aug,
  year =         "1977",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/382175.803433",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sun Nov 18 08:53:57 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1970.bib",
  note =         "Special issue on the Eighth Technical Symposium on
                 Computer Science Education.",
  abstract =     "Although there is not universal agreement on a
                 definition of computer science, I believe that it is
                 the inclusion of a quantitative (mathematical) approach
                 to our discipline that distinguishes ``computer
                 science'' from ``computer programming''. Mathematics
                 provides both an established language with which to
                 precisely define terms and established methods for
                 problem solving. For example, the rather vague
                 statement that ``algorithm A is better than algorithm
                 B'' may be formulated unambiguously and verified or
                 refuted with respect to certain performance
                 measurements using the formalism of algorithm analysis
                 (l). Mathematical methods also point toward the
                 possibility of proving that an algorithm provides
                 acceptable performance for large classes of inputs, a
                 conclusion which often cannot be supported on the basis
                 of case-by-case testing (5). I will now discuss certain
                 mathematical ideas which naturally arise in computer
                 science courses and cite relevant examples which will
                 hopefully convince the reader that these ideas are
                 worthy of formal study. Suggestions are then offered
                 regarding the inclusion of these studies in the
                 four-year computer science curriculum.",
  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