DS - Linked List

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

Which of the following is not a type of Linked List ?

• Singly Linked List

• Doubly Linked List

• Hybrid Linked List

• Circular Linked List

Linked list is generally considered as an example of _________ type of memory allocation.

• Static

• Dynamic

• Compile Time

• None of these

Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.

• Pointer to Node

• Pointer to an Integer

• Pointer to Character

• Pointer to Class

What does a linked list use to store it's data?

• Node

• Step

• Array

• Module

Traversal of a linked list always starts from the __________.

• First Node

• Middle Node

• Last Node

• None of the Above

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 of linked list in reverse order

• Prints alternate nodes of Linked List

• Prints alternate nodes in reverse order

In linked list implementation of a queue, where does a new element be inserted?

• At the head of link list

• At the centre position in the link list

• At the tail of the link list

• None of the mentioned

In linked list implementation of a queue, the important condition for a queue to be empty is?

• FRONT is null

• REAR is null

• LINK is empty

• None of the mentioned