NAME________________________________________________ DATE____________
Wentworth Institute of Technology
Division of Professional and Continuing Studies
COMP380 Section 71 – Data Structures I - Spring, 2006
Quiz Number 2 – OPEN BOOK
1. Add the appropriate items to the below diagram to make it into a Doubly Linked List (ie add the missing fields
and missing arrows and indicators of the front and rear of the list and label the fields)
2. Given the below recursive method, what is the value of
int ffudge( int n) {
if (n == 0) return 1;
if (n==1 ) return 2;
return 3*ffudge(n-2) + 2*ffudge(n-1);
}
a. ffudge(3)
b. ffudge(6)
3.
a. What operation is EASY to do for an array-based list, but is hard to do with Linked? Why?
b. What operation is EASY to do for Linked lists, but is Hard to do with array-based lists? Why?
4.
a. How can you avoid popping from an empty stack?
b. What message do you get if you do attempt to pop from an empty stack?
5. What does this statement do in the context of operating on a Linked list?
prior.next = curr.next;
/app/work/qkdc8b-479270-2765041-quiz2comp380sp06-doc.doc 1 12/4/2020
