2.1 Data Structures and Abstract Data Types

Question 1

What is a Queue ?

Answer 1

An abstract data struture based on a queue.

Question 2

What is the acronym for a Queue’s structure ?

Answer 2

FIFO (First In First Out)

Question 3

How many pointers does a linear queue have ?

Answer 3

2 (Front, Rear)

Question 4

What are the characterisitcs of the pointers of a Circular Queue ?

Answer 4

Front and Rear Pointers can move over the two ends pf the queue.

Question 5

What happens to items in a Priority Queue ?

Answer 5

Items are assigned a priority and dequeued based on priority.

Question 6

What are the main 4 operations for a Queue?

Answer 6

EnQueue, DeQueue, isFull, isEmpty

Question 7

What are the characteristics of Static Data Structures ?

Answer 7

Fixed in Size

Question 8

What are the characteristics of Dynamic Data Structures ?

Answer 8

Variable in Size
Allocates and Deallocates memory from the heap

Question 9

What are the advantages / disadvantages of a Queue ?

Answer 9

• Predictable Memory Usage
• Fixed Length
• Can’t resuse spaces

Question 10

What are the advantages / disadvantages of a Circular Queue ?

Answer 10

• Can reuse spaces

-More complex to program

Question 11

What are the advantages / disadvantages of a Priority Queue ?

Answer 11

• Gives preference to more important items.
• Extra processing required to keep order