DS Exam 1

You need to store 1000 student grades and frequently access any grade by student number. Which property makes arrays most efficient for this?

• No need to explain

• Direct access using index
• Sequential storage

• Same data type requirement

A program needs to insert names at various positions in a list of 10,000 names. Why would this be slow with an array?

• Arrays can't store strings
• Limited memory capacity
• Elements must shift to make space
• Array size is fixed

You're building a shopping cart that needs to grow as users add items and shrink as they remove them. What list property solves this?

• Indexed access
• Dynamic resizing
• Ordered elements
• Duplicate handling

An application needs a collection that sometimes has 10 items, sometimes 1000. Why is a fixed-size array problematic?

• Too slow for access
• Cannot determine size in advance
• Uses too much memory
• Cannot store varied data

You need to frequently check if a specific book exists in a library of 50,000 books. Which operation would you use repeatedly?

• Adding books
• Searching/checking existence
• Removing books
• Counting books

You're implementing an 'undo' feature for a drawing app. Each action is saved. Why does a stack make sense here?

• Fastest structure
• Most recent action needs to be undone first
• Saves memory
• Allows random access

You're stacking dinner plates. The last plate you put on top is the first one you'll use. This demonstrates which concept?

• Queue behavior
• Stack (LIFO) behavior
• Array indexing
• Tree hierarchy

A program tracks function calls. When a function finishes, control returns to the calling function. Which structure models this?

• Queue
• Stack
• Array
• List

Customers arrive at a ticket counter and are served in arrival order. Which structure models this fairness principle?

• Stack
• Queue
• Priority Queue
• Array

A print spooler processes documents in the order they were sent. What principle ensures the first document sent prints first?

• Last In First Out
• First In First Out
• Priority-based
• Random selection