This preview shows pages 1–2. Sign up to view the full content.
COP 3530 Midterm, Part 2 (Mar 5, 2008)
NAME:
.
1. (24 points) For each of the following operations, state the bestcase (Ω(
...
)) and worstcase
(
O
(
...
)) run time. Assume that the data structure contains
n
objects. Assume that a singly
linked list has a reference to the head, but
not
the tail (just like the book).
(a) Given an index
i
, ﬁnd the
i
th item in a singly linked list.
Solution:
Ω(1) and
O
(
n
). Alternatively, Ω(
i
) and
O
(
i
); either solution (or combination
of solutions) is ﬁne.
(b) Given an index
i
, ﬁnd the
i
th item in an ArrayList.
Solution:
Ω(1) and
O
(1).
(c) Given a new node
t
and a node
p
already in the list, insert
t
just
before
node
p
in a
singly linked list.
Solution:
Ω(1) and
O
(
n
). Alternatively, Ω(
i
) and
O
(
i
); either solution (or combination
of solutions) is ﬁne.
(d) Given a new node
t
and a node
p
already in the list, insert
t
just
after
node
p
in a singly
linked list.
Solution:
Ω(1) and
O
(1).
(e) Given a new node
t
and a node
p
already in the list, insert
t
just
before
node
p
in a
circular doubly linked list.
Solution:
Ω(1) and
O
(1).
(f) Given a new node
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview. Sign up
to
access the rest of the document.
This test prep was uploaded on 04/18/2008 for the course COP 3530 taught by Professor Davis during the Spring '08 term at University of Florida.
 Spring '08
 Davis
 Algorithms, Data Structures

Click to edit the document details