[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

A statistical analysis of the effect of discrete mathematics on the performance of computer science majors in beginning computing classes

Published: 01 February 1986 Publication History

Abstract

During the 1983-84 academic year, the University of Scranton instituted an experimental two semester discrete mathematics course for freshman students majoring in computer science. Approximately one-third of them were enrolled in this sequence while the remaining freshmen were enrolled in a traditional algebra-calculus mathematics sequence. At the end of the academic year the records of the freshman computer science majors were examined to see if there was any difference in performance between those who took discrete mathematics and those who did not.
There is a strong indication that students who take discrete mathematics make higher grades in computer science than do the students who take the algebra-calculus sequence of courses. There is no indication that students who take discrete mathematics are more (or less) likely to change majors during the freshman year than those who take a traditional mathematics course.

References

[1]
Koffman, E1 1 lot B., Phil 1 ip L. Miller, and Caroline E. Wardle, Recommended Curriculum for CSl, 1984, CACM 27, 10, 998-1001.
[2]
Koffman, Elliot B., David Stemple, and Caroline E. Wardle, Recommended Curriculum for CS2, 1984: A R_~ort of the ACM Curriculum Task Force for CS2, CACM 28, 8, 815-819.
[3]
Campbell, Patricia and George McCabe, Predicting the Success of a Freshman in a Computer Sc{ence M___~~ CACM 27, ii, 1108-1113.
[4]
Ralston, Anthony, Computer Science, Mathematics, and the Undergraduate Curriculum in Both, Amer. Math. Monthly -88~ 7?--455-472.
[5]
Ralston, Anthony, The First Course in computer science Needs a Mathematical Core_quisite, CACM 27, 10, 1002-10~5.
[6]
Beidler, John, Richard Austing, and Lillian Cassel, Computing Programs in Small Colleges, CACM (to appear).
[7]
MAA Panel on Discrete Mathematics in the First Two Years, P_r__eliminary ~, Mathematical Association of America, Nov. 1984.

Cited By

View all
  • (1987)Predicting success of a beginning computer course using logistic regression (abstract only)Proceedings of the 15th annual conference on Computer Science10.1145/322917.323110Online publication date: 1-Feb-1987
  • (2018)An Active and Collaborative Approach to Teaching Discrete StructuresProceedings of the 49th ACM Technical Symposium on Computer Science Education10.1145/3159450.3159582(822-827)Online publication date: 21-Feb-2018
  • (2014)English, Mathematics, and Programming grades in the secondary level as predictors of academic performance in the college levelIISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications10.1109/IISA.2014.6878739(427-431)Online publication date: Jul-2014
  • Show More Cited By

Index Terms

  1. A statistical analysis of the effect of discrete mathematics on the performance of computer science majors in beginning computing classes

      Recommendations

      Reviews

      Doris C. Appleby

      Sidbury compares the grades earned by students in a second course in computer science, grouped according to mathematics courses completed. These courses were Calculus, Discrete Mathematics, Pre-Calculus, and Quantitative Methods. He concludes that “students who take discrete mathematics do better in their beginning computer science courses than do students who take traditional mathematics.” The study is criticized in [1], on both design and methodological grounds. Design problems involve noncomparable groups (those studying discrete mathematics were all CS majors) and the orientation of the mathematics course material, since students in the discrete course were studying material closely related to the CS work, while others were not. The method is faulty in that analyses were carried out only on group means, even though individual scores were available for mathematics grades and SAT scores. Both criticisms are correct. If the faulty statistical trappings are removed from the study, Sidbury's comments boil down to informal evidence that students who take two courses on closely related material do better than students taking only one course. Studies to compare the worth of two or more strategies in learning the same material are extremely difficult to carry out. Controlling other variables, such as teacher and/or student enthusiasm, is next to impossible, as is truly random grouping (not achieved in Sidbury's study). Opinions such as those reported in this study are more validly presented when not cluttered up with inappropriate statistical analyses. But there's the rub. An opinion paper is often not acceptable to either journal or conference referees. As the computer science curriculum becomes more rigid, those with authority to set policy will probably consider studies evaluating the merits of one strategy over another. I join Konstam and Saphire in hoping that they not be swayed by small, inconclusive studies.

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM SIGCSE Bulletin
      ACM SIGCSE Bulletin  Volume 18, Issue 1
      Proceedings of the 17th SIGCSE symposium on Computer science education
      February 1986
      304 pages
      ISSN:0097-8418
      DOI:10.1145/953055
      Issue’s Table of Contents
      • cover image ACM Conferences
        SIGCSE '86: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
        February 1986
        336 pages
        ISBN:0897911784
        DOI:10.1145/5600
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 01 February 1986
      Published in SIGCSE Volume 18, Issue 1

      Check for updates

      Qualifiers

      • Article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)56
      • Downloads (Last 6 weeks)11
      Reflects downloads up to 23 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (1987)Predicting success of a beginning computer course using logistic regression (abstract only)Proceedings of the 15th annual conference on Computer Science10.1145/322917.323110Online publication date: 1-Feb-1987
      • (2018)An Active and Collaborative Approach to Teaching Discrete StructuresProceedings of the 49th ACM Technical Symposium on Computer Science Education10.1145/3159450.3159582(822-827)Online publication date: 21-Feb-2018
      • (2014)English, Mathematics, and Programming grades in the secondary level as predictors of academic performance in the college levelIISA 2014, The 5th International Conference on Information, Intelligence, Systems and Applications10.1109/IISA.2014.6878739(427-431)Online publication date: Jul-2014
      • (2011)Teaching discrete structuresProceedings of the 42nd ACM technical symposium on Computer science education10.1145/1953163.1953247(275-280)Online publication date: 9-Mar-2011
      • (2004)We claim this class for computer scienceProceedings of the 35th SIGCSE technical symposium on Computer science education10.1145/971300.971448(442-446)Online publication date: 3-Mar-2004
      • (2004)We claim this class for computer scienceACM SIGCSE Bulletin10.1145/1028174.97144836:1(442-446)Online publication date: 1-Mar-2004

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media