Data Structures - Lists

What is an Abstract Data Type (ADT)?

• A data structure that hides implementation details
• A type of variable in programming
• A method for sorting data
• A programming language feature

What does 'static' mean in relation to data structures?

• The size can change dynamically
• The data structure is temporary
• The size is fixed at compile time
• The data structure is always empty

In a dynamic list, what happens when an item is deleted?

• The item is permanently removed
• The item is moved to a static list
• The memory location is freed and returned to the heap
• The list automatically resizes

What is the purpose of the 'maxSize' variable in a queue implemented as a dynamic list?

• To track the current size of the queue
• To determine the maximum memory allocation
• To sort the items in the queue
• To limit the number of items in the queue

Which of the following is an example of a real-life application of lists?

• A list of pupils and their marks

• A single integer variable

• A function to calculate averages

• A static array of numbers

Which of the following statements about dynamic lists is true?

• They have a fixed size
• They can grow and shrink in size
• They cannot be implemented in C#
• They are always slower than static lists

What is the primary advantage of using an abstract data type?

• It is easier to implement
• It is faster than other data types
• It requires less memory
• It allows for better data hiding and abstraction

In the context of lists, what does 'abstraction' refer to?

• The process of removing data
• The sorting of data
• The hiding of implementation details
• The merging of lists

Which of the following operations is commonly performed on lists?

• Merging
• Encrypting
• Compiling
• Debugging

What is the role of pointers in a dynamic list?

• To store the data
• To sort the items
• To keep track of the order of items
• To allocate memory