MCQ Buddy
Search here...
  • Home
  • MCQ Feed
  • Add Question
  • Programming Portal
  • English Portal
  • Login
  1. Home
  2. Engineering
  3. Data Structure and Algorithms (DSA)
  4. Question

M

Mr. Dubey • 100.69K 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)
  • (C) θ (n)
  • (D) θ (1)
  • Correct Answer - Option(C)
  • Views: 309
  • Filed under category Data Structure and Algorithms (DSA)
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.

Related MCQs

Q. _______ is a merge sort that sorts a data stream using repeated merges.

Q. Del operator is ______________.

Q. Ring shift and Johnson counters are: ?

Q. To perform Rotation we require __________ and _____________.

Q. ___________ procedure accepts the coordinates of an internal point.

Q. What is the difference between a ring shift counter and a Johnson shift counter ?

Q. Latching current for the GTOs is ________ as compared to CTs (Conventional thyristors).

Q. In an SCR, the anode current consists of

Q. The Boolean function (x+y) (x’+z) (y+z) is equal to which one of the following expressions ?

Q. In a transistor as an amplifier, the reverse saturation current ?


Question analytics

Share

Embed

WhatsApp

Facebook

Telegram

Download

Share in MCQ Buddy Groups

Share
Embed
Important Links
  • Browse All Categories
  • Subjects
  • Exams
  • Mock Test
  • Advance Search
  • Quiz
  • Duo Test
  • English Topics
Explore More Portals
  • UC Quiz
  • Hindi
  • State wise Portals
  • MCQ Buddy Lab
  • Engineering
  • Programming Portal
  • MB Shorts
  • NCERT Portal
  • Faculties Portal
  • Groups
  • Q & A
  • Spaces
  • Satya Sanatan
  • Keycrypt
Who we are?

We are nothing if we are alone. But we have a huge community of students who are helping you getting good study stuff free.

More Links
  • Download App
  • Advertise with us
  • Contact us
  • Youtube
  • Terms & Conditions
  • Refund Policy
  • Privacy Policy
  • Get the source code

Since 2020 - 2025 | Proudly Made with ♥ in India

Hosted on Hostinger