basic data structure and searching algorithm

What is a data structure?

• A. A way of organizing, managing, and storing data for efficient access and modification.

• B. A programming language feature for creating variables.

• C. A type of algorithm used for sorting data.

• D. A graphical representation of data relationships.

Which data structure allows you to store elements in a non-linear relationship?

• A. Array

• B. Linked List

• C. Queue

• D. Tree

Which search algorithm requires the data to be sorted before searching?

• A. Linear search

• B. Binary search

• C. Depth-first search

• D. Breadth-first search

Which data structure is commonly used to implement binary search?

• A. Stack

• B. Queue

• C. Array

• D. Linked List

Which search algorithm is based on divide and conquer strategy?

• A. Linear search

• B. Binary search

• C. Depth-first search

• D. Breadth-first search

Which search algorithm is typically used for searching in unsorted data?

• A. Linear search

• B. Binary search

• C. Depth-first search

• D. Breadth-first search

In binary search, if the middle element is not equal to the target element, and the target element is greater how does the search proceed?

• A. Move left

• B. Move right

• C. Move to the middle of the left half

• D. Move to the middle of the right half

Which data structure is most suitable for implementing binary search?

• A. Array

• B. Linked List

• C. Stack

• D. Queue