Deck 8: Lists and Arrays in Alice

Question 1

Computer programmers decide which data structures to use based on the nature of the data.

Answer 1

True

Question 2

Data exits a queue in the same order in which it entered the queue.

Answer 2

True

Question 3

A graph is a common data structure.

Answer 3

True

Question 4

A binary tree is good for storing information that needs to be searched quickly, such as a dictionary or phone directory.

Question 5

A queue would be a good data structure to use for keeping track of documents waiting to be printed on a networked printer.

Question 6

A queue is a very good data structure to use for a set of objects that needs to be searched quickly.

Question 7

You should always start searching a binary tree by looking at the root node.

Question 8

The efficiency of the binary tree comes from the fact that each time you look at a node, you either find the item you want, or move down one level in the tree. This cuts the remaining data to be searched in half.

Question 9

To find an item in a queue, you need to start at one end of the queue and go through each item, one at a time, until you find the item for which you are searching.

Question 10

On average, you will need to look at 500 items to find a single object in a queue with 1,000 items.

Question 11

In a binary tree with a thousand items, the longest it would take to find any item is 1/10th of a second.

Question 12

Alice also has two instructions to manipulate lists - For all in order and For all together.

Question 13

For all together will perform an operation on each item in a list one at a time, beginning with the first item in the list and going through the list in order.

Question 14

For all in order will perform an operation on all of the items in a list at the same time.

Question 15

Do in order and Do together operate on a set of objects.

Question 16

For all in order and For all together operate on a set of instructions.

Question 17

An array is a set of objects.

Question 18

A list is a set of variables that hold objects.

Question 19

In mathematics, especially matrix algebra, index values for elements in an array are usually subscripted.

Question 20

An array of the names of four cities might be referred to as city₀, city₁, city₂, and city₃, or as city[0], city[1], city[2], and city[3].

Question 21

Every array is linear.

Question 22

A list may be multidimensional.

Question 23

The elements array[index] and array[index +1] are adjacent elements in an array.

Question 24

In a bubble sort, the computer goes through the array, comparing each value to the one that follows it.

Question 25

A bubble sort is the most efficient way to sort an array.

Question 26

A(n) ____ is a scheme for organizing data in the memory of a computer.

A) index value
B) data structure
C) object
D) queue

Question 27

Data enters a(n) ____ at one end and leaves it at the other.

A) index
B) list
C) array
D) queue

Question 28

A set of names, addresses, and phone numbers stored as a table is an example of a(n) ____.

A) index
B) data structure
C) object
D) queue

Question 29

A(n) ____ is a set of data items with a beginning and end.

A) index
B) data structure
C) object
D) queue

Question 30

A ____ is a data structure that looks like an upside-down tree.

A) graph
B) heap
C) binary tree
D) B-tree

Question 31

Each spot on a binary tree is called a(n) ____.

A) node
B) stack
C) array
D) index

Question 32

A(n) ____ holds an item of data, along with a left pointer and a right pointer.

A) node
B) stack
C) list
D) array

Question 33

The nodes at the bottom of each branch of a binary tree are called the ____.

A) links
B) leaf nodes
C) root nodes
D) edges

Question 34

The node at the top of the binary tree is called the ____.

A) leaf node
B) edge
C) link
D) root node

Question 35

A(n) ____ is an ordered set of data.

A) stack
B) graph
C) list
D) array

Question 36

A(n) ____ is often used to store objects that are to be processed sequentially.

A) stack
B) graph
C) list
D) array

Question 37

____ are often used to set up queues.

A) Stacks
B) Queues
C) Lists
D) Arrays

Question 38

To ____ means to go through each item in a list one at a time, beginning with the first item in the list and going through the list in order.

A) iterate a list
B) traverse a list
C) sort a list
D) index a list

Question 39

Which of the following commands inserts an item at the beginning of the world.bunnies list?

A) insert <item> at beginning of world.bunnies
B) insert <item> in world.bunnies
C) insert <item> at beginning <index> world.bunnies
D) insert <item> at position <index> world.bunnies

Question 40

Which of the following commands inserts an item at the end of the world.bunnies list?

A) insert item end of world.bunnies
B) insert <item> at end of world.bunnies
C) insert <item> at end of position <index> world.bunnies
D) insert <item> at position <index> world.bunnies

Question 41

Which of the following commands removes an item from the beginning of the world.bunnies list?

A) remove item from beginning position <index> of world.bunnies
B) remove item from <index> world.bunnies
C) remove item from beginning of world.bunnies
D) remove item from world.bunnies

Question 42

Which of the following commands removes an item from a specific position in the world.bunnies list?

A) remove <item> from position <index> world.bunnies
B) remove <item> at <index> of world.bunnies
C) remove <item> at position <index> world.bunnies
D) remove item from position <index> of world.bunnies

Question 43

Which of the following commands inserts an item in a specific position in the world.bunnies list?

A) insert at position <index> of world.bunnies
B) insert <item> at <index> of world.bunnies
C) insert <item> at position world.bunnies
D) insert <item> at position <index> of world.bunnies

Question 44

Which of the following commands removes all items from the world.bunnies list?

A) remove item <index> from world.bunnies
B) delete item <index> from world.bunnies
C) remove all items from world.bunnies
D) delete all items from world.bunnies

Question 45

Which of the following commands removes an item from the end of the world.bunnies list?

A) remove item <index> from world.bunnies
B) delete item <index> from world.bunnies
C) remove item from end of world.bunnies
D) delete item from end of world.bunnies

Question 46

A(n) ____ is a set of indexed variables, each containing objects of the same data type.

A) queue
B) array
C) list
D) stack

Question 47

A ____ is simply a way of measuring something, such as the length, width, and height of three-dimensional objects.

A) dimension
B) point of view
C) thread
D) parameter

Question 48

A simple one-dimensional array is sometimes called a ____.

A) list
B) matrix
C) queue
D) vector

Question 49

A two-dimensional array could be thought of as having rows and columns, with one subscript for the row and one for the column. Such a two dimensional array is sometimes called a table or a two-dimensional ____.

A) vector
B) list
C) matrix
D) queue

Question 50

A(n) ____ is used to show us an array in an Alice world, rather than just creating it in the memory of the computer.

A) Array Visualization Object
B) Visual Array Object
C) World Array
D) Array Instance