DS Quiz for 4th Sep.

Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time?

I.Insertion at the front of the linked list

II. Insertion at the end of the linked list

III.Deletion of the last node of the linked list

IV.Deletion of the front node of the linked list

• I and II

• I and III

• I,II and III

• I,II and IV

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

• O(1)

• O(n)

• O(n²)

• None

A variant of linked list in which last node of the list points to the first node of the list is?

• Singly linked list

• Doubly linked list

• Circular linked list

• Multiply linked list

In doubly linked lists, traversal can be performed?

• Only in forward direction

• Only in reverse direction

• In both directions

• None

According to today class discussion what should be filled at dotted position

while(ptr->next!=NULL)

{

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

.................................

}

According to today class discussion what should be filled at dotted position

Hint:- In Create function

temp=(struct node *)malloc(sizeof(struct node));

printf("Enter data:");

scanf("%d",&x);

temp->data=x;

temp->next=NULL;

if(head==NULL)

head=...............................;