Datastructures | Linked-List

i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices.
ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don’t contain literal pointers
iii)in order to c

i, ii, iii, iv

i, ii, iii

i, ii

Question 5

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

Deleting a node whose location in given

Searching of an unsorted list for a given item

Inverting a node after the node with given location

Traversing a list to process each node

Question 6

What would be the asymptotic time complexity to add an element in the linked list?

Question 7

Complete the code given below which has the functionality that counts the number of elements in the list:
public int length(Node head)

public int length(Node head)
	{
	    int size = 0;
	    Node cur = head;
	    while(cur!=null)
	    {
	    	//complete the code
	    }
	    return size;
	}

size++;
cur = cur.getNext();

cur=cur.getNext();
size++;

size++;
cur = cur.getNext().getNext();

None of the above

Question 8

Linked lists are not suitable to for the implementation of?

Radix Sort

Merge sort

Polynomial manipulation

Binary search

Question 9

Which of the following is true about the linked list implementation of the queue?In a push operation, if new nodes are inserted at the beginning of a linked list, then in pop operation, nodes must be removed from the end.

In a push operation, if new nodes are inserted at the beginning of a linked list, then in pop operation, nodes must be removed from the end.

In a push operation, if new nodes are inserted at the end, then in pop operation, nodes must be removed from the beginning.

Both of the above