CS 303L Data Structure and Algorithm
February 7, 2008
Homework 3
(Due on February 14, 2008)
1. Please select from one of the following answers for the questions listed below:
a. 𝑂(1)
b. 𝑂(𝑛)
c. 𝑂(log 𝑛)
d. 𝑂(𝑛log 𝑛)
e. 𝑂(𝑛2)
f. None of the above.
(1) The time complexity of finding the maximum value in a single-linked list of integers
sorted in ascending order.
(2) The time complexity of finding the maximum value in a single-linked list of integers
sorted in descending order.
(3) The time complexity of finding the maximum value in a double-linked list of integers
sorted in ascending order.
(4) The time complexity of finding the maximum value in an unsorted double-linked list
of integers.
(5) The time complexity of removing the last element of a double-linked list without a
tail pointer.
(6) What is the worst case time complexity of searching for an item in a sorted array
using binary search?
(7) The time complexity of finding the minimum value is a complete binary minimum
heap.
(8) The time complexity of inserting an element to a heap tree with n nodes.
(9) The time complexity of building a heap tree with n nodes by insertion method.
(10) The time complexity of giving a key to find a value stored in the hash.
