Data Structures

What is the purpose of a data structure?

• To organize data efficiently
• To implement an ADT
• To provide reusability
• To provide abstraction

What does ADT stand for?

• Abstract Data Type
• Advanced Data Technique
• Array Data Type
• Application Development Tool

Which data structures can be used to implement a stack ADT?

• Arrays and linked lists
• Arrays and trees
• Linked lists and queues
• Queues and trees

What does a data structure care about?

• How to implement an ADT
• What is to be done
• Efficiency in terms of time
• Efficiency in terms of space

How do we choose which data structure to use for a particular ADT?

• By comparing time and space efficiency
• By selecting the most popular one
• By using the one with the most features
• By random selection

What advantage does a proper choice of data structure provide?

• Efficiency in terms of space and time
• Flexibility in implementation
• Ease of use for the programmer
• Compatibility with different programming languages

What is the advantage of reusability provided by data structures?

• One implementation can be used by multiple client programs
• Data can be easily modified and updated
• Data can be accessed from anywhere
• Data can be securely stored

What does an ADT provide?

• A blueprint for the data structure
• The actual implementation of the data structure
• A set of predefined functions
• A graphical representation of the data structure

What does a data structure provide?

• The implementation of the ADT
• The interface for the client program
• The data storage for the program
• The user interface for the program

What does a data structure provide in terms of abstraction?

• A level of abstraction
• Complete abstraction from the client program
• No abstraction at all
• Partial abstraction from the client program