Data Structures Quiz

What is a computer program defined as, according to the sources?

• A collection of hardware components and network protocols.

• A set of instructions and executable software that runs on a computer.

• A user interface for interacting with a database.

• A graphical design tool for web development.

Which of the following best describes what a data structure is?

• A set of programming languages used for complex computations.

• A system for managing computer memory allocations.

• A container that stores data, describing how data are arranged for access by an algorithm.

• A collection of mathematical equations for problem-solving.

What is the primary focus of an Abstract Data Type (ADT)?

• The specific implementation details of operations on data.

• The "what"s of the operations, rather than "how"s it works.

• Optimizing memory allocation for dynamic data.

• Creating visual representations of data hierarchies.

One key advantage of using Abstract Data Types (ADTs) is encapsulation. What does encapsulation achieve?

• Increases the complexity of data structure implementation.

• Protects the integrity of data by controlling access and preventing unauthorized modifications.

• Limits the flexibility of data structures.

• Adds significant overhead in terms of memory and processing.

Arrays, Stacks, Queues, and Linked Lists fall under which category of Abstract Data Types?

• Non-Linear.

• Complex.

• Derived.

• Linear.

A stack is primarily described by which data access principle?

• FIFO (First In First Out).

• LIFO (Last In First Out).

• FILO (First In Last Out).

• LILO (Last In Last Out).

When adding a new item to a stack, which operation is performed?

• Dequeue.

• Pop.

• Push.

• Retrieve.

Before performing a `push` operation on a stack, what condition should ideally be checked?

• If the stack is empty.

• If the stack is full.

• If the stack has at least one element.

• If the stack is a circular stack.

The analogy of a stack of plates placed on a table, where a guest takes a fresh plate from the top and new plates are placed on top, best illustrates the concept of a:

• Queue.

• Linked List.

• Tree.

• Stack.

In a stack implementation where an indicator `zero` means empty, and `one` means one data, what would the indicator `two` represent according to the lecture?

• No data items.

• One data item.

• Three data items.

• An error state.