Data Structure Link List

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 Lis

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

• All of the above

Minimum number of fields in each node of a doubly linked list is

• 2

• 3

• 4

• None of the above

The elements of a linked list are stored

• In a structure

• In an array

• Anywhere the computer has space for them

• In contiguous memory locations

What is the time complexity of inserting an element at the beginning of a linked list?

• O(1)

• O(n)

• O(log n)

• O(n^2)

Which of the following is a disadvantage of using a doubly linked list?

• It requires more memory than a singly linked list

• It is more difficult to implement

• It does not allow for traversal in both directions

• None of the above

What is the space complexity of a linked list?

• O(1)

• O(n)

• O(log n)

• O(n^2)

What is the main advantage of using a circular linked list?

• It allows for traversal in both directions

• It requires less memory than a singly linked list

• It is easier to implement

• None of the above

What is the time complexity of deleting an element from the end of a linked list?

• O(1)

• O(n)

• O(log n)

• O(n^2)

Which of the following is a disadvantage of using a singly linked list?

• It requires more memory than a doubly linked list

• It is more difficult to implement

• It does not allow for traversal in both directions

• None of the above

What is the main advantage of using a doubly linked list?

• It allows for traversal in both directions

• It requires less memory than a singly linked list

• It is easier to implement

• None of the above