Quelpr
3 marksAbstract Data Types (ADTs)

CAPE Computer Science Unit 2 · 2011 · Paper 2 · Question 1(a)(ii)

Data structures concepts and implementations.

Explain how a stack ADT is implemented.

The mark scheme is shown once you've answered.

Practise this question

Other parts of this question

  1. 1(a)(i)Define the term 'Abstract Data Type' (ADT).[2 marks]
  2. 1(b)Write an algorithm to remove an element that is at the bottom of a stack, maintaining the relative positions of the remaining elements. (An appropriate…[8 marks]
  3. 1(c)Given the circular queue shown in the diagram, draw a diagram illustrating the queue after inserting letters L and Y, removing three letters, and then…[7 marks]
  4. 1(d)Describe how an array of n items is sorted using a bubble sort algorithm.[5 marks]

More practice: the rest of this paper · more Abstract Data Types (ADTs) questions · all CAPE Computer Science Unit 2 past papers