M

Mr. Dubey • 65.25K Points
Coach 

Q. Consider a small circular linked list. How to detect the presence of cycles in this list effectively?

(A) Keep one node as head and traverse another temp node till the end to check if its ‘next points to head
(B) Have fast and slow pointers with the fast pointer advancing two nodes at a time and slow pointer advancing by one node at a time
(C) Cannot determine, you have to pre-define if the list contains cycles
(D) Circular linked list itself represents a cycle. So no new cycles cannot be generated
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. What is the output of the following program? import sys L1 = tuple() print(sys.getsizeof(L1), end = " ") L1 = (1, 2) print(sys.getsizeof(L1)

Q. How do the nested calls of the function get managed?

Q. In a SOA, which of the following is NOT true?

Q. How do you change the file position to an offset value from the start?

Q. Reusing or recycling old items instead of buying new ones helps shrink your carbon footprint by…

Q. What is the termination criteria in Hill climbing?

Q. SDL means

Q. Which of the following conversion is not possible (algorithmically)?

Q. In case of nested subroutines the return addresses are stored in

Q. UPnP Stands for ..........

Question analytics