Database

A traversal that visits the left subtree, then the node, and then the right subtree is called:

Select one: a. Preorder Traversal b. Postorder Traversal c. Inorder Traversal d. Outoforder Traversal

Question 3 Not yet answered Marked out of 1.00 Not flaggedFlag question Question text For the following code fragment, select the choice which represents the most appropriate asymptotic analysis:

static int function ( n ) {

for (k=0; k

A[k] = k;

return A[k];

}

Choice 1. O ( n2 )

Choice 2. O( 2n )

Choice 3. ( n2 )

Choice 4. ( n )

(NOTE: code fragment is not intended to be functioning code)

Select one: a. Choice 1 b. Choice 2 c. Choice 3 d. Choice 4 Question 4 Not yet answered Marked out of 1.00 Not flaggedFlag question Question text When big-Oh and W coincide, we indicate this by using (select the best answer):

1. Big Oh (O)

2. Big Omega ()

3. Big Theta ()

4. Exponential growth

Select one: a. Choice 1 b. Choice 2 c. Choice 3 d. Choice 4