TCS Linked List Quiz-1

merge and insertion sort can be used to for linked lists. The slow random access performance of a linked list makes other algorithms such as quicksort perform poorly, and others such as heapsort completely impossible.

Since worst case time complexity of merge sort is O(nLogn) and insertion sort is O(n^2), so merge sort is performed .

Linked list is used for viewing the image when we see the next or previous image. The address of previous or next image save in current image..

Answer: A
Explanation: To count the number of elements, you have to traverse through the entire list, hence complexity is O(n).

 

This function is for the insertion from the last look up the condition. if the head is empty so we need to add a node at starting otherwise we go to the last node and then add the node.

 The function is for the search a given data and then return the position, look at the function here nodes are compared with the given data and at last it return the position.

 

look at the function here the first node that is head store in the node and till we do not get null in the node so we will do size+1.

The code which is left where we need to exchange the front and the last node.

q- >next=null;

p- >next=head;

head=p;

As its name suggests it is circular in shape and a circle has no starting point as well as ending point so the same goes for the circular linked list.

When a data is needed to be retrieved from the linked list data structure, then there is a need of going through all the nodes, until the required data is not found.

You can do it in O(1) with any implementation that uses pointers and in which you can get to the last element in one operation. CLL lets you do a back from the head element to get to the end, then you update a few pointers and you\'re done. However, if you just have a member that points at the last element, you can use any other pointer based implementation just as well.