Queues - Data Structures H446 Computer Science

What is the main characteristic of a queue?

• Last in, last out

• Last in, first out

• First in, first out

• First in, last out

What is the main characteristic of a priority queue?

• Last in, last out

• Last in, first out

• First in, first out

• First in, last out

What operation adds an element to the queue?

• enqueue(data)

• dequeue()

• is_empty()

• is_full()

What operation returns an element from the front of the queue?

• is_full()

• is_empty()

• dequeue()

• enqueue(data)

What is the main difference between a linear queue and a circular queue?

• Linear queue has a fixed capacity, circular queue reuses empty slots

• Linear queue is for priority elements, circular queue is for regular elements

• Linear queue is faster, circular queue is slower

• Linear queue uses arrays, circular queue uses linked lists

What is the purpose of a circular queue?

• To reuse empty slots at the front of the array

• To store elements in a linear sequence

• To prioritize elements based on their value

• To provide a faster alternative to a linear queue

What is the main advantage of a circular queue over a linear queue?

• No need for arrays

• Faster performance

• Easier implementation

• No need for pointers

What is the purpose of a linked list implementation of a priority queue?

• To store elements in a linear sequence

• To prioritize elements based on their value

• To provide a faster alternative to a circular queue

• To reuse empty slots at the front of the array

What is the main operation of a priority queue?

• enqueue(data)

• is_empty()

• dequeue()

• is_full()

What is the purpose of maintaining a pointer to the front and rear of the queue?

• To prevent elements from being removed

• To provide faster access to the elements

• To keep track of the number of elements in the queue

• To maintain the order of the queue