Question

Java's LinkedList class represents a doubly-linked list. What is the Big-O behavior of its addFirstmethod for a list of size N?

Group of answer choices

O(1)

O(log N)

O(N)

O(N log N)

Flag this Question

Question 21 pts

Java's ArrayList class represents a basic array. As a convenience for the user, when the capacity of the backing array is exceeded, the class handles creating a new larger array and copying over the existing items.

Its add(int index, E element) method inserts the specified element at the specified position. What is the Big-O behavior of this method for a list of size N, when the value of index is 0 (i.e., when adding to the beginning of the array/list)?

Group of answer choices

O(1)

O(log N)

O(N)

O(N log N)

Flag this Question

Question 31 pts

What is the Big-O behavior of the addLast method in Java's LinkedList class for a list of size N?

Group of answer choices

O(1)

O(log N)

O(N)

O(N log N)

Flag this Question

Question 41 pts

What is the Big-O behavior of the add method in Java's ArrayList for a list of size N, when the value of index is N (i.e., when adding to the end of the array/list)?

You should assume that, in general, the backing array does not need to grow during a call to add.

Group of answer choices

O(1)

O(log N)

O(N)

O(N log N)

Flag this Question

Question 51 pts

What is the Big-O behavior of the get(int index) method in Java's LinkedList class for a list of size N, when the value of index is N/2?

Group of answer choices

O(1)

O(log N)

O(N)

O(N log N)

Flag this Question

Question 61 pts

What is the Big-O behavior of the get(int index) method in Java's ArrayList for a list of size N, when the value of index is N/2?

Group of answer choices

O(1)

O(log N)

O(N)

O(N log N)

Flag this Question

Question 71 pts

Match the data structure with the description of its behavior.

Group of answer choices

First in, first out

      [ Choose ]            Queue            Stack            Priority queue            Linked list      

Last in, first out

      [ Choose ]            Queue            Stack            Priority queue            Linked list      

Flag this Question

Question 81 pts

Evaluate this postfix expression: 4 5 7 2 + - *

(HINT: Use a stack.)

Flag this Question

Question 91 pts

When a stack is implemented with a basic array, the Big-O behavior of the push operation is the same as when it is implemented with a linked list.

Group of answer choices

True

False

Flag this Question

Question 101 pts

When a queue is implemented with a basic array, the Big-O behavior of the enqueue operation is the same as when it is implemented with a linked list.

Group of answer choices

True

False

Flag this Question

Question 111 pts

The pop operation for a stack has the same Big-O behavior as the dequeue operation for a queue.

Group of answer choices

True

False

Answer 1

Answer 1:
O(1) : as it is adding to head only. so we dont need to iterate anything

Answer 2:
O(N) : as we need to shuffle the remaining elements in the array. so we need iterate it

Answer 3:O(1)
as we have tail pointer we dont need to iterate anything

Answer 4:O(1) using indexes we can add the element to Array
so it will be O(1)

Please post other questions in separate post as per policy we have to answer 1 question per post. Please post separately .Thank you