NAME___________________________________________________
Wentworth Institute of Technology
Division of Professional and Continuing Studies
COMP380 Section 71 - Data Structures I - Spring, 2006
Final – Open Book
Short Answers – 5 points each.
1.
(a)Declare an enumerated class called “Emotion”. Have the items in this class be “happy”, “sad”, “angry”.
(b) Write an enhanced for loop that prints out the values of Emotion
2. Add the appropriate items to the below diagram to make it into a stack.
3. List the methods (include the return datatypes and arguments with datatypes) that need to be implemented in order
for a class to implement the List interface
4. Put a checkmark next to the LEGAL statements below (T is a Generic datatype indicator):
______T item = new T();
______public class TwoTypes <T,K>
______public <T extends Comparable<? super T> > void aMethod(T anItem)
______anArray = new T[n];
______static <T> T getMax(T a, T b);
5. Write the “Big-O” running time notation of the following algorithms/operations:
Binary Search_______________________________________________
A bubble sort_______________________________________________
Cloning an array_____________________________________________
Accessing an element in an array________________________________
Insertion into a stack_________________________________________
/app/work/qkd26i-431935-2765038-finalcomp380sp06-doc.doc 11/28/2020 1
P1
P2
Total
