HACS 208Z

Methods for Solving (And not Solving) Puzzles

3credits
About this course

Surveys modern problems from different domains in computer science and cybersecurity to train our minds to appropriately approach puzzles we encounter in the future. This course covers graph theory, including what a graph is and the kinds of objects it can model, connectivity types, and vertex/edge covers algorithms. This course covers computer networks, including the models used for network stacks and what algorithms are used to solve difficult problems present in our current networks. This course covers algorithm analysis, including greedy algorithms, big O complexity, and how to analyze the capabilities and limitations of an algorithm. This course introduces cryptography, including the difference between public-key and symmetric-key cryptography, how RSA works, and the cryptanalysis of well-known cryptosystems.

All available terms

8 terms

Avg. GPA
3.91
Grades
168

Other grades

W1.8%
More course details

University of Maryland

HACS 208Z at UMD: average GPA 3.91 across 168 students. Grade distribution by term. Surveys modern problems from different domains in computer science and…

Average GPA: 3.91

Grade distribution records: 168 students across 8 terms.

Grade distribution

GradeStudentsPercent
A+10361.3%
A4929.2%
A-42.4%
B63.6%
C21.2%
F10.6%
W31.8%

Based on 168 student grade records across 8 terms and 2 professors.

Instructors

Related courses

The course page is taking longer to load. This summary is still available.

We could not load the full course details. This summary is still available.

Still loading. This can take a moment on a slow connection.

Loading My Class Grades