Exam 8: Abstract Data Types and Subprograms

What are the properties of a binary tree?

An abstract data type (ADT) is a container whose properties (data and operations) are specified independently of any particular implementation.

In order to determine how you can fly from Boston to Los Angeles in the fewest number of stops, you would use a(n) _____________________ searching algorithm defined on a graph.

A stack is managed in a FIFO manner.

In order to determine what the shortest flight in miles from Boston to Los Angeles would be, you would use a(n) ___________ searching algorithm defined on a graph.

Removing an item from a stack is called the _______________ operation.

Which of the following is an abstract data type that operates on a "last in, first out" (LIFO) manner?

Which level provides an abstract view of data and the operations that manipulate them?

A graphical map with vertices representing the names of cities and with edges linking the vertices representing two-way roads between the cities is an example of a(n) _______________ graph.

In a(n) _______________ tree, each node has no more than two children.

What is the maximum number of nodes in a binary tree with 3 levels?

Which of the following is made up of a set of nodes called vertices and a set of lines called edges (or arcs)?

In a(n) _______________ tree, the values stored in the nodes are organized to allow an item to be found efficiently.

The root of a tree has no child nodes.

Which of the following would you use to represent airline flights between cities?

An array is fixed sized, but a list is variable sized. Explain.

Parameters are the identifiers listed in parentheses beside a subprogram name.

Adding an item to a stack is called the _______________ operation.

A(n)______________ graph is one in which there are values attached to the edges in the graph.

What is a reference parameter?