Please enable JavaScript.
Coggle requires JavaScript to display documents.
Computer Science - In Class Assessment - 2 - Coggle Diagram
Computer Science - In Class Assessment - 2
LMC Instructions
(Tracing / Reading)
ADD
Add
1xx
SUB
Subtract
2xx
STA
Store
3xx
LDA
Load
5xx
BRA
Unconditional branch
6xx
BRZ
Branch if zero
7xx
BRP
Branch if positive
8xx
INP
Input
901
OUT
Output
902
HLT
Halt
0
DAT
Data
Convert Recursive Function to Iterative
Logic Gate Circuits
Data Types
Integer
Character
String
Float
Boolean
Stacks and Queues
Stacks
LIFO (Last in First Out)
push(item)
- adds new item to the top of the stack
pop()
- removes item from the top of the stack
peek()
- returns the item at the top of the stack
isEmpty()
- checks to see whether the stack is empty
isFull()
- checks to see whether the stack is full
Overflow
- if something is trying to be added to the stack but it is full, it causes an overflow error
Underflow
- If you are trying to remove something from the stack when it is empty, it will cause an underflow error
Queues
FIFO - First in First Out
enQueue(item)
deQueue()
isEmpty()
isFull
Laws and Acts
The Data Protection Act (1998)
Data is accurate
Data is up to date
Data is safe and secure
Data is not used in ways to harm individuals
The Computer Misuse Act (1990)
An offence to access a computer without permission
An offence to chang eor modify a computer without permission
The Copyright Design and Patents Act (1988)
-To protect the work of creators form being illegally copied
Illegal to make copies of work
Illegal to make copies and then sell it
Illegal to use software on a network unless the licence allows it