Search this site
Embedded Files
Skip to main content
Skip to navigation
Mrcoopercomputing - AS/A2 COMPUTER SCIENCE
AS/AQ HQ
FOCUS AREAS
REVISION RESOURCES
PROGRAMMING CHALLENGES
PART 1
1.1 Info representation
1.1.1 NUMBER SYSTEMS
1.1.2 - INTERNAL CODING NUMBERS
NEGATIVE INTEGER
DENARY - BINARY
DENARY - HEXADECIMAL
BINARY CODED DECIMAL
1.1.3 INTERNAL CODING TEXT
1.1.4 IMAGES
1.1.5 SOUND
1.1.6 VIDEO
1.1.7 COMPRESSION
1.2 Communication
1.3 HARDWARE
1.4 LOGIC
1.5 CPU
1.6 - ASSEMBLY LANGUAGE
1.7 System software
1.8 data security; privacy; integrity
1.9 ethics and owmnsership
1.10 Databases
1.8.2 RDB modelling
NORMALISATION
NORMALISATION
PART 2
ACTIVITY BOOKLET
11 - ALGORITHMS AND PROBLEM SOLVING
11.01 ALGORITHMS
11.05 LOGIC STATEMENTS
11.07 ARRAYS
12 STEPWISE&STRUCTURE
12.01 STEPWISE REFINEMENT
12.02 MODULES
12.03 STRUCTURE CHARTS
12.04 pseudo-structure
13 - PROGRAMMING & DATA
13.01 LANGUAGES
13.02 BASICS
13.03 data types
13.04 BOOLEAN EXPRESSIONS
13.05 SELECTION
13.06 ITERATION
13.07 ARRAYS
13.08 BUILT-IN FUNCTIONS
13.09 TEXTFILES
14 STRUTURED PROGRAMMING
14.01 TERMINOLOGY
14.02 PROCEDURES
14.03 FUNCTION
15 SOFTWARE DEVELOPMENT
15.01 LIFECYCLE
15.02 IDE FEATURES
15.03 TESTING STRATEGIES
15.06 MAINTENANCE
PART 3
3.1 Data representation
3.1.1 User-defi ned data types
3.1.2 File organisation and access
3.1.3 Real numbers and normalised fl oating-point representation
3.2 Communication and Internet technologies
17.01 ISOLATED NETWORK TOPOLOGY
17.02 COMMUNICATION CONCEPTS
17.03 NETWORK DEVICES
17.04 TCPIP
17.05 APPLICATION LAYER PROTOCOLS
17.06 ETHERNET
17.07 PEER TO PEER
17.08 WIRELESS NETWORKS
3.2.1 Protocols
3.2.2 Circuit switching, packet switching and routers
3.2.3 Local Area Networks (LAN)
3.3 Hardware
3.3.1 Logic gates and circuit design
ADDERS
3.3.2 Boolean algebra
18.01 BASICS
3.3.3 Karnaugh Maps
3.3.4 Flip-fl ops
3.3.5 RISC processors
3.3.6 Parallel processing
3.4 System software
3.4.1 Purposes of an operating system (OS)
3.4.2 Virtual machine
3.4.3 Translation software
RPN + BNF
3.5 Security
3.5.1 Asymmetric keys and encryption methods
3.5.2 Digital signatures and digital certifi cates
3.5.3 Encryption protocols
3.5.4 Malware
3.6 Monitoring and control systems
3.6.1 Overview of monitoring and control systems
3.6.2 Bit manipulation to monitor and control devices
PART 4
4.1 Computational thinking and problem-solving
4.1.1 Abstraction
4.1.2 ALGORITHMS
LINEAR SEARCH
BUBBLE SORT
INSERTION SORT
BINARY SEARCH
STACKS
QUEUES
LINKED LIST
BINARY TREE
HASH TABLE
DICTIONARIES
4.1.3 Abstract Data Types (ADT)
4.1.4 Recursion
4.2 Algorithm design methods
4.2.1 Decision tables
4.2.2 Jackson Structured Programming (JSP)
4.2.3 State-transition diagrams
4.3 Further programming
4.3.1 Programming paradigms
4.3.1b Low level programming
4.3.1c OOP
4.3.1 d Declarative programming
4.3.2 File processing
4.3.3 Exception handling
4.3.4 Use of development tools / programming environments
4.4 Software development
4.4.1 Stages of software development
4.4.2 Testing
4.4.3 Project management
Mrcoopercomputing - AS/A2 COMPUTER SCIENCE
3.4.3 Translation software
Basic understanding/facts about FRONT-BACK END analysis...
Compiler has a front end analysis part and a back end synthesis part
Interpreted languages have the front end part but not the back end part
Front end Analysis is broken down into LEXICAL/SYNTAX/SEMANTICS part
Lexical analysis the code is tokenisation and the identifiers are recorded in the symbol table
Result of parsing (syntax analysis) are recorded in syntax or parse tree
Grammar of a language can be recorded in syntax diagram or baccus-Naur form
Product of the analysis stage is intermediate code
Backend synthesis part is compilation - evaluation of expressions is done using conversion s to RPN
OPTIMISATION might take place as part of the synthesis
STACK can be used in converting an INFIX expression to a RPN expression and can also be used in EVALUATING an RPN expression
Google Sites
Report abuse
Google Sites
Report abuse