Data Structures Quiz

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

• Arrays have better cache locality that can make them better in terms of performance.

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

• Random access is not allowed in a typical implementation of Linked Lists

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

• All 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

Which of the following is not a disadvantage to the usage of array?

• Fixed size

• There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated size

• Insertion based on position

• Accessing elements at specified positions

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

• Deleting a node whose location in given

• Searching of an unsorted list for a given item

• Inverting a node after the node with given location

• Traversing a list to process each node

In linked list each node contain minimum of two fields. One field is data field to store the data second field is?

• Pointer to character

• Pointer to integer

• Pointer to node

• Node

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

What kind of linked list is best to answer question like “What is the item at position n?”

• Singly linked list

• Doubly linked list

• Circular linked list

• Array implementation of linked list

In circular linked list, insertion of node requires modification of?

• One pointer

• Two pointer

• Three pointer

• None

Linked lists are not suitable to for the implementation of?

• Insertion sort

• Radix sort

• Polynomial manipulation

• Binary search

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

• Dynamic

• Static

• Compile time

• None of the mentioned