A modern approach to discrete structures. (2018)

• Record Type: Journal Article
• Authors: Miller, Russ
• Is Part Of: International journal of teaching and case studies. Volume 9:Number 1(2018)
• Page Start: 33
• Page End: 47
• Publication Date: 2018
• Subjects: discrete mathematics -- asymptotic analysis -- parallel algorithms -- models of computation -- divide-and-conquer -- parallel prefix -- summation -- recursion -- induction -- sorting -- graph theory; Teaching -- Periodicals; 371.10205
• Languages: English
• ISSNs: 1749-9151

Abstract

In this paper, we present a new paradigm for a freshman course in discrete structures. Historically, a freshman course in discrete structures is taught by presenting a variety of topics in a modular fashion. Topics typically include logic, sets, functions, induction, recursion, algorithms, graphs, probability, counting, proofs, and Boolean algebra, to name a few. Students are expected to follow, digest, and retain such knowledge, often for several years before applying it in junior- and/or senior-level courses. In the Department of Computer Science and Engineering at the State University of New York at Buffalo, the success of a traditional course in discrete structures has been marginal, at best. The alternative approach that we present provides a focused educational experience covering key components of discrete structures. Specifically, we present a unifying thread of modern computer architectures and their algorithms, where critical components of discrete structures are presented in context. In addition, we provide freshman students with an opportunity to take ownership of the educational process. To date, results of this new paradigm have been extremely promising.