CSC 216 Ch 5-9 Key Concepts

Queue elements are processed in a _________ Manner.

First in first out

A _________ is a convenient collection for storing a repeating code key.

queue

Simulations are often implemented using __________ to represent waiting lines.

queues

A linked implementation of a queue is facilitated by _________ to the first and last elements of the linked list. 

references 

The enqueue and dequeue operations work on __________ ends of the collection.

opposite

Because queue operations modify both ends of the collection, fixing one at the index 0 requires the elements be __________.

shifted

The ____________ if elements in a noncircular array implementation creates an O(n) complexity.

shifting

Treating arrays as __________ eliminates the need to shift elements in an array queue implementation.

circular

List collections can be categorized as ordered, unordered, or _________.

indexed

The elements of an ordered list have an ___________ relationship defining their order.

inherent

The elements of an ________ list are kept in whatever order the client chooses.

unordered

An indexed list maintains a __________ numeric index range for its elements.

contiguous

The Java API does not provide a _______ that implements an ordered list.

class

Many common operations can be defined for all ________ types. The differences between them stem from how elements are added.

list

Interfaces can be used to ________ other interfaces. The child interface contains all abstract methods of the parent.

derive

An interface name can be used to ____________ an object reference variable. An interface reference can refer to any object of any class that implements the interface. 

declare

Interfaces enable us to make ___________ references in which the method that is invoked is based on the particular object being referenced at the time.

polymorphic

The Josephus problem is a classic computing problem that appropriately solved with ________ lists.

indexed

Only Comparable objects can be ________ in an ordered list.

stored

An iterator is an object that provides a way to ________ each elements in a collection in turn. 

access

A collection is often defined as ___________. which means it provides an Iterator when needed.

Iterable

The optional _______ method of an iterator makes it possible to remove an element without having to traverse the collection again.

remove

Most iterators are __________ and will throw an exception if the collection is modified while an iterator is active.

fail-fast

You should make no assumptions about the order in which an __________ delivers elements unless it is explicitly stated.

iterator

An iterator class is often implemented as an _______ class of the collection to where it belongs.

inner

An iterator checks the __________ count to ensure that it stays consistent with the modification count from the collection when it was created.

modification

Recursion is a programming technique in which a method calls ________.

itself

Any recursive definition must have a ___________ part, called the base case, that permits the recursion to eventually end.

nonrecursive

Mathematical problems and formulas are of expressed _________.

recursively

Each recursive call to a method creates new ___________________________.

local variables and parameters.

A careful trace of _________ processing can provide insight into the way it is used to solve a problem.

recursive

Recursion is the most elegant and appropriate way to solve some problems, but for others it is less __________ than an iterative solution. 

intuitive

The order of a recursive algorithm can be determined using techniques similar to those used in analyzing __________ processing.

iterative

The Towers of Hanoi solution has ____________ complexity, which is very inefficient, yet is incredibly short and elegant.

exponential

What is the process of finding a designated target within a group of items or determining that the target doesn’t exist?

Searching

An efficient search ____________ the number of comparisons made.

minimizes

A ___________ is made static by using the static modifier in the method declaration. 

method

A binary search capitalizes on the fact that the search pool is ________.

sorted

A binary search _____________ half of the viable candidates with each comparison.

eliminates

A binary search has ___________ ____________, which makes it very efficient for a large search pool.

logarithmic complexity

__________ is the process of arranging a list of items into a defined order based on some criterion. 

Sorting

The selection sort algorithm sorts a list of values by ________ putting a particular value into its final, sorted position.

repetitively

The _________ sort algorithm sorts a list of values by repetitively putting a particular value into a subset of the list that has already been sorted.

insertion

The _________ sort algorithm sorts a list by repeatedly comparing neighboring elements and swapping them if necessary.

bubble

The __________ sort algorithm sorts a list by partitioning the list and then recursively sorting the two partitions. 

quick 

The _________ sort algorithm sorts a list by partitioning the list and then recursively sorting the two partitions.

merge

A ________ sort is inherently based on queue processing.

radix