Data Structures and Algorithms Quiz

Which of the following best describes a data structure?

• A programming language feature

• A type of software application

• A specialized format for organizing and storing data

• A method for executing algorithms

What distinguishes linear data structures from non-linear data structures?

• Non-linear structures are always arrays.

• Linear structures arrange data elements sequentially.

• Non-linear structures cannot be traversed.

• Linear structures are more complex.

What is a characteristic of primitive data structures?

• They can only store complex data.

• They are built using other data types.

• They always require additional memory allocation.

• They are directly supported by the programming language.

In a linked list, what does each node contain?

Which of the following is an example of a non-primitive data structure?

• Integer

• Array

• Boolean

• Character

Which of the following best describes non-linear data structures?

• They do not arrange data elements in a sequential manner.

• They are always more complex than linear structures.

• They can only store numerical data.

• They arrange data elements sequentially.

In the context of data structures, what is a tree?

What is an algorithm?

Which of the following is a characteristic of algorithms?

• They can have infinite steps.

• They are only applicable to sorting tasks.

• They must have a defined input and output.

• They must be written in a specific programming language.

Which algorithm design paradigm divides a problem into smaller subproblems?

• Brute force

• Dynamic programming

• Divide and conquer

• Greedy algorithms