Weiss, Data Structures and Algorithm Analysis in Java, Chapters 2-5, 6-6.4, 6.9, 7, 9-9.3, 9.5; class lecture notes; MapReduce paper.

DSA is the backbone of computer science. Without it, software would be slow, unreliable, and unable to handle large amounts of information.

The use of the PRIM algorithm to find a minimum spanning tree. The program uses the selected database in CSV format and converts it into a graph to find the minimum spanning tree through the Prim's ...

An algorithm is a step-by-step procedure or formula for solving a problem. In the context of computer science, it is a series of instructions that are executed to accomplish a specific task. These ...

This project creates word ladders in directed and undirected graph generated from the words in the text file sub-words. It then finds the strongly connected components in the directed graph.

1. The definitions in an XML document are said to be _____ when the tagging system and definitions in the DTD are all in compliance. (1) M=3; D1 displays ”12”; D2 displays ”6”; D3 displays ”12”. (2) ...