Data structure - A-level computer science

Does Breadth-first search of a graph use a queue or a stack?

• Stack

• Queue

• Both

• Neither

Does Depth-first search of a graph use a queue or a stack?

• Stack

• Queue

• Both

• Neither

Which of these data structures is FIFO? 

• Stack
• Queue
• Binary Tree
• Double linked list

What would 'leaving' a queue be called?

• Dequeue

• Enqueue

• Leave queue

• Bee anqueue

What would a dynamic data structure entail?

• Memory is allocated to the data structure as the program executes.

• Memory is allocated to the data structure at compile time.

• The size of the structure is fixed

• The data structure is fixed when the program is compiled.

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 address of the previous entry in the list

Which of the following is not an example of a linear data structure?

• array

• tree

• queue

• stack

What kind of Data structure would you expect to find utilised to store operations in a CPU?

• Stack
• Queue
• List
• Tree

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

• ABCD

• DCBA

• DCAB

• ABDC

A LIFO structure where the last item of data added is the first to leave.

• Stack

• LIFO

• Pointer

• Stack Frame