Discrete structures are sets of distinct or unconnected elements. These structures are useful when solving problems that require counting objects, exploring the relationship between finite sets, and analyzing an algorithm (a finite sequence of steps) for its effectiveness and efficiency. Discrete structures can be used to answer questions in a variety of disciplines. In this course students learn techniques for solving problems and defending their solutions while improving their ability to think logically, algorithmically, and quantitatively. Weekly laboratory sessions provide opportunities for students to analyze problems and experiment with their solutions. This is not a programming course. Spring semester.