Flashcards
Computing A-Level Chapter 8
Cards in this deck (14)
- 1Stacka LIFO structure where the last item of data added is the first to leave
- 2LIFOlist in first out refers to a data structure such as a stack where the last item of data entered is the first to leave
- 3Pointera data item that identifies a particular element in a data structure - normally front or rear
- 4Stack Framea collection of data about a subroutine call
- 5Call Stacka special type of stack used to store information about active subroutines and functions within a program
- 6Interrupta signal sent by a device or program to the processor requesting its attention
- 7Nestingthe process of putting one statement inside another statement
- 8Recursionthe process of a subroutine calling itself
- 9Queuea FIFO structure where data leaves in the order it arrives
- 10FIFOfirst in first out refers to a data structure such as a queue where the first item of data entered is the first item of data to leave
- 11Linear Queuea FIFO structure organised as a line of data such as a list
- 12Circular Queuea FIFO dat structure implemented as a ring where the front and rear pointers can wrap around from the end of the start of the array
- 13Priority Queuea variation of a FIFO structure where some data may leave out of sequence
- 14—
Information
- Description
- A level Computing Flashcards on Computing A-Level Chapter 8, created by Sam Carvell on 18/05/2018.
- Created by
- Sam Carvell
- Views
- 2
- Rating