📊 Data Structure (DS)
Q. What is the worst case time complexity of inserting a node in a doubly linked list?
  • (A) O(nlogn)
  • (B) O(logn)
  • (C) O(n)
  • (D) O(1)
💬 Discuss
✅ Correct Answer: (C) O(n)

You must be Logged in to update hint/solution

💬 Discussion

Related MCQs

Q. In a function call, _____________ is passed as arguments.

Q. For the below mentioned codeint main() { int fd; fd = open(“logfile”, O_CREAT|O_RDWR, 0600); lseek(fd, 5, SEEK_CUR); write(fd, “Hell

Q. Software system is

Q. print(len(list1 + list2))

Q. Select the control which does not have any visible interface.

Q. Which of the following are decidable? 1) Whether the intersection of two regular language is infinite. 2) Whether a given context free language is reg

Q. What is the output of the following program? data = [x for x in range(5)] temp = [x for x in range(7) if x in data and x%2==0] print(temp)

Q. The terminal device that functions as a cash register, computer terminal, and OCR reader is the:

Q. A firewall is installed at the point where the secure internal network and untrusted external network meet which is also known as

Q. Causing a flag to became 0 is called:

📊 Question Analytics

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