Merging Discrete Structures and Algorithms

DOI: 10.5176/2251-2195_CSEIT17.13

Authors: Daniel E. Stevenson

Abstract: Discrete Structures concepts are foundational in nature and connect with many areas of computer science. However, many students view Discrete Structures as a math class that has little relevance to the rest of their computer science education. The topics in Discrete Structures and Algorithms are highly related, both theoretically and in specific content. This paper presents both an argument for merging Discrete Structures topics into an Algorithms class as well as a detailed list of lab activities that make the implementation possible.

Keywords: Algorithms, Discrete Structures