Implement Dijkstra's Single-Source Shortest Paths algorithm, reconstruct the shortest paths, and create a command-line program for computing the shortest paths on a graph read from a test file.
Use string matching to search through a list of test results to analyze the ability of automated checkers to detect accessibility errors in websites.
Use the heap data structure to run queries on a file containing the success criteria of the Web Content Accessibility Guidelines (WCAG) 2.1.
With file I/O and ASCII character manipulation, students will create a C program that translates ASCII characters to their Braille counterparts. Includes program arguments and pointers.
Students will learn how build and utilize a binary tree to store and manipulate data.
Students will use string manipulations, turtles, lists, and dictionaries to collect and analyze braille text.
Students will analyze and understand a systems Braille rtf file using bash scripting and regular expressions