IBDP Computer Science: Abstract Data Structures

What is the primary characteristic of a stack data structure?

• First-In-First-Out (FIFO)
• Last-In-First-Out (LIFO)
• Random Access
• Hierarchical Storage

Which of the following is an advantage of using a queue?

• Easy to add data in the middle
• Ensures items are removed in the order they were entered
• Only the last item can be accessed
• Easier to program than stacks

Which of the following is a disadvantage of using a binary tree?

• Difficult to insert new data
• Over-complicated for unrelated data items
• Slow search times
• Fixed size during execution

What is an advantage of using an array?

• Dynamic size
• Easy to update any item

• Complex memory allocation
• Slow data access

Which data structure is best for holding data in an ordered manner and allows insertion and removal of items from any position?

• Stack
• Queue
• Linked List
• Binary Tree

What is a disadvantage of static data structures like arrays?

• Difficult to search for items
• Sequential access only

• Inefficient memory use
• Complex maintenance of pointers

What is the main use of a binary tree?

• Storing unrelated data items
• Maintaining sorted and related data items
• Implementing undo functionality
• Managing print queues

Which data structure is characterized by First-In-First-Out (FIFO) operations?

• Stack
• Queue
• Binary Tree
• Array

What is a disadvantage of using a stack?

• Cannot add data into the middle
• Inefficient memory use
• Difficult to program
• knowing the size in advance

What is an advantage of a linked list over an array?

• Fixed size
• Easy to update items
• Can insert and remove items from any position
• Direct access to any item