Programming Requirements:

Create a Google Search Engine Simulator that MUST be written in JAVA and is required to use Max-Heap Priority Queue approach specified in lecture ppt slides and in textbook. (You MUST directly use/revise the pseudo codes provided in textbook to write your Java codes.

You can either download a Web Crawler software tool from Internet (links provided) or **develop your own simple Web Crawler in Java (http://www.netinstructions.com/how-to-make-a-simple-web-crawler-in-java/) to collect research results.

Based on the PageRank calculation, the priority queue with an integer score implemented in a Max- Heap Tree will store a collection of at least 30 search results of PageRank for the priority queue. (You may use either ArrayList or Vector in Java)

You can make your own way/assumption of assigning a score to each factor for PageRank calculation. The simulator must allow users to enter a score for each of the four factors.

When a PageRank factor of a keyword/search item changes its value, lets say a website owner has paid more money than other websites in the results of search to Google, the display result of the specific priority order increased. In this case, you have to restructure the Max-Heap tree. So your simulator must provide the user interface for changing the score for each PageRank factor.

The Google Search Engine Simulator MUST contain the following functions: The following functions must be implemented.

1) Max-Heapify(), 2) Build-Max-Heap(), 3) Heapsort(), 4) Max-Heap-Insert(), 5) Heap-Extract-Max, 6) Heap-Increase-Key, 7) Heap-Maximum

Each java file/class/subroutine/function call MUST contain a header comment at the beginning of it and each end of line in your codes. (Points will be taken off if your codes did not provide comments.)

At the end of your implementation, compute the complexity of your codes.