Entry Kopec:1999:HSD from sigcse1990.bib

Last update: Wed Sep 26 02:07:32 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{Kopec:1999:HSD,
  author =       "Danny Kopec and Richard Close and Jim Aman",
  title =        "How should data structures and algorithms be taught",
  journal =      j-SIGCSE,
  volume =       "31",
  number =       "3",
  pages =        "175--176",
  month =        sep,
  year =         "1999",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/384267.305913",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sat Nov 17 16:56:39 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1990.bib",
  abstract =     "Data Structures and Algorithms is clearly a very
                 important topic and course in the Computer Science
                 curriculum. It has been taught at several levels by a
                 number of approaches. Should the approach be
                 mathematical, theoretical and abstract or very concrete
                 and ``hands on''? Whichever method is used, the
                 ultimate goal is the same: enhancing student
                 comprehension. The panelists discuss three distinct and
                 well-defined approaches.",
  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