a collection of data

an implementation based on arrays

a class

a mathematical abstraction

2. Question : (TCO 1) Which of these operations are present in most of the ADTs?

Push, pop, top

Inorder traversal, postorder traversal

Insert, remove, search

Insert in the back, delete from the front

3. Question : (TCO 1) _____ is an operation of lists.

Compare two items

Add an item

Postorder traversal

Hash

4. Question : (TCO 1) In order to insert an item somewhere in the middle of a list that is implemented using arrays, _____.

we must use the new operator

we must first delete the item stored in the location where the new item will be inserted
we must first make room in the array for the new item

None of the above

5. Question : (TCO 1) The function add(int location, int item) of the array-based implementation of lists _____.

determines the number of items in the list

adds the item at the end of the list

replaces the item in the list at the position specified by location

adds the item to the list at the position specified by location

6. Question : (TCO 1) _____ is not a typical operation of the bag ADT.

Add an item to the bag

Compare two bags

Remove all occurrences of an item from the bag

Determine if the bag is empty

7. Question : (TCO 1) The function add(int location, int item) _____.

is not a valid operation of bags

adds the item at the end of the bag

replaces the item in the bag at the position specified by location

adds the item to the bag at the position specified by location

8. Question : (TCO 1) Which list operation does the operation method below define?

public void operation(int item)
{
if (numberOfItems == SIZE) System.out.println(“ERROR”);
else
{
listArray[numberOfItems] = item;
numberOfItems++;
}
}

Clear

Remove

Add

Display