Data Structures - LINKED LIST

Select one or more benefits of ADT

• Implementation of ADTs can be changed without requiring changes to the program that uses the ADTs

• Modularity

• Reuse

• Code is easier to understand

In a array implementation of array, before insertion i have to move elements to one direction, then i have to free the position and then i have insert. which of the following code does that?

• for(i = n-1 ; i >= pos-1 ; i--)

  list[i+1] = list[i];

• for(i = n-1 ; i >= pos-1 ; i--)

  list[i-1] = list[i];

• for(i = n-1 ; i >= pos-1 ; i--)

  list[i] = list[i+1];

• for(i = n-1 ; i >= pos-1 ; i--)

  list[i] = list[i-1];

Routine to delete element in an array implementation

• for(i=pos-1;i<n-1;i++)

  list[i]=list[i-1];

• for(i=pos-1;i<n-1;i++)

  list[i]=list[i*1];

• for(i=pos-1;i<n-1;i++)

  list[i]=list[i+1];

• for(i=pos-1;i<n-1;i++)

  list[i]=list[i+2];

Given below, code to display "n" elements in an array. Fill with appropriate values

for(i=___;i<____;i++)

printf("%d\t",list[i]);

• 0,n

• n,0

• 0,n-1

• n-1,0

Which of the following is/are the advantages of Linked list?

• Insertion and deletion of elements can be done efficiently

• It uses dynamic memory allocation

• Memory utilization is efficient compared to arrays

Which of the following is/are not the dis-advantage of Linked list?

• Linked list does not support random access

• Memory is required to store next field

• Searching takes time compared to arrays

• None of the above

Give syntax to create a node for Single linked list?

• newnode=(struct node *)malloc(sizeof(struct node*));

• newnode=(struct node )malloc(sizeof(struct node));

• newnode=(struct node *)malloc(sizeof(struct node));

• newnode=(struct node )malloc(sizeof(struct node*));

Give routine to insert at the beginning in a linked list whose structure is by struct node, with list head as L and pointer variable as next

• newnode->next=next;

  L=newnode;

• newnode->next=node;

  L=newnode;

• newnode->next=L;

  L=newnode;

• newnode->L=next;

  L=newnode;

How to insert a node after a position P in singly linked list?

• Newnode -> data = P ;

  Newnode -> next = p ->next ;

  P -> next = newnode ;

• Newnode -> data = x ;

  Newnode -> next = p ->next ;

  P -> next = L ;

• Newnode -> data = x ;

  Newnode -> next = p ->node ;

  P -> nextnode = next ;

• Newnode -> data = x ;

  Newnode -> next = p ->next ;

  P -> next = newnode ;

Which of the following is application of Singly Linked List?

• moving pages forward and backward in browser

• Giving chance to each player in a multi player game

• Implementing Stack