REVERSE POLISH NOTATION automation =
PROGRAMMING PARADIGMS: also known as postfix form CLASS
CL-SS NAME -
-
implementing ab
→ procedural operands are listed first, followed by an operator models by creat
enforces the use of subroutines to + eliminates the need for brackets + public attributes executing algor
provide highly structured code + can be easily evaluated when values are stored on a stack - private attributes that solutions c
protected attributes arrived at
→ object oriented
composition
groups data and instructions together as ABSTRACT DATA TYPES + public method At decomposition
objects that interact with each other in a queues hash tables breaking apart
aggregation
inheritance
tightly controlled way stacks dictionaries problem into sm
graphs vectors simpler tasks, w
VECTORS: trees O
the combination
vector = a point in a coordinate system describing an area in space these solutions
can be represented as: provides the co
a list of numbers solution to the
functions that map domain values to co-domain values problem
HASH TABLES
geometric points in space each new string is hashed into a key value to
determine the appropriate index value to use to
store in an array ABSTRACTION TECHNIQUES
CONTEXT-FREE LANGUAGES collision = the detection that a duplicate hash information hiding = objects within the scop
where language cannot be represented SET NOTATION
value has been found that is already in use just by the characteristics that are necessa
by regular expressions, context-free A B when there is a collision, the table must be procedural abstraction = considering the ma
languages can be used to represent -
13 expanded to provide more hash values and all to a problem should do without considering
more complex relationships values must be rehashed functional abstraction = considers that valu
use recursive relationships to provide on recognising the way they do rather than
less limited representations data abstraction = ignoring the details of ho
A B new, more useful kinds of data objects to b
-
3
BACKUS-NAUR FORM
a notation used to describe
PAPER 1
context-free languages e.g. A B FINITE STATE MACH
phone ::= digit digit phone -
3 provide an abstracte
digit ::= 0 1 2 3 4 5 6 7 8 9 model of a system
outlining the states i
take and how it
transitions between
tractable= problems that have a polynomial or less time complexity
intractable = problems where the time complexity is greater than polynomial
REGULAR LANGUAGES
turing machine = a hypothetical machine that can a set of strings that can be expressed by regular expressions
execute a single fixed program, which can be a sequence of characters that describes how a set of data ABSTRACTION
summarised by a state transition diagram should be searched abstraction = hiding the detai
universal turing machine = a general machine that can can be represented by a FSM immediately important in help
simulate any turing machine, acts as an interpreter representational abstraction =
set = a mathematical object details that are not necessari
that describes a collection of abstraction by generalisation/
u other separate objects problem solver to spot similar
cardinality = a measure of how help employ a similar solution
-
many numbers are in a set
PROGRAMMING PARADIGMS: also known as postfix form CLASS
CL-SS NAME -
-
implementing ab
→ procedural operands are listed first, followed by an operator models by creat
enforces the use of subroutines to + eliminates the need for brackets + public attributes executing algor
provide highly structured code + can be easily evaluated when values are stored on a stack - private attributes that solutions c
protected attributes arrived at
→ object oriented
composition
groups data and instructions together as ABSTRACT DATA TYPES + public method At decomposition
objects that interact with each other in a queues hash tables breaking apart
aggregation
inheritance
tightly controlled way stacks dictionaries problem into sm
graphs vectors simpler tasks, w
VECTORS: trees O
the combination
vector = a point in a coordinate system describing an area in space these solutions
can be represented as: provides the co
a list of numbers solution to the
functions that map domain values to co-domain values problem
HASH TABLES
geometric points in space each new string is hashed into a key value to
determine the appropriate index value to use to
store in an array ABSTRACTION TECHNIQUES
CONTEXT-FREE LANGUAGES collision = the detection that a duplicate hash information hiding = objects within the scop
where language cannot be represented SET NOTATION
value has been found that is already in use just by the characteristics that are necessa
by regular expressions, context-free A B when there is a collision, the table must be procedural abstraction = considering the ma
languages can be used to represent -
13 expanded to provide more hash values and all to a problem should do without considering
more complex relationships values must be rehashed functional abstraction = considers that valu
use recursive relationships to provide on recognising the way they do rather than
less limited representations data abstraction = ignoring the details of ho
A B new, more useful kinds of data objects to b
-
3
BACKUS-NAUR FORM
a notation used to describe
PAPER 1
context-free languages e.g. A B FINITE STATE MACH
phone ::= digit digit phone -
3 provide an abstracte
digit ::= 0 1 2 3 4 5 6 7 8 9 model of a system
outlining the states i
take and how it
transitions between
tractable= problems that have a polynomial or less time complexity
intractable = problems where the time complexity is greater than polynomial
REGULAR LANGUAGES
turing machine = a hypothetical machine that can a set of strings that can be expressed by regular expressions
execute a single fixed program, which can be a sequence of characters that describes how a set of data ABSTRACTION
summarised by a state transition diagram should be searched abstraction = hiding the detai
universal turing machine = a general machine that can can be represented by a FSM immediately important in help
simulate any turing machine, acts as an interpreter representational abstraction =
set = a mathematical object details that are not necessari
that describes a collection of abstraction by generalisation/
u other separate objects problem solver to spot similar
cardinality = a measure of how help employ a similar solution
-
many numbers are in a set
