9618 AS &A LEVEL COMPUTER SCIENCE: STACK_QUEUE_LINKED LIST

A stack overflow is an undesirable condition in which a particular computer program tries to use more memory space than the called stack has available.

• True
• False

What would 'leaving' a queue be called?

• "Dequeue"
• "Enqueue"
• "Leave queue"
• "Delete 'system 32' folder"

For a linked list, what meta-data will need to be stored with each data entry?

• The Name of the list
• The address of the current data entry
• The address of the next data entry in the list
• The meaning of life

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

What advantage does a linked list have over an array?

• Size of the list doesn't need to be mentioned at the beginning of the program

• You can add or remove elements from the middle of the list.

• The linked list doesn't have a size limit

• All of these are true.

The situation when in a linked list Head==NULL

is

• Empty

• Full

• impossible

• out of range

In the above image what will be printed when

Head->next->data?

What is value in the head -> next -> next below?

• 1600

• 88

• 12

• 4600

How many null pointers exists in a circular linked list?

• 0

• 1

• 2

• 3

In linked list implementation of a queue, the important condition for a queue to be empty is?

• FRONT is null

• REAR is null

• LINK is empty

• None of the mentioned