Enqueue and Dequeue are notations associated with which data structure:

Select one:

a. Queue

b. Stack

c. List

d. Array

The upper bound for the growth of the Algorithms running time is represented by (please 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

For the following code fragment, select the option which represents the most appropriate asymptotic analysis:

/** @return Position of largest value in "A */

static int largest(int[] A) {

int currlarge = 0; // Position of largest

for (int i=1; i

if (A[currlarge] < A[i])

currlarge = i; // Remember pos

return currlarge; // Return largest pos

}

Choice 1. ( n )

Choice 2. O( 2ⁿ )

Choice 3. ( n log n )

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