Understanding Arrays and Linked Lists

Data structure you see in the picture is ...

• 2D Array

• 1D Array

• Singly Linked List

• Doubly Linked List

Which of the following operations is the most time-consuming for an array?

• Accessing an element

• Inserting an element at the beginning

• Deleting an element from the end

• Updating an element

What is the primary advantage of a linked list over an array?

• Faster access to elements

• Dynamic size

• Easier to sort

• Less memory usage

What is the main difference between a singly linked list and a doubly linked list?

• Singly linked lists have two pointers per node

• Doubly linked lists can only be traversed in one direction

• Doubly linked lists have two pointers per node

• Singly linked lists can be traversed in both directions

What happens during dynamic array resizing?

• The array is compressed to save space

• The array is copied to a new location with more space

• The array is split into smaller arrays

• The array is converted into a linked list

In a singly linked list, how do you traverse the list?

• By using a stack

• By following the next pointers

• By using a queue

• By using an index

Which operation is typically more efficient in a linked list than in an array?

• Accessing an element by index

• Deleting an element from the end

• Sorting the elements

• Inserting an element at the beginning

What type of linkedlist is represented in the image

• singly linkedlist

• doubly linkedlist

• circular singly linkedlist

• circular doubly linkedlist

Which of the following is a disadvantage of using a linked list over an array?

• Slower access time

• Fixed size

• Inefficient insertion

• Requires contiguous memory

In a linked list, what is the time complexity of inserting an element at the end if the tail pointer is not maintained?