COP 3330 – Object Oriented Programming in Java Quiz 4 Review

Flashcards covering key concepts and definitions from the COP 3330 course material for Quiz 4.

ArrayList class

Allows you to manage a dynamically sized list.

add() method in ArrayList

Has a time complexity of O(1).

ArrayDeque class

Allows you to simulate Stack, Queue, and Double Ended Queue.

add/remove methods in ArrayDeque

Have a time complexity of O(1) for adding/removing first/last elements.

StringTokenizer class

Used to help parse a String with delimiters.

HashSet class

Allows for O(1) expected time insert, delete, and search; unordered.

TreeSet class

Allows for O(lg n) expected time insert, delete, and search; stored as a balanced binary search tree.

HashMap

Maps each item (key) to a value; run-times are similar to HashSet.

TreeMap class

Maps each item (key) to a value; run-times are similar to TreeSet.

PriorityQueue class

Allows for inserting items and deleting the minimum item in O(lg n) time.

Exceptions

Must be reported (thrown) or handled (using try-catch) in methods.

try-catch

Sets up blocks for handling exceptions; can catch different types of exceptions.

Input/Output Files

Uses Scanner for input and PrintWriter for output; remember to close both.

Quiz Format Coding Questions

Involves writing code segments and filling in solutions; no need for template code.

Java API

Used for tracing questions and scoring.

Quiz Aids

Java documentation posted online will be provided, no other aids necessary.