Link List Data Structure Mock Test – 1

The function DELETE(head, element) is used to delete a node from the linked list by finding the node value with a given element. The parameter head is the first node of the list. Find the missing statements XX and YY in the following "DELETE" function to delete the node?
(Assume all elements are distinct in the list and the function returns pointers that points to the first node of the list.)

Node DELETE (Node head, int element)
{
    Node x=head;
    if(x.data==element )
    return head.next;
    while(x.next!=NULL)
    {
        if(_XX__)
        {
            __YY__
            return head;
        }
        x=x.next;
    }
} 

 if(x.next.data==99)   //XX
        {
            x.next=x.next.next;    //YY
            return head;
        } 

Identify the functionality of the following code when function return the value 1.
("head" pointer point to the first node of the non-empty linked list)

 int find(Node *head)
{
    Node *P1=head, *P2=head;
    if(head -> next != NULL)
    {
        P1=head -> next;
        P2=(head -> next)?head -> next -> next:NULL;
    }
    while((P1!= NULL) && (P2!=NULL)
    {
        if (P1==P2) return 1;
        P1=P1 -> next;
        P2= (P2-> next !=NULL)?P2 -> next -> next:NULL;
    }
    return 0;
}

Consider the following code:

Node * find (Node *head)
{
    Node *P1=head,*P2=head;
    while(P2)
    {
        P1=P1-> next;
        P2=(P2 -> next)?P2 -> next -> next:NUll;
    }
    printf("%d",P1 -> value);
}

Assume Node is the structure type with two parameters : 'value' and 'next'. Identify the node printed by the above code if non-empty linked list header is passed to the function find?

Consider the following code which is used to detect the loop in the linked list. Find the missing statement X?

p=head;
q=head -> next;
while(X)
{
    if(p==q) exit(0); //loop detected
    p=p -> next;
    q=(q -> next)?(q -> next -> next):q -> next;
    
} 

Let 'temp' be the pointer pointing to the node which needs to be deleted from a doubly linked list. Then find the correct option from the following to delete the node.