Given a stream of length n where every value is an integer lies in [1, N], show a single-pass algorithm that uses O(log n log N) memory and reports the elements such that (1) All elements that occur more than n/3 times in the stream are reported. (2) All elements that are reported at least n/6 times in the stream. Explain why your algorithm is correct.

Write a program that reads a file consisting of students’ test scores in the range 0–200. it should then determine the number of students having scores in each of the following ranges: 0–24, 25–49, 50–74, 75–99, 100–124, 125–149, 150–174, and 175–200. output the score ranges and the number of students. (run your program with the following input data: 76, 89, 150, 135, 200, 76, 12, 100, 150, 28, 178, 189, 167, 200, 175, 150, 87, 99, 129, 149, 176, 200, 87, 35, 157, 189.)

The option enables you to modify a slide element in most presentation applications.

Why would a business likely use a java applet - to back up their data files for the business - to create a program that a customer can launch in their web browser - to create music on a powerpoint presentation - to organize files on their company directory