CS 261 — Data Structures
Homework #3: Vectors (30 pts)
Due date: Friday, April 18, 2003 (5:00 PM)
This assignment is designed to make you think about the Vector data structure. Treat this paper as a
specification for your assignment. We will grade you code by providing a class that fully tests the various
method that you will implement. Study problems and exercises must be legible and will be graded on cor-
rectness.
What to do:
• Modify the Vector data structure so that it will support the Bag interface. Call your new version
VectorBag.java. What is the asymptotic complexity of the methods you need (include the
answer with you written homework)? (I suggest that you have the class VectorBag extend Vec-
tor and implement Bag.) (10 pts)
• Modify the Vector data structure so that it will support the FindMin interface. Call your new ver-
sion VectorMin.java. What is the asymptotic complexity of the methods you need? (Again, I suggest
a similar approach as with VectorBag above.) (5 pts)
Written homework:
• Answer(s) to any questions given above.
• Chapter 6 Study Questions 2, 3, 4, 6
Q 6.2) What does it mean to say that the array data type supports random access? (1 pt)
Q 6.3) What is a polymorphic variable? What are the two types of polymorphic variable in Java? (2
pts)
Q 6.4) What purpose is served by the wrapper classes in the Java standard library? (2 pts)
Q 6.6) What is the size of a Vector? What is the capacity? How are these two values different? (2
pts)
• Chapter 6 Exercises 1,5, and 6
E 6.1) Describe the state of a Vector after the following sequence of operations: (2 pts)
Vector v = new Vector();
v.setSize(4);
v.setElementAt(“A”, 3);
v.setElementAt(“B”, 1);
v.removeLast();
v.addElementAt(“C”, 2);
v.addLast(“D”);
v.setSize(6);
