ITC Chap 9 (CSI) True/False
f
Head pointers are data types associated with static arrays.
f
A linked list stores data contiguously.
t
A multi-dimensional array consists of two or more single-dimensional arrays
f
A queue is another type of linked list that implements a LIFO storage system.
t
A stack is a last in, first out (LIFO) data structure.
t
A stack is a special form of a list that allows operations such as "push" and "pop".
t
An element is another name for a memory cell in an array.
t
Data structures organize the data in a computer.
t
Each position in the tree is called a node or vertex.
f
In a binary tree, the left node always has a value greater than the right node.
f
Insertions are made at the front of the queue.
f
Stacks are typically used to organize requests to print documents.
t
Stacks, like linked lists and arrays, are just memory locations organized into process friendly structures.
t
The bubble sort is highly inefficient in terms of processing speed.
f
The first address or position in an array starts with the number one (1).
t
The insertion sort is modeled after the manual process of sorting cards.
f
The memory cells of an array may store different types of data
f
The selection sort is highly efficient for large lists.
f
The shell sort incorporates a bubble sort to organize data.
t
The statement "anArray [2] = 5;" assigns the number five (5) to the third component of anArray.
t
The upper bound of an array initialized to a size of five (5) is position number four (4).
