Blog

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?  

The most abundant cell type in bone are

Figure 6-2 Endochondral OssificationUse Figure 6-2 to answer the following question(s):Identify the region labeled “2.”

Cells that release calcium from bone to maintain blood calcium levels are called