Question 1:

(TCO 1) One of the ways an abstract data type can be implemented in C++ is by using a(n) _____.

array of nodes

friend function

class

virtual method

Question 2:

(TCO 3) What is the stack operation implemented in the following function? The variable top represents the stack top. int operation() { return list[top-1]; }

peek

getLength

clear search

Question 3:

(TCO 2) In a doubly linked list, the running time of accessing the first node is _____.

O(1)

O(n)

O(log n)

Question 4)

(TCO 1) These operations are present in most of the ADTs: _____.

push, pop, top

inorder traversal, postorder traversal

sort, remover all, find duplicates

insert, remove, search

(Question 5) Which of the following is a search algorithm or technique?

Quadratic search

Binary search

Fibonacci sequence

Divide and conquer

O(n log n)