QUESTION 1 The _ search algorithm is a simple method of locating a specific item

Question

QUESTION 1

The _ search algorithm is a simple method of locating a specific item in a large collection of data.

sequential

binary

hashed

primary key

10 points   

QUESTION 2

A two dimensional array is an array of arrays. It can be thought of as having  and .

10 points   

QUESTION 3

In a two dimensional array, the first subscript represents the _ value

location

rows

index

columns

10 points   

QUESTION 4

A multiple dimensioned array with rows of different length.

jumbled

staggered

uneven

ragged

10 points   

QUESTION 5

The selection and quick _ algorithms place array elements into some order.

10 points   

QUESTION 6

All sorting algorithms have a method of _ two values in the array. This method moves elements from one position in the array to another.

swapping

exchanging

moving

ordering

10 points   

QUESTION 7

The binary search algorithm depends on the data being sorted.

True

False

10 points   

QUESTION 8

Arrays are immutable - meaning that they cannot change size. Your book presents the _ structure as one method to solve this problem.

ArrayList

Collection

LinkedList

HashTable

10 points   

QUESTION 9

Match the ArrayList method to the description

Inserts an element into the end of the ArrayList

removes an element from the ArrayList

Provides the number of elements in the ArrayList

This method allows you to change the item in an ArrayList at a specified position.

add()

remove()

size()

set()

10 points   

QUESTION 10

ArrayLists can hold any data type. To specify the type of class that the array list holds, you put the class name within the _ symbols.

[]

<>

()

{}

10 points   

sequential

binary

hashed

primary key

Explanation / Answer

1. sequential

2. rows and columns

3. rows

4. ragged

5. Sort

6. moving

7. True

8. ArrayList

9. A.

add()

remove()

size()

set()

10. []

add()

B.

remove()

C.

size()

D.

set()

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.