M

Mr. Dubey • 52.70K Points
Coach 

Q. Which of the following is false about a circular linked list?

(A) Every node has a successor
(B) Time complexity of inserting a new node at the head of the list is O(1)
(C) Time complexity for deleting the last node is O(n)
(D) We can traverse the whole circular linked list by starting from any point
Share

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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The performance depends on

Q. The addition of two decimal digits in BCD can be done through

Q. In which phase packets are forwarded hop by hop to get closer to the sink?

Q. Which of the following is a Boolean cookie attribute?

Q. CASE (Computer Aided Software Engineering) is

Q. Which column contains all details of the permissions of a file when you issue the ls - l command?

Q. Redirection in pipes can be achieved by using

Q. What is meant by quasi-logical form?

Q. Perform encryption on the following PT using RSA and find the CT. p = 17; q = 31; M = 2.

Q. A step by step instruction used to solve a problem is known as

Question analytics