QUESTION 6 The worst-time complexity for selection sort is ________. O(1) O(logn

Question

QUESTION 6

The worst-time complexity for selection sort is ________.

O(1)

O(logn)

O(n)

O(nlong)

O(n*n)

QUESTION 9

In the implementation of MyLinkedList, last.next is always null.

True

False

QUESTION 10

In the implementation of MyArrayList, capacity is the length of the array used to store the elements in the list.

True

False

QUESTION 11

O(n*n) is ________.

constant time

logarithmic time

linear time

log-linear time

QUESTION 10

In the implementation of MyArrayList, capacity is the length of the array used to store the elements in the list.

True

False

QUESTION 13

In the implementation of MyLinkedList, Node is defined as a static inner class inside MyLinkedList because it does not reference any instance data fields in MyLinkedList.

True

False

QUESTION 15

A heap is a full binary tree.

True

False

1 points   

QUESTION 17

The time complexity for the Euclid's algorithm is ________.

O(n)

O(n^2)

O(logn)

O(2^n)

QUESTION 20

The worst-time complexity for linear search is ________.

O(1)

O(logn)

O(n)

O(nlong)

O(n*n)

QUESTION 21

In the implementation of MyLinkedList, Node has a property named element that stores an element.

True

False

QUESTION 23

MyArrayList and MyLinkedList are two concrete implementations of MyList.

True

False

O(1)

O(logn)

O(n)

O(nlong)

O(n*n)

QUESTION 9

In the implementation of MyLinkedList, last.next is always null.

True

False

QUESTION 10

In the implementation of MyArrayList, capacity is the length of the array used to store the elements in the list.

True

False

QUESTION 11

O(n*n) is ________.

constant time

logarithmic time

linear time

log-linear time

QUESTION 10

In the implementation of MyArrayList, capacity is the length of the array used to store the elements in the list.

True

False

QUESTION 13

In the implementation of MyLinkedList, Node is defined as a static inner class inside MyLinkedList because it does not reference any instance data fields in MyLinkedList.

True

False

QUESTION 15

A heap is a full binary tree.

True

False

1 points   

QUESTION 17

The time complexity for the Euclid's algorithm is ________.

O(n)

O(n^2)

O(logn)

O(2^n)

QUESTION 20

The worst-time complexity for linear search is ________.

O(1)

O(logn)

O(n)

O(nlong)

O(n*n)

QUESTION 21

In the implementation of MyLinkedList, Node has a property named element that stores an element.

True

False

QUESTION 23

MyArrayList and MyLinkedList are two concrete implementations of MyList.

True

False

Explanation / Answer

As per Chegg policy, I am answering only 4 questions. In order to get the solution of remaining questions, please upload them again.

6.) In all the cases, selection sort will take O(n*n). Hence option e is the correct option.

15.) A heap is a complete binary tree not a full binary tree. Hence False

17.) Time complexity for Euclid's theorem is O(log n). Hence option c is the correct option.

20.) The worst time complexity for linear search is O(n). Hence option c is the correct option.

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

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