Problem 1

Determine the big-O expression for each of the following T(N) functions:

A: T(N) = 2N + N ( N + 3)

B: T(N) = 5

C: T(N) = N + log N²

D: T(N) = N ( 2 + log N )

Problem 2

Given an array list, determine following big-O costs:

A: Worst case cost associated with finding the i^th element.

B: Average cost for checking if a specific data value is present. All locations are equally likely.

Problem 3

Given a linked list, determine following big-O costs:

A: Worst case cost associated with finding the i^th element.

B: Average cost for checking if a specific data value is present. All locations are equally likely.