Understanding Data Structures: Stack, Heap, and Queue

What analogy is used to describe how a stack operates?

• A stack of books

• A line of people

• A pile of dishes

• A box of chocolates

What happens when a stack overflows?

• It slows down the data retrieval process

• It automatically deletes the oldest data

• It starts using heap memory

• It causes the application to crash

What is a stack trace used for?

• To measure the performance of an application

• To identify unused variables

• To track the source of an error

• To optimize memory usage

How does a heap differ from a stack in terms of data storage?

• A heap allows for faster data retrieval

• A heap uses a first-in-first-out (FIFO) approach

• Data in a heap is organized based on priority

• A heap stores data in a less structured manner

What is the primary role of a garbage collector in programming languages?

• To collect unused memory addresses

• To manage the queue of asynchronous tasks

• To clean up data that is no longer in use

• To optimize the stack memory usage

What is the main advantage of using a heap over a stack?

• Simpler implementation

• Faster data retrieval

• More structured data storage

• Greater flexibility and power

What principle does a queue operate on?

• First in, last out (FILO)

• Last in, first out (LIFO)

• First in, first out (FIFO)

• Last in, last out (LILO)

How is asynchronous programming typically implemented in JavaScript?

• Using a queue

• Using a heap

• Using a garbage collector

• Using a stack

What is the initial index of an item in an array?

• It does not have an index

• -1

• 0

• 1

How is data stored in a linked list?

• In a fixed memory block

• Directly next to each other

• Sequentially in memory

• In random memory locations with pointers