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.

What can tanya do now to start preparing for the college and scholarship application process? think about her grades, activities in which she can get involved, possible part-time jobs at which she can work, and standardized tests she can take. (10 points) apex

When you type the pwd command, you notice that your current location on the linux filesystem is the /usr/local directory. answer the following questions, assuming that your current directory is /usr/local for each question. a. which command could you use to change to the /usr directory using an absolute pathname? b. which command could you use to change to the /usr directory using a relative pathname? c. which command could you use to change to the /usr/local/share/info directory using an absolute pathname? d. which command could you use to change to the /usr/local/share/info directory using a relative pathname? e. which command could you use to change to the /etc directory using an absolute pathname? f. which command could you use to change to the /etc directory using a relative pathname?

Which text function capitalizes the first letter in a string of text? question 10 options: upper capital first proper