Abstract
Discrete Mathematics is an inevitable part of any undergraduate computer science degree programme. However, computer science students typically find this to be at best a necessary evil with which they struggle to engage. Twenty years ago, we started to address this issue seriously in our university, and we have instituted a number of innovations throughout the years which have had a positive effect on engagement and, thus, attainment. At the turn of the century, a mere 2% of our first-year students attained a 1st-class mark (a mark over 70%) in the discrete mathematics course whilst over half of the class were awarded a failing grade (a mark under 40%). Despite the course syllabus and assessment remaining as difficult as ever (if not more challenging), and despite maintaining the same entrance requirements to the programme whilst more than tripling the class size, for the past two years, two-thirds of the class attained a first-class mark whilst less than 2% of the class failed. In this paper, we describe and motivate the innovations which we introduced, and provide a detailed analysis of how and why attainment levels varied over two decades as a direct result of these innovations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
References
Averbach, B., Chein, O.: Problem Solving Through Recreational Mathematics. Dover, Mineola (1980)
Backhouse, R.: Algorithmic Problem Solving. Wiley, Hoboken (2011)
Betteridge, J., et al.: Teaching of computing to mathematics students. In: Proceedings of the 3rd Conference on Computing Education Practice, CEP 2019, Durham, UK, 9 January 2019, pp. 12:1–12:4 (2019)
Dudeney, H.: The Canterbury Puzzles, and Other Curious Problems. Andesite Press (2015)
Gibbs, W.W.: Software’s chronic crisis. Sci. Am. 271(3), 86–95 (2004)
Hein, J.L.: Discrete Structures, Logic, and Computability, 4th edn. Jones and Bartlett, Burlington (2017)
Higher Education Statistics Agency (HESA): Recruitment data for computer science courses in the UK (2019). https://www.hesa.ac.uk
House of Commons Science and Technology Committee: Digital Skills Crisis: Second Report of Session 2016–2017, 7 June 2016
Johnsonbaugh, R.: Discrete Mathematics, 8th edn. Pearson, New York (2017)
Kay, A.: A conversation with Alan Kay. ACM Queue 2(9), 20–30 (2004)
Levitin, A., Levitin, M.: Algorithmic Puzzles. Oxford University Press, Oxford (2011)
Michalewicz, Z., Michalewicz, M.: Puzzle-Based Learning: An Introduction to Critical Thinking, Mathematics, and Problem Solving. Hybrid Publishers, Melbourne (2010)
Moller, F., Crick, T.: A university-based model for supporting computer science curriculum reform. J. Comput. Educ. 5(4), 415–434 (2018)
Moller, F., Struth, G.: Modelling Computing Systems Mathematics for Computer Science. Springer, London (2013). https://doi.org/10.1007/978-1-84800-322-4
Morgan, C.: (In-)formal methods: the lost art. In: Liu, Z., Zhang, Z. (eds.) SETSS 2014. LNCS, vol. 9506, pp. 1–79. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-29628-9_1
Naur, P., Randell, B. (eds.): Software Engineering: Report of a conference sponsored by the NATO Science Committee, Garmisch, Germany, 7–11 October 1968. NATO Scientific Affairs Division (1969)
Rosen, K.H.: Discrete Mathematics and Its Applications, 8th edn. McGraw-Hill, New York (2019)
Smullyan, R.: To Mock a Mockingbird: And Other Logic Puzzles. Oxford University Press, Oxford (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Moller, F., O’Reilly, L. (2019). Teaching Discrete Mathematics to Computer Science Students. In: Dongol, B., Petre, L., Smith, G. (eds) Formal Methods Teaching. FMTea 2019. Lecture Notes in Computer Science(), vol 11758. Springer, Cham. https://doi.org/10.1007/978-3-030-32441-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-32441-4_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-32440-7
Online ISBN: 978-3-030-32441-4
eBook Packages: Computer ScienceComputer Science (R0)