List Adt

Question 1

Implementing an ArrayList involves…

Answer 1

private Object[] elementData
private int size

Question 2

Inserting in a list involves…

Answer 2

Use a for loop from i < size() of the array -1
The data is shifted right
size++

Question 3

Removal in a list involves…

Answer 3

Use a for loop from i + 1 size() - 1 are shifted left by an index size–

Question 4

When an array is full the process involves…

Answer 4

Element data points to a new array with a size increased by 50%.
All current n elements are copied

Question 5

Which ADT uses LIFO?

Answer 5

Stacks(Last in First Out)

Question 6

Which ADT uses FIFO?

Answer 6

Queue(First In First out)

Question 7

What is the index pointer for a circular array?

Answer 7

tail = (head + size - 1) % length

Question 8

What are the 3 types of lists?

Answer 8

Unordered Lists
Ordered Lists
Indexed Lists

Question 9

Do indices need to start at zero for a list?

Answer 9

No it is an ADT not an array

Question 10

What does the add(index, dataItem) do?

Answer 10

adds the data item at the specified index

Question 11

What does the set(index, dataItem) do?

Answer 11

Sets dataitem at the specified index overwriting any data that was there

Question 12

What does the remove(index) do?

Answer 12

Removes and returns the data item at the specified index

Question 13

what does the indexOf(dataItem) do?

Answer 13

Returns the index of dataItem