Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

We have recently launched a reorganized discrete structures course being taught in the computer science department for computer science majors. The main idea of the reorganization is to make the course relevant and productive for the computer science students. During the Spring of 2003, students who were taking both discrete structures and CS2 commented that taking both courses at the same time was helpful. An empirical investigation was conducted to see if there was a benefit to students taking both courses concurrently. The results show that there was a benefit to students taking both courses. The students who were taking both courses were performing better in discrete structures than those students who were not.

REFERENCES

• 1: Carl Alphonce , Phil Ventura, Object orientation in CS1-CS2 by design, Proceedings of the 7th annual conference on Innovation and technology in computer science education, June 24-28, 2002, Aarhus, Denmark
• 2: Kim B. Bruce , Robert L. Scot Drysdale , Charles Kelemen , Allen Tucker, Why math?, Communications of the ACM, v.46 n.9, September 2003 [doi>10.1145/903893.903918]
• 3: Keith Devlin, Introduction, Communications of the ACM, v.46 n.9, September 2003 [doi>10.1145/903893.903917]
• 4: Judith L. Gersting, Mathematical structures for computer science (2nd ed.), W. H. Freeman & Co., New York, NY, 1987
• 5: Peter B. Henderson, Mathematical reasoning in software engineering education, Communications of the ACM, v.46 n.9, September 2003 [doi>10.1145/903893.903919]
• 6: Bill Marion, Discrete mathematics: support of and preparation for the study of computer science, Proceedings of the seventh annual CCSC Midwestern conference on Small colleges, p.190-199, December 2000, Valparaiso Univ., Valparaiso, Indiana, United States
• 7: Anthony Ralston , Mary Shaw, Curriculum '78—is computer science really that unmathematical?, Communications of the ACM, v.23 n.2, p.67-70, Feb. 1980 [doi>10.1145/358818.358820]
• 8: James R. Sidbury, A statistical analysis of the effect of discrete mathematics on the performance of computer science majors in beginning computing classes, Proceedings of the seventeenth SIGCSE technical symposium on Computer science education, p.134-137, February 06-07, 1986, Cincinnati, Ohio, United States
• 9: The Joint Task Force on Computing Curricula. (2001). Computing curricula 2001 computer science. Retrieved August 25, 2003, from http://www.computer.org/education/cc2001/final/index.htm
• 10: D. S. Tomer , Doug Baldwin , Carl H. Smith , Peter B. Hendersen , Venu Vadisigi, CS1 and CS2 (panel session): foundations of computer science and discrete mathematics, Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, p.397-398, March 07-12, 2000, Austin, Texas, United States
• 11: J. P. Tremblay , R. Manohar, A first course in discrete structures with applications to computer science, Proceedings of the fourth SIGCSE technical symposium on Computer science education, p.155-160, January 1974
• 12: Ventura, P. R., & Alphonce, C. G. (2001). Teaching OOD and OOP through Java and UML in CS 1 and 2. Paper presented at the 5th Workshop on Tools for Assimilating Object-Oriented Concepts - OOPSLA 2001, Tampa, Florida.

INDEX TERMS

Primary Classification:
  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Computer science education

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.0 General

  K. Computing Milieux
  K.3 COMPUTERS AND EDUCATION
      K.3.2 Computer and Information Science Education
          Subjects: Curriculum

General Terms:
Experimentation

Keywords:
discrete mathematics curriculum