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 • 52.30K 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 : Option (C)

Discusssion

Be the first to start discuss.

Q. Difficulties in RFID tags are

Q. "john" in d

Q. Chromosomes are actually ?

Q. Point out the wrong statement.

Q. A mashup cloud can be designed by utilizing the Scalability of AWS and of GAE platforms

Q. The formal control deals with-------------------

Q. Which of the following are levels of design focus that can be used to categorize WebApp patterns?

Q. A graphics tablet works on same principal as

Q. Enumeration is referred to

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