1) Consider the C code fragment given below.

typedef struct node
{
    int data;
    node* next ;
} node;

void join(node* m, node* n)
{
    node* p = n;
    while (p->next != NULL)
    {
        p = p->next;
    }
    p–>next = m;
}

Assuming that m and n point to valid NULL- terminated linked lists, invocation of join will

2) Linked lists are not suitable data structures for which one of the following problems?

3) A circularly linked list is used to represent a Queue. 
A single variable p is used to access the Queue. 
To which node should p point such that both the operations enQueue and deQueue can be performed in constant time?

4) The following C function takes a simply-linked list as input argument. 
It modifies the list by moving the last element to the front of the list and returns the modified list. 
Some part of the code is left blank.

typedef struct node
{
int value;
struct node *next;
}Node;
Node *move_to_front(Node *head)
{
Node *p, *q;
if ((head== NULL: || (head->next == NULL))
       return head;
q = NULL; p = head;
while (p->next !=NULL)
{
        q = p;
        p = p->next;
}
    _______________________________
    return head;
}

Choose the correct alternative to replace the blank line.

5) 

The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1,2,3,4,5,6,7 in the given order. What will be the contents of the list after the function completes execution?

struct node 
{      
     int value;      
struct node *next;  
};  
Void rearrange (struct node *list )
{      
    struct node *p, * q;      
   int temp;      
   if( !list || !list-> next) 
        return;      
   p = list; q = list->next;      
   while (q) 
    {        
        temp = p->value;        
        p-> value = q ->value;        
        q-> value = temp;        
        p = q-> next;        
        q = p ? p->next : 0;      
    }  
}

6) The below function will reverse the given linked list.
Identify the missing statement at the blank given in function.
Assume variable head pointing to first node of the list.

void reverseList() 
{     
    struct node *prevNode, *curNode;     
    if(head != NULL)     
    {         
       prevNode = head;         
       curNode = head->next;         
       head = head->next;         
       prevNode->next = NULL;         
       while(head != NULL)         
       {             
           head = head->next;             
           curNode->next = prevNode;             
           prevNode = curNode;             
           curNode = head;         
      }         
    ----------------------     
   } 
}

7) The below delete function will delete a node from the singly linked list.
Assume head variable is takking the first node address of the list.

struct node
{
    int data;
    struct node *link;
};
void delete(node *x,int p)
{
    int i;
    for(i=0;i<p;i++,x=x->link);
    x->link=x->link->link;
}

The elements in the list after calling the delete(head,3) function?
If the list containing elements 1-2-3-4-5-6-null.

8) What is the functionality of the following code?

public void function(Node node)
{
        if(size == 0)
                head = node;
        else
        {
                Node temp,cur;
                for(cur = head; (temp = cur.getNext())!=null; cur = temp);
                cur.setNext(node);
        }
        size++;
}

9) Which of the following piece of code has the functionality of counting the number of elements in the list?

10) What is the functionality of the following piece of code?

public int function(int data)
{
        Node temp = head;
        int var = 0;
        while(temp != null)
        {
                if(temp.getData() == data)
                {
                        return var;
                }
                var = var+1;
                temp = temp.getNext();
        }
        return Integer.MIN_VALUE;
}