Data Structures Quiz

Which of the following is true about arrays?

• Data elements in an array can be accessed randomly

• Arrays can easily grow in size

• Each element in an array can hold a different type of data

• Arrays are an example of a non-linear data structure

What is a key characteristic of a graph as a non-linear data structure?

• It consists of nodes and edges

• It follows the LIFO principle

• It cannot represent complex networks

• It is a sequential structure like an array

In a binary search algorithm, what condition is necessary for the array or list?

• It must be sorted

• It must be unsorted

• It must contain unique elements

• It must be a multi-dimensional array

Which of the following is a linear data structure?

• Tree

• Graph

• Queue

• Both A and B

Which data structure uses a root node to connect all other nodes without forming cycles?

• Stack

• Queue

• Graph

• Tree

What operation is not typically supported by the linear data structure Stack?

• Push

• Pop

• Peek

• Retrieve an element at a specific index

What is the time complexity of a linear search in the worst case scenario?

• O(1)

• O(log n)

• O(n)

• O(n log n)

Which non-linear data structure is used to represent hierarchical relationships?

• Array

• Linked List

• Tree

• Stack

During a binary search operation, if the middle element is not the target, what should be the next step?

• Search the entire array again

• Search only the half where the target cannot exist

• Search only the half where the target could exist

• End the search

Which of the following statements about linked lists is false?

• Elements can be easily inserted and deleted

• It allows sequential access to elements

• It has a fixed size

• It can grow and shrink at runtime