We claim this class for computer science: a non-mathematician's discrete structures course

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. Alphonce, C. G., & Ventura, P. R. (2002). Object Orientation in CS1-CS2 by design. Paper presented at the 7th Annual Conference on Innovation and Technology in Computer Science Education, Aarhus, Denmark.
2. Bruce, K. B., Scot Drysdale, R. L., Kelemen, C., & Tucker, A. (2003). Why Math? Communications of the ACM, 46(9), 41--44.
3. Devlin, K. (2003). Why Universities Require Compute Science Students to take Math. Communications of the ACM, 46(9), 37--39.
4. Gersting, J. (2003). Mathematical Structures for Computer Science (5th ed.). New York: W.H. Freeman and Company.
5. Henderson, P. B. (2003). Mathematical Reasoning in Software Engineering Education. Communications of the ACM, 46(9), 45--50.
6. Marion, B. (2000). Discrete mathematics: Support of and preparation for the study of computer science, 7th annual CCSC midwestern conference on small colleges (pp. 190--199). Valparaiso, Indiana.
7. Ralston, A., & Shaw, M. (1980). Curriculum '78 - Is computer science really that unmathematical. Communications of the ACM, 23(2), 67--70.
8. Sidbury, J. R. (1986). A statistical analysis of the effect of discrete mathematics on the performance of computer science majors in beginning computing classes. Paper presented at the 17th SIGCSE technical symposium on Computer Science Education, Cincinatti, Ohio.
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. Tomer, D. S., Baldwin, D., Smith, C. H., Henderson, P. B., & Vadisigi, V. (2000). CS1 and CS2: Foundations of computer sicence and discrete mathematics. Paper presented at the 31st SIGCSE technical symposium on Computer Science Education, Austin, Texas.
11. Tremblay, J. P., & Manohar, R. (1974). A first course in discrete structures with applications to computer science. Paper presented at the 4th SIGCSE technical symposium on Computer Science Education.
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

• Mathematics of computing

  • Discrete mathematics

• Social and professional topics

  • Professional topics

    • Computing education

      • Computing education programs

        • Computer science education

      • Model curricula