The Quiz instructions would contain the following text:

This is the first exam. It is 120mn (2hours) plus 2mn to do the first and last camera question and worth 360pt. Be reminded that direct access to it is not possible. You need to first login/authorize with ProctorU's blue owl plugin and then when you head towards the quiz area in canvas that contains the exam, ProctorU Review+ will auto-type a password to get you in.
There are 9 problems (i.e. questions); aim at solving 3-4pt per minute. If you count 11 problems read the whole document.

The exam is closed everything. If ProctorU or me detects headphones of any type or smartphone(s) in the area of the exam, the exam gets an automatic 0. You are expected to have read 3rdProcU.txt available in Canvas Announcements and also section C.0 of the course web-page.

You are also allowed to use 2 sheets of paper (4 pages total) per prior information provided. This means you must include at the top of each of the 4 pages, your last name in capital case (all), then your first/given name (first letter capital, remaining lower case) followed by a 1of4 , 2of4, 3of4, and 4of4 as needed. Before you start the exam you show in front of the camera the 4 pages one by one, and so do you at the END of the exam.

It is possible that ProctorU will add a URL at the start of this section. The URL might point to the location of the plugin. But hopefully you will have it already installed to your Chrome browser by then. Make sure your myUCID credentials are current and so ar the ProctorU credentials.

The first and last questions are a reminder for you to show the four pages of the two sheets you used. Dispose of them afterwards.

 

'Give an algorithm' means , present the algorithm, show that it works as claimed, and analyze its running time by providing an asymptotically
tight bound. Giving a piece of code won't get you any points.

Efficient means an algorithm whose performance (space or time or both) cannot be improved upon asymptotically.

Time efficient means asymptotic time efficiency cannot be improved upon.

Space efficiency is to be interpreted likewise.

Comparison efficient means the number of comparisons cannot be improved upon and thus constants are important for higher-order terms: thus $\Theta (n)$ is worse than $3n$, and $3n$ is worse than $2n+o(n)$.

Use T(.) for running time, S(.) for space resources, and C(.) for comparison
counts with a parameter as needed.

INCR = < 1, 2, ... , n-1, n> is the sorted sequence of the first n positive integers starting with 1.

DECR = < n, n-1, ... , 2, 1> is the reverse sorted sequence of the first n positive integers starting with n.

PRECEDE YOUR ANSWER with the question number in parentheses.