CS505Discrete Structures

Course Prerequisites Tool·SNHU CS505 has no listed prerequisites.

Graduate · 3 credits

In this course, students will develop mathematical arguments using discrete numbers, logic, proofs, and sets. They will analyze the properties and structures of graphs and combinatorial objects and solve practical problems using discrete structures and algorithms. Topics include sets, relations and functions, logic, combinatorics, graph theory, and more. Students develop skills in problem solving, mathematical notation, logic, combinatorial reasoning, graph modeling, probability analysis, and algorithm design, preparing them to address a variety of computing challenges and problems across a range of professional contexts and domains.