/ 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. Prerequisite: Completion of or placement above MATH 115. Spring semester.
Core Curriculum Designation: QR
Grade Basis: Letter Grade
Credits: 4.0
St. Norbert College adheres to all policies of non-discrimination on the basis of age, sex, gender identity, race, color, national origin, ancestry, sexual orientation, military or veteran status, marital status, disability, religion or any other characteristic protected by the current federal, state, and local statutes. Further, the college prohibits discrimination based on genetic information and non-job related arrest record or conviction records for employment purposes.
@2023 St. Norbert College