Entry Beidler:1978:STT 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{Beidler:1978:STT,
  author =       "John Beidler and John Meinke",
  title =        "A software tool for teaching {Data Structures}",
  journal =      j-SIGCSE,
  volume =       "10",
  number =       "3",
  pages =        "120--125",
  month =        aug,
  year =         "1978",
  CODEN =        "SIGSD3",
  DOI =          "https://doi.org/10.1145/953028.804245",
  ISSN =         "0097-8418 (print), 2331-3927 (electronic)",
  ISSN-L =       "0097-8418",
  bibdate =      "Sun Nov 18 07:38:06 MST 2012",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/sigcse1970.bib",
  note =         "Proceedings of the 9th SIGCSE symposium on Computer
                 science education.",
  abstract =     "Our Data Structures Course, first taught in 1973, was
                 originally conceived as the keystone course of our
                 computer science curriculum. Our curriculum's original
                 design was influenced by Curriculum '68 and the
                 undergraduate computer science program at Penn State
                 University. However, we had to adapt our program to our
                 small college environment and include a curriculum
                 track with a business emphasis. We felt that regardless
                 of which track in our program a student might follow,
                 theory/systems or business/DP, there must be a strong
                 nucleus common to both tracks. For this reason we
                 concentrated on developing four strong courses that
                 would be given as the freshman and sophomore year
                 component of our curriculum. As part of this, we also
                 saw the need for software tools to support these
                 courses. From this, a structured programming
                 preprocessor evolved. However, as part of this
                 preprocessor we included timing and dynamic storage
                 allocation features. Through a strong emphasis on
                 structured programming that begins with our first
                 computer science course, our second course introduces
                 many discrete structure concepts-queues, stacks, trees,
                 graphs, etc... Our third course is a course in
                 assembler level programming and computer organization.
                 These courses provide a strong foundation for our Data
                 Structures course.",
  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