Foothill College

CS 1B

CS 1B Final Exam
Due Mar 28 at 11:59pm Points 100 Questions 34
Available until Mar 28 at 11:59pm Time Limit None
Instructions
Attempt History
Attempt Time Score
LATEST Attempt 1 4,926 minutes 87 out of 100
Correct answers will be available on Mar 29 at 8am.
Score for this quiz: 87 out of 100
Submitted Mar 28 at 10:55pm
This attempt took 4,926 minutes.
You can look at lectures or texts and even use your compiler, but you may not consult any other individ
for help.
Multiple choice questions with square checkboxes may have more than one correct answer . Multiple
choice questions with round radiobuttons have only one correct answer .
Any code fragments you are asked to analyze are assumed to be contained in a program that has all th
necessary variables defined and/or assigned.
2 / 3 ptsQuestion 1PartialPartial
java.util LinkedLists have which of the following properties?
(Check all that apply.)
They do not require that any ordering relation (like an compareTo()) be
defined for the underlying data type.Their add() method requires us to pass a wrapper object, like Float, rather
than a primitive, like float to them.
They have an associated generic class ListIterator, which can be used to
iterate through LinkedLists.They can be directly declared by passing a primitive data type, like float, to
the type parameter, without using a wrapper class, Float.
java.util LinkedLists have no implicit compareTo() relation imposed
on their type parameter. One consequence is that there is no builtin
ability to create sorted lists. We, as clients, would have to write
suchinsert() or remove() code ourselves. The cannot be decalared
using primitive types, directly, although once declared, primitive data
can be passed to them using add(). The latter happens as a
consequence of autoboxing of primitives into wrappers, and we