Level 128 Level 130
Level 129

[No Typing] Data Structures

8 words 0 ignored

Ready to learn       Ready to review

Ignore words

Check the boxes below to ignore/unignore words, then click save at the bottom. Ignored words will never appear in any learning session.

All None

Data Structures
are very powerful and perform a wide range of functions
Enumeration interface
defines a means to retrieve successive elements from a data structure.
the BitSet class
implements a group of bits or flags that can be set and cleared individually
the Vector class
similar to a traditional Java array, except that it can grow as necessary to accommodate new elements.
the Stack class
implements a last-in-first-out (LIFO) stack of elements
the Dictionary class
an abstract class that defines a data structure for mapping keys to values.
the Hashtable class
provides a means of organizing data based on some user-defined key structure.
properties is a subclass of Hashtable
used to maintain lists of values in which the key is a String and the value is also a String.