Data Structures Quiz

Which of the following statements about arrays is true?

• Array stores elements in random memory locations

• Array stores elements in continuous memory locations

• Array elements are linked using pointers

• Array elements can have different data types

What is the time complexity to access an element in an array by index?

• O(n)

• O(log n)

• O(1)

• O(n²)

In an array of size n, how many elements can be stored?

• n

• n+1

• n–1

• Infinite

What is a limitation of arrays?

• They are too slow

• They cannot be sorted

• They have fixed size

• They cannot hold integers

Which operation in an array is the most time-consuming (on average)?

• Accessing an element

• Inserting at the end

• Deleting from the beginning

• Updating a value

Which of the following data structures is best suited for dynamic memory usage?

• Array

• Linked List

• Stack

• Queue

In a singly linked list, each node contains:

• Data and one pointer

• Only data

• Two pointers

• Three pointers

What is the time complexity of inserting a new node at the beginning of a linked list?

• O(n)

• O(1)

• O(log n)

• O(n²)

If a linked list has its last node pointing to the first node, what kind of linked list is it?

• Doubly linked list

• Circular linked list

• Linear linked list

• None of these

What will happen if you try to access a node beyond the end of a linked list?

• It returns null

• It wraps around

• It deletes the list

• It throws an error automatically