Data Structures - Practice Questions


1.  (a) Define stack[1]

Last in first out dynamic data structure

(b) State two applications of stacks in computing. [2]

Storing return addresses when procedures are called

Storing the contents of variables during recursive calls

Storing the contents of the special purpose registers when processing interrupts

2.  Identify the components of a node in a doubly linked list. [3]

The data, next pointer, previous pointer

3.  Describe the characteristics of a queue. [2]

First in first out dynamic


No comments have yet been made