Data Structures and Algorithms Quiz

What is an Abstract Data Type (ADT)?

• A specific implementation of a data structure

• A mathematical model for data types, specifying operations but not implementation

• Any user-defined type in programming

• A physical device used for storing data

Which of the following best describes an ADT?

• Defines only data storage

• Describes both data and allowed operations without implementation

• Specifies physical storage

• Specifies algorithm efficiency

Which is NOT a feature of an ADT?

• Data representation is hidden

• Specifies operation set

• Specifies hardware for storage

• Defines type's behavior

Which operation is essential for stack ADT?

• dequeue

• insert at start

• push

• find min

In an algorithm, which property ensures it eventually completes?

• Finiteness

• Input

• Output

• Definiteness

Which term describes the rules to perform tasks in an algorithm?

• Abstraction

• Instruction

• Step

• Procedure

Which of the following is a property of a good algorithm?

• Ambiguous steps

• High time complexity

• Finiteness

• Infinite loops

Algorithm analysis deals primarily with:

• Code syntax

• Correctness and efficiency

• Code documentation

• Data input methods

Time complexity measures:

• Disk space used

• Maximum number of steps for a given input

• Amount of output

• Code length

Space complexity measures:

• Running time

• Storage required

• Speed of processor

• Number of operators in code