Quiz 9

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

**(Wrong answer) Array List has better cache locality that can make them better in terms of performance

What does the following recursive function do for a given Linked List with first node as head? void myFunc(Node head) { if(head == NULL) return; myFunc(head.next); print(head.data + " "); }

Displays all nodes of linked list in reverse order

The LinkedLIst<T> class is a dynamic implementation of a doubly-linked list. Its elements contain a certain value and only one pointer which points to the next element.

False

In general, a singly-linked list allows:

Insertions and removals anywhere

Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

Merge Sort

Frequently inserting and removing items from a collection (especially a large number of items), can lead to low performance. In such cases it is advisable to use linked lists.

True

In a doubly-linked lists each element contains its value and two pointers - to the previous and to the next element.

True

In a singly-linked list the elements keep information about their next element.

True

Use of an ArrayList is preferred when we have to add / remove elements dynamically.

True

In the worst case, what is the number of comparisons needed to search a singly-linked list of length n for a given element?

n