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
💬 Discuss
✅ Correct Answer: (B) Time complexity of inserting a new node at the head of the list is O(1)

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:20 pm in Data Structure (DS)

You must be Logged in to update hint/solution

💬 Discussion

Related MCQs

Q. Let a relation R in the set R of real numbers be defined as (a, b) Î R if and only if 1 + ab > 0 for all a, bÎR. The relation R is

Q. NUMA architecture uses _______in design?

Q. Fact 1: Jessica has four children Fact 2: Two of the children have blue eyes and two of the children have brown eyes. Fact 3: Half of the children are

Q. With a shared file

Q. If a RAM chip has n address input lines then it can access memory locations upto

Q. In which of the following pattern, a null object replaces check of NULL object instance?

Q. Snapshot isolation is used to give

Q. For any integer m>=3, the series 2+4+6+… +(4m) can be equivalent to

Q. Which is not an example of a truncated modulus?

Q. A ________ is a behavior that specifies the sequence of states an object goes through during its lifetime in response to events.

📊 Question Analytics

👁️
334
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
98%
Success Rate