Linked List

What does the following function do for a given Linked List with first node as head?

void fun1(struct node* head)

{

if(head == NULL)

return;

fun1(head->next);

printf("%d ", head->data);

}

• Prints all nodes of linked lists

• Prints all nodes in reverse order of linked lists

• Prints alternate nodes of linked lists

• Prints alternate nodes in reverse order of linked lists

To check isEmpty condition in Circular Linked List, fill in the blanks

int isEmpty()

{

if(_________________)

return 1;

else

return 0;

}

• List->Next==NULL

• List->Next==List

• List->Prev==NULL

• List->Prev==List

Consider the Find() Function in SLL. Fill in the blanks

Node * Find(Node * List,int x)

{

Node * Position;

Position=List->Next;

while(_________________________)

Position=Position->Next;

return Position;

• Position!=NULL && Position->Element!=x

• Position->Next!=NULL && Position->Element!=x

• Position!=List && Position->Element!=x

• Position->Next!=List && Position->Element!=x

Consider the FindPrevious() Function in SLL. Fill in the blanks

Node * FindPrevious(Node * List,int x)

{

Node * Position;

Position=List->Next;

while(_________________________)

Position=Position->Next;

return Position;

• Position!=NULL && Position->Next->Element!=x

• Position!=NULL && Position->Element!=x

• Position->Next!=NULL && Position->Next->Element!=x

• Position->Next!=NULL && Position->Element!=x

To check isLast() condition in Circular Linked List, fill in the blanks

int isLast(Node * Position, Node * List)

{

if(_________________)

return 1;

else

return 0;

}

• Position->Next==NULL

• List->Next==NULL

• Position->Next==List

• List->Next==List

Tick the routines which is same for CLL and SLL

• InsertMid

• DeleteMid

• DeleteBegin

• InsertBegin

What does the following function do for a given Linked List with first node as head?

void fun1(struct node* head)

{

if(head == NULL)

return;

head=head->next->next;

printf("%d ", head->element);

}

• Print all elements in order of linked list

• Print all elements in reverse order of linked list

• Print alternate elements in order of linked list

• Print alternate elements in reverse order of linked list

Which of the following points is/are true about Linked List data structure when it is compared with array

• It is easy to insert and delete elements in Linked List

• The size of array has to be pre-decided, linked lists can change their size any time.

• Both (a) and (b)

A linear collection of data elements where the linear node is given by means of pointer is called?

• Linked List

• Array

• Node List

• Primitive List

What is the functionality of the following piece of code?

public int function(Node * List, int data)

{

Node * temp = List;

int var = 0;

while(temp != null)

{

if(temp->Element == data)

{

return var;

}

var = var+1;

temp = temp->Next;

}

return -1;

}

• Find and delete a given element in the list

• Find and return the given element in the list

• Find and return the position of the given element in the list

• Find and insert a new element in the list