AQA COMP3 - Key Notes

An eight page document with information on every point in the AQA COMP 3 (COMP3) specification.

Includes notes on: Turing Machines, BigO Notation, Programming Paradigms, Stacks & Queues, Graphs and Trees and their transveral methods, Sorting, Floating Point Numbers, Operating Systems, Database and Normalising (to 3NF), Communication and Networking and more.

All the information is completed to what I have learnt, there might be the odd error. Some images are from notes and wikipedia.

If you want the original word document instead of the PDF just message me.

----

Change: 13/06/2014 Order of Compexity Table, Thanks freddie_barbour

HideShow resource information
  • Created by: Charlie
  • Created on: 09-05-14 20:33
PDF Document 861.83 Kb

Pages in this set

Page 1

Preview of page 1

Page 2

Preview of page 2
A2 COMPUTING ­ COMP3 - KEY POINTS
SECTION 1: PROBLEM SOLVING
Finite State Machines A state transition diagram is where the nodes represent states and
the transition is labelled "a|b" where the b part denotes an output and the represent input. A transition table tabulates
the states and next states…

Page 3

Preview of page 3
time O(na).
P means the problem can be solved in a polynomial time using a Turing machine.
NP-Complete: Every problem in NP can be reduced to X. NP-Hard: Non-Deterministic Polynomial Time shows a
problem is not solvable in a realistic time.

Page 4

Preview of page 4

Page 5

Preview of page 5
Syntax Diagrams Similar to BNF, The language can be represented in a diagram. Structure of
a Syntax Diagram
Symbol Meaning Oval Direct meaning using the text in the shape Rectangle Relation to a named meta-component
Arrow Direction of the path thought entities
SECTION 2: PROGRAMMING CONCEPTS
Regular Expressions Regular Expressions…

Page 6

Preview of page 6
Reverse Polish Notation Known as Post-Fix Notation. Allows expressions to be written without brackets
by adding the operation at the end of the op-ands. It uses a stack which is Last-In-First-Out Operations. When a
symbol is read then it gets pushed on the stack. When an operator is read then…

Page 7

Preview of page 7

Page 8

Preview of page 8
Recursion Recursion is where a procedure calls itself. Usually a recursive function
has a parameter in which changes on each call.
The recursive routine uses a stack (LIFO) to store information. The last element to be added to the stack
is the first element to be pulled off the stack.…

Comments

freddie barbour

Report

Really useful and to the point. First computing revision notes that I've seen where the author understands that 63 PAGES OF TEXT is not a REVISION GUIDE. From what I can see it covers (almost) everything one actually needs to know, without all the useless filler ****. Bravo sir!

EDIT: Just found an error, in Big-O complexity table, logarithmic is more efficient than linear.

Sandeep

Report

I think you meant to write traversal rather than transversal XD

Jamiie

Report

Quite a few errors but best material I've found yet!

Charlie

Report

@Jamiie 

Thanks for your feedback, If you notice any errors do let me know (PM or as a Comment) - I don't mind updating this resource even tho I'm done with COMP3.

Good luck in your exams.

2540796

Report

Have all the errors been corrected? :)

N_J_R

Report

My saviour

Similar Computing resources:

See all Computing resources »

AQA COMP3 - Key Notes

An eight page document with information on every point in the AQA COMP 3 (COMP3) specification.

Includes notes on: Turing Machines, BigO Notation, Programming Paradigms, Stacks & Queues, Graphs and Trees and their transveral methods, Sorting, Floating Point Numbers, Operating Systems, Database and Normalising (to 3NF), Communication and Networking and more.

All the information is completed to what I have learnt, there might be the odd error. Some images are from notes and wikipedia.

If you want the original word document instead of the PDF just message me.

----

Change: 13/06/2014 Order of Compexity Table, Thanks freddie_barbour

  • Created by: Charlie
  • Created on: 09-05-14 20:33
PDF Document 861.83 Kb

Pages in this set

Page 1

Preview of page 1

Page 2

Preview of page 2
A2 COMPUTING ­ COMP3 - KEY POINTS
SECTION 1: PROBLEM SOLVING
Finite State Machines A state transition diagram is where the nodes represent states and
the transition is labelled "a|b" where the b part denotes an output and the represent input. A transition table tabulates
the states and next states…

Page 3

Preview of page 3
time O(na).
P means the problem can be solved in a polynomial time using a Turing machine.
NP-Complete: Every problem in NP can be reduced to X. NP-Hard: Non-Deterministic Polynomial Time shows a
problem is not solvable in a realistic time.

Page 4

Preview of page 4

Page 5

Preview of page 5
Syntax Diagrams Similar to BNF, The language can be represented in a diagram. Structure of
a Syntax Diagram
Symbol Meaning Oval Direct meaning using the text in the shape Rectangle Relation to a named meta-component
Arrow Direction of the path thought entities
SECTION 2: PROGRAMMING CONCEPTS
Regular Expressions Regular Expressions…

Page 6

Preview of page 6
Reverse Polish Notation Known as Post-Fix Notation. Allows expressions to be written without brackets
by adding the operation at the end of the op-ands. It uses a stack which is Last-In-First-Out Operations. When a
symbol is read then it gets pushed on the stack. When an operator is read then…

Page 7

Preview of page 7

Page 8

Preview of page 8
Recursion Recursion is where a procedure calls itself. Usually a recursive function
has a parameter in which changes on each call.
The recursive routine uses a stack (LIFO) to store information. The last element to be added to the stack
is the first element to be pulled off the stack.…

Comments

freddie barbour

Report

Really useful and to the point. First computing revision notes that I've seen where the author understands that 63 PAGES OF TEXT is not a REVISION GUIDE. From what I can see it covers (almost) everything one actually needs to know, without all the useless filler ****. Bravo sir!

EDIT: Just found an error, in Big-O complexity table, logarithmic is more efficient than linear.

Sandeep

Report

I think you meant to write traversal rather than transversal XD

Jamiie

Report

Quite a few errors but best material I've found yet!

Charlie

Report

@Jamiie 

Thanks for your feedback, If you notice any errors do let me know (PM or as a Comment) - I don't mind updating this resource even tho I'm done with COMP3.

Good luck in your exams.

2540796

Report

Have all the errors been corrected? :)

N_J_R

Report

My saviour