Paper 1

Question 1

Recursion

Answer 1

Function that repeatedly calls itself until condition is met
3 essential characteristics:
- Stopping condition or Base Case
- Stopping condition must be met after a finite number of calls
- for all input value apart from the stopping condition the routine must call itself

Question 2

Call Stack structure

Answer 2

Identifier

Parameter
Local Variables
Return Address

Question 3

Abstract Data Types

Answer 3

Organising collection of data with particular features and access restrictions independent of any programming language

Question 4

Dynamic data structure

Answer 4

Has a fixed size

Question 5

Dynamic data structure

Answer 5

Can change size ( same size as number of values stored in it)

Question 6

Stack commands

Answer 6

Peek
Pop
Push
IsEmpty
IsFull

Question 7

Process

Answer 7

Instance of a program being ran

Each process allocated its own section of main memory by OS

Question 8

Static memory allocation

Answer 8

Value has fixed size of that can be allocate space before running

Question 9

Dynamic memory allocation

Answer 9

Some values are unknown about how much space is needed to store

Question 10

Heap

Answer 10

Pool of unallocated memory ready to store data for objects
Data allocated dynamically and grows and shrinks in size as program runs and objects are created or unallocated

Question 11

How to detect an empty queue ?

Answer 11

rearPointer = frontPointer = -1

Question 12

Detect full queue ?

Answer 12

RearPointer = maxSize - 1

Question 13

Priority Queue

Answer 13

Some items jump queue due to their importance