AQA AS Computing Unit 1

Notes i made/put together myself during my lessons hopefully its useful.

HideShow resource information
  • Created by: Mercy
  • Created on: 17-04-13 22:29
Preview of AQA AS Computing Unit 1

First 221 words of the document:

Chapter 1
1.1 Principle of computation
Aims:
· What computing is?
· The meaning of computation and computability;
· The difference between algorithms and programs;
· The two main principles of computation: abstraction and automation
Key Terms
Computing: The study of the natural and artificial information process
Computability: Measures what can and cannot be computed
Computation: The act or process of calculating or determining something by mathematical,
logical or interactive methods
Artificial Intelligence: A branch of computing that studies the use of computer to perform
computational processes normally associated with the human intellect
Algorithm: A description, independent of ant programming language, of a process that
achieves some task. It is a rep-by-step procedure for solving a problem
Deterministically: without guessing a solution before confirming it
Program: A description in a programming language of a process that achieves some useful
results
Notes
Computing is also a study of how to compute. This means a study of the process of
computation
How we do things
How we specify what we do
How we specify what we're processing
Questions
1. What is meant by computation?
The act or process of calculating or determining something by mathematical,
logical or interactive methods.

Other pages in this set

Page 2

Preview of page 2

Here's a taster:

What did Professor Dijkstra say about computing?
"Computing is no more about computers than astronomy is about telescopes"
3. What is meant by computability?
Measures what can and cannot be computed
4. What is computing?
The study of the natural and artificial information process
5. What is artificial intelligence?
A branch of computing that studies the use of computer to perform
computational processes normally associated with the human intellect
6.…read more

Page 3

Preview of page 3

Here's a taster:

Aims:
the importance of understanding a problem;
What constitutes a well-define problem;
Identifying the constraints or boundaries of a problem;
How to plan a solution to a problem;
What are Problem-solving strategies, including top-down design and
stepwise refinement;
The importance of checking your solution.…read more

Page 4

Preview of page 4

Here's a taster:

Establishing the limits or rules about what can and cannot be done when solving a problem.
These limits are a type of constraint
5. Why is lateral thinking useful in problem solving?
Use to challenge assumptions, establish facts and rules and define the boundaries of
problem solving
6.…read more

Page 5

Preview of page 5

Here's a taster:

To be able to explain what finite state machines are;
To be able to draw state transition diagrams for simple systems with and
without output ­ some of you may be able to do that for a bit more complex
system;
To be able to create state transition tables for FSM;
To be able to create decision table to model logics
Key Terms
Finite state machine: A machine that consists of a fixed set of possible states with a set
of allowable inputs that change…read more

Page 6

Preview of page 6

Here's a taster:

A finite state machine may or may not have outputs. It is easiest to start by
explaining those without outputs.
The terms finite state machines and finite state automata are synonymous.
State transition diagrams
This is a way of showing a finite state machine graphically.…read more

Page 7

Preview of page 7

Here's a taster:

Output Fail Fail Fail Fail Fail
`Fail'
1.4 Algorithm Design
Key Terms
Algorithm: A description, independent of and programming language, of a process that
achieves some task. It is a step-by-step procedure for solving a problem
Program: A description in a programming language of a process that achieves some useful
results
Sequence: Consecutive steps or group of steps processed one after another in the order
that they arise.…read more

Page 8

Preview of page 8

Here's a taster:

Flowchart Symbols…read more

Page 9

Preview of page 9

Here's a taster:

Starter Activity
If Number A > Number B Then
A=A
A= Largest number
OR
If Number B > Number A Then
B= A
B = Largest number
Then
Questions
1. What is an algorithm?
2. What is a program?
3. Why must computation algorithms be turned into computer programs?
4. Name three constructs that may be used to construct any algorithm. Explain each
constructs
5. Use stepwise refinement to develop and algorithm for fixing a puncture in the front wheel
of a bicycle
6.…read more

Page 10

Preview of page 10

Here's a taster:

Chapter 2
2.1 Input, assignment and output
You need to know what the following statements do
1) Console.Writeline("...") / Console.Write("...")
2) Console.Readline() / Console.Read()
3) dim xyz as integer
You need to know what
1) Assignments
2) Identifiers and
3) Data types are.
Aims
I. How to write the code to calculate the result of a formula;
II. How to write the code to read input from the keyboard and produce output to the
screen;
III. The importance of the sequence of instructions
Notes
I.…read more

Comments

Dhilan

It won't let me open it

James

Page 2, question 2 seems relevant.

Imrose Khilji

Thank you for this, but page two does seem a bit irreverent.

Apart from that, this is useful 

maxyboi

hello

maxyboi

its me max

maxyboi

#bantz

Similar Computing resources:

See all Computing resources »See all resources »