Question

1. Which one ore more of the following statements is/are true of Java?

a.LinkedList < T > and ArrayList < T > are interfaces
b.List < T > is a concrete class
c.LinkedList < T > and ArrayList< T > are concrete classes
d.List < T > is an interface

2. Suppose we run these operations on a queue of characters:

enqueue 'a'

enqueue 'b'

enqueue 'c'

dequeue

dequeue

What remains in the queue after these operations complete?

a. 'a'
b. 'a', 'b'
c. 'b', 'c'
d. 'c'

3. Suppose we run this series of operations on a stack of characters:

push 'a'

push 'b'

pop

peek

push 'c'

pop

What value(s) is/are on the stack after these operations are complete?

a. 'a', 'b', 'c'
b. 'a', 'b'
c. 'c'
d. 'a'

4. Which of the following lists is *not* ordered from least-expensive complexity to most-expensive complexity?

a. O(1), O(log n), O(n), O(n ^ 2)
b. O(n log n), O(n), O(1), O(log n)
c. O(log n), O(n), O(n log n), O(n ^ 2)
d. O(l), O(n), O(n ^ 2), O(n ^ 3)

5. Which statement is false?

a. binary search of a sorted array is O(log n)
b. linear search of an array is O(n)
c. traversing a linked list is O(n)
d. adding an element to the end of an arraylist that has available space is O(n)

Answer 1