Blog

The causes leading up to the American Declaration of Independence were ________ by the “King of Great Britain” against the American colonies.  Which choice below best fits in the blank?

Continued from the caching example from the previous question… Show the configuration of the cache after the first request for item (in the tenth position of the sequence) is satisfied. Enter your response in the format of four comma-separated letters in alphabetical order. Example response: w,x,y,z

My friend has a factory with two identical machines that each may process the same types of job. As such, my friend can schedule as many as two jobs during any given time interval. In addition, he always has a selection of jobs he may choose to run, but each of these jobs has a corresponding fixed time interval in which it may run, that is, each job has a fixed start time and a fixed finish time. He tells me he knows a greedy algorithm that will produce an optimal schedule for this interval scheduling variant (i.e. at most two jobs may be scheduled at any point in time). If is the set of all fixed job intervals that may be processed, we run the following algorithm: My friend says DOUBLE GREEDY always produces an optimal schedule for the variant, but he is, in fact, wrong. From the selection of job interval sets below, choose the selection that functions as a simple counterexample that shows my friend is incorrect.

The following statements all concern greedy algorithms. Circle all statements below that are true.

Suppose we are given a splay-tree  of  nodes and we present an operation called ELEMENT-CHECK(,) that returns true if element  is the key of some node in splay-tree  and false otherwise. The algorithm works as follows: Beginning at the root of , we walk down a branch of  searching for  making use of the binary search tree property (i.e., if the key of the currently visited node is less than , we take right branch, and if the key of the currently visited node is greater than , we take the left branch). If a node with key  is found, we splay that node to the root of  and return true. If we reach a leaf node without finding a node with key , we simply return false and halt. Can we use the proof of amortized bounds for splay operations seen in lecture to conclude that the amortized cost of ELEMENT-CHECK is 

The right to a speedy trial, a public trial, an impartial jury, ability to confront witnesses, and have assistance of counsel for defense are all examples of which of the following below?

Given the following splay tree T, show the resulting configuration after the operation SPLAY-INSERT(T,6) is applied.

Regarding an arbitrary instance of the standard stable matching problem given advisors and students, which of the following statements are true. Select all that apply.

The following statements all concern greedy algorithms. Select all statements below that are true.

You may use the periodic table for these last questions.  What is the atomic number for the element potassium?