AlgoQuizz#2-Prelim

Which of the following statements is TRUE about data structures?

• A data structure is a type of variable that can only hold a specific type of data, like int or float.

• Data structures do not store data; they only define the type of data that can be stored.

• A data structure can hold multiple types of data within a single object and has time complexity considerations.

• Data structures are abstract implementations like int, float, and double.

What is the key difference between a data type and a data structure?

• Data types can store different kinds of data, while data structures can only store one type of data.

• Data types represent the type of data that can be stored, while data structures store and organize multiple types of data.

• Data types have time complexity, while data structures do not.

• Data structures cannot be used to store data, whereas data types can.

Which of the following is an example of a data structure?

• String

• float

• Array

• double

In terms of memory usage, how do data types and data structures differ?

• Data types do not take up memory space for storing values, while data structures allocate memory for storing data.

• Both data types and data structures take up the same amount of memory.

• Data types allocate more memory than data structures.

• Data types store actual data values in memory, while data structures only define data types.

Which of the following is an example of a linear data structure?

• Tree

• Graph

• Linked List

• Hash Table

What is a key characteristic of a static data structure?

• Its size can change dynamically during runtime.

• Its elements are arranged non-linearly.

• It has a fixed memory size.

• It is more complex in terms of memory management than a dynamic data structure.

What is a major advantage of using a dynamic data structure over a static data structure?

• Fixed memory size

• Efficient memory usage as it can adjust size during runtime

• Simple implementation with fixed memory allocation

• Elements are easier to access sequentially

Which of the following data structures can change its size during runtime?

• Array

• Stack

• Queue

• Both Stack and Queue

Which of the following is NOT a reason for using data structures?

• They make data modification easy.

• They increase the amount of storage space required.

• They save storage memory space.

• They make data representation easy.

Which data structure allows elements to be removed from the front and inserted at the rear?

• Array

• Stack

• Queue

• Graph