Bissoy.com
Doctors Medicines MCQs Q&A

What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?

What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)? Correct Answer O(1)

To add an element at the front of the linked list, we will create a new node which holds the data to be added to the linked list and pointer which points to head position in the linked list. The entire thing happens within O (1) time. Thus the asymptotic time complexity is O (1).

Related Questions

What would be the asymptotic time complexity to insert an element at the second position in the linked list?
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?
Consider the problem of reversing a singly linked list. To take an example, given the linked list below, the reversed linked list should look like Which one of the following statements is TRUE about the time complexity of algorithms that solve the above problem in O(1) space?
What would be the asymptotic time complexity to find an element in the linked list?
Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
Consider a single linked list where F and L are pointers to the first and last elements respectively of the linked list. The time for performing which of the given operations depends on the length of the linked list ?
In an adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. These are called twins of each other. A twin pointer is a pointer from an adjacency list entry to its twin. If |E| = m and |V| = n, and the memory size is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?
Which of the following assertions are CORRECT? P: Adding 7 to each entry in a list adds 7 to the mean of the list Q: Adding 7 to each entry in a list adds 7 to the standard deviation of the list R: Doubling each entry in a list doubles the mean of the list S: Doubling each entry in a list leaves the standard deviation of the list unchanged
Read the passage carefully and choose the best answer to each question out of the four alternatives.
Eight north Indian Ocean countries, namely, Bangladesh, India, the Maldives, Myanmar, Oman, Pakistan, Sri Lanka and Thailand, were asked to contribute names so that a combined list could be compiled. Each country gave eight names and a combined list of 64 names was prepared. This list is currently in use, and all cyclones arising in the north Indian Ocean are named from this list, with one name from each country being used in turn. Almost 38 or 39 names from the list have been used up, but since many cyclones dissipate long before they hit land, their names rarely figure in the papers or other media. The names that people do know about, and remember are, naturally, those that were most destructive ones, or very recent. Aila, in 2009 is remembered with a shudder for the enormous destruction it caused in West Bengal and Bangladesh; Phaillin, also for the damage it caused when it hit the Odisha coast in 2013. Two harmless cyclones, which also might remain in peoples memory, are the more recent ones of 2014 — Hudhud, which threatened the east coast of India and Nilofar, which was expected to, but did not, devastate the western coast. The names in the cyclone list are usually words one associates with storms; words which mean water or wind or lightning in various national languages. Sometimes they are names of other things — birds or flowers or precious stones. The name Aila, contributed by the Maldives means fire, the name Phaillin from Thailand means sapphire, the name Hudhud from Oman is the name of a bird, probably the hoopoe, and the name Nilofar, given by Pakistan, is the Urdu name of the lotus or water lily. The eight names suggested by India, and which are in the list of 64, are Agni, Akaash, Bijli, Jal, Leher, Megh, Sagar and Vayu, meaning in that order, fire, sky, lightning, water, wave, cloud, sea and wind. Five of these names (that is, up to Leher) have been used so far.
Which country did not contribute to the list of the cyclone names?