Project 3: Search Engine

Overview

In this project, you will:

• Implement a heap to help sort data.
• Practice writing more tests.
• Get more practice working with sets and dictionaries while implementing TF-IDF ranking, an algorithm for computing how relevant a query is to a document.
• Get some practice working with and manipulating graphs while implementing PageRank, an algorithm for assessing the quality of a webpage based on the number of inbound links.
• Combine these features to build a search engine.

This assignment has three parts:

• Part 1 is due on
• Part 2 is due on
• Part 3 is due on

There also some extra credit opportunities – all extra credit is due on the same day part 3 is due.

Expectations

When working on this assignment, we expect you meet these baseline expectations at all times:

• Your team MUST follow our course collaboration policies. In short, we expect you to pair program and write code with your partner. You may discuss this assignment with other teams on only a high level.
• You MAY NOT use any classes from java.util.* unless explicitly told otherwise.

Table of Contents

This project is split up into three parts. Part 1 is about heaps, Part 2 is meant to give you more practice working with dictionaries and sets, and Part 3 is meant to give you practice working with graphs.

One important thing to note is that you will in general be given very few tests on all three parts. This is intentional and is meant to help you develop strong debugging and testing skills. We strongly encourage you to add your own tests to supplement the ones you were given.

• Part 1: Heaps, sorting, and testing

  Due

• Part 2: Searching using TF-IDF

  Due

• Part 3: Implementing PageRank

  Due

• Extra Credit

  Due