Pages in this set

Page 1

Preview of page 1
Chapter 1
1.1 Principle of computation


· 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…

Page 2

Preview of page 2
2. 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?…

Page 3

Preview of page 3

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.

Key terms

Given: an initial situation…

Page 4

Preview of page 4
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. State five…

Page 5

Preview of page 5
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
To be able to create state transition tables for…

Page 6

Preview of page 6
· 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. These symbols are used…

Page 7

Preview of page 7
Output 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…

Page 8

Preview of page 8
Flowchart Symbols

Page 9

Preview of page 9
Starter Activity

If Number A > Number B Then


A= Largest number


If Number B > Number A Then

B= A

B = Largest number



1. What is an algorithm?

2. What is a program?

3. Why must computation algorithms be turned into computer programs?


Page 10

Preview of page 10
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.


I. How to write the code…




It won't let me open it



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 






its me max




Similar Computing resources:

See all Computing resources »