What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

Mr. Dubey • 89.33K Points
Coach

Q. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

(A) O(1)

(B) O(n)

(D) θ(1)

Correct Answer - Option(C)
Views: 593
Filed under category Data Structure (DS)

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Be the first to start discuss.

Q. The second set of the three permissions (r-) indicates that

Q. is used to minimize unnecessary redos during recovery.

Q. Which of the following selects only a subset of features belonging to a certain percentile

Q. The device which starts data transfer is called

Q. Wireless networks communicate using signal instead of cables.

Q. A small network making up the Internet and also having a small numbers of computers within it is called

Q. ------------- This type of model exhibits are pair of relationship such as activity time or cost quantity.

Q. The diagram is a problem-solving tool that investigates and analizessystematically all the potential or real causes that result in a single effect.

Q. Which of the following is true regarding RIPv2?

Q. What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

Discusssion

Related MCQs

Question analytics