| A | B | C | D |
|---|---|---|---|
|
What is FALSE
T/F DeQueue is defined as when an element is inserted into a queue.
|
What is this
____ can be used inside any method to refer to the current object.
|
What is PUSH
When an element is inserted into a Stack it's called what?
|
What is Up-casting is casting to a supertype, while downcasting is casting to a subtype.
What is the difference between upcasting and downcasting?
|
|
What is Unified Modeling Language
UML stands for
|
What is OVERFLOW
Enqueuing an element in a full queue is called what?
|
What is to declaration to declare the type of exceptions
that might occur within it.
We use the throws keyword in the method
|
What is catch or finally block.
Each try block needs to be followed by at least one ___.
|
|
What is LAST IN FIRST OUT
what does LIFO mean
|
What is gets the element at the front of the queue without removing it
What does the function peek() do?
|
What is UNDERFLOW
Trying to pop out an empty stack is called?
|
What is to check if the queue is full
When do you use the isFull() function?
|
|
What is ABSTRACT
Stack is an ____ Data Type
|
What is TRUE
t/f Enums are often used in switch statements to check for corresponding values:
|
What is ABSTRACT
This is a special data type they are defined as: List, Stack, Queue, Set, and Map.
|
What is push
When an element is inserted in a stack, the concept is called a
|
|
What is returns the number of elements stored in the stack
What does int size() Auxiliary stack operations do
|
What is
1. Single Dimensional Arrays 2. Two-dimensional Arrays 3. Multi-dimensional arrays
Arrays can be of 3 types:
|
What is a single exception.
The throw keyword is used to explicitly throw
|
What is Enqueue
When an element is inserted in a queue, the concept is called
|
Support Us on Ko-fi