Section 7 - Data Structures Flashcards

1
Q

What’s an abstract data type

A

A logical description of how data is viewed and the operations that can be performed on it.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is a queue

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

what are queues used for

A

Examples include:

output waiting to be printed,
characters typed on a keyboard are held in a keyboard buffer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Describe the creation and maintenance of a queue.

A

enQueue() - adds to the end of the queue
deQueue() - remove from the front and return it
isEmpty() - check if queue is empty
isFull() - check if queue is full

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Describe how to do the following to a linear, circular, and priority queue:

  • add an item
  • remove an item
  • test for an empty queue
  • test for a full queue
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly