Question 1

How would you define an abstract data type?

Accepted Answer

A data type that is not define within a programming language, but created by the programmer

Answer

A data type that the programmer does not understand fully

Answer

A type of data that is not clear to the user

Answer

A data type that is simplified to make it easier to understand

Question 2

What type of data structure is a Queue?

Accepted Answer

FIFO (First In First Out)

Answer

LILO (Last In Last Out)

Answer

LIFO (Last In First Out)

Answer

FILO (First In Last Out)

Question 3

What is the role of the rear pointer in a Queue?

Accepted Answer

It indicates where the last item currently stored in the queue is

Answer

It indicates where the list begins

Answer

It indicates where the last space in the queue is for storing new items

Answer

It indicates the lowest value in the queue

Question 4

What data structure is commonly used to impliement a Queue?

Accepted Answer

An array

Answer

A linked list

Answer

A dictionary

Answer

A 2D array

Question 5

What method would add an item to the rear of the Queue?

Accepted Answer

EnQueue

Answer

isEmpty()

Answer

isFull()

Answer

deQueue

Question 6

What method would remove an item from the start of a Queue?

Accepted Answer

deQueue

Answer

isEmpty()

Answer

isFull()

Answer

EnQueue

Question 7

What is the role of the isFull() method?

Accepted Answer

It checks if the queue is full

Answer

It removes an item from the list

Answer

It checks if the queue is empty

Answer

It adds an item to the list

Question 8

What would happen if you tried to add something to a queue that was already full?

Accepted Answer

The program would error

Answer

A new queue is created

Answer

The program would ask if you would like to delete something else

Answer

The array length is incrimented by 1

Question 9

What would happen if you tried to remove an item from an empty queue?

Accepted Answer

The program would error

Answer

The index position would move to -1

Answer

The front pointer and rear pointer would both be -1

Answer

Nothing, the program would just move to the next line of code

Question 10

Which of these scenarios would not benefit from the use of a queue?

Accepted Answer

The back button on an internet browser

Answer

A food ordering system

Answer

A printer system

Question 11

Data stored in a queue must be stored contiguosly in memory?

Accepted Answer

TRUE

Answer

FALSE

Question 12

Items will move up the queue as the front items are deleted?

Accepted Answer

FALSE

Answer

TRUE

Question 13

Linear queues impliemented using an array, are an exmaple of a ________ data structure?

Accepted Answer

Static

Answer

Dynamic

Question 14

Linear queues impliemented using a list, are an exmaple of a ________ data structure?

Accepted Answer

Dynamic

Answer

Static

Question 15

What is one disadvantage of a linear queue?

Accepted Answer

Once items leave the queue, those places in memory can not be re-used unless the queue is wiped or reset

Answer

It is a difficult data type to impliment

Answer

It can only be used to store small amounts of data

Answer

Once items leave the queue, they can not rejoin

Question 16

What is the role of the front pointer?

Accepted Answer

It indicates where the first item in the queue is being held

Answer

It indicates where the last space in the queue is for storing new items

Answer

It indicates the lowest value in the queue

Answer

It indicated where the start of the array or list is

Related quizzes

Related quizzes