J277 Paper 2 Computational Thinking, Programming and Algorithms

What is an Algorithm?

• A set of instructions.

• A Diagram.

• A list of things to do.

Tags

2.1 Algorithms

What does the process of Abstraction do?

• Remove information.

• Ignore unimportant details.

• Highlight important information.

• Ignore unimportant details and highlight important ones.

Tags

2.1 Algorithms

Decomposition is the process in which you?

• Break a large task down into smaller sections.

• Solve easy parts of a problem.

• Look for patterns in the problem.

• Ignore unimportant details and highlight important ones.

Tags

2.1 Algorithms

Which of the following are Searching Algorithms?

• Binary and Linear

• Merge and Bubble

• Linear and Insertion

• Insertion and Merge

Tags

2.1 Algorithms

Which of these are Sorting Algorithms?

• Bubble, Linear and Insertion

• Bubble, Insertion and Merge

• Binary, Insertion and Merge

• Binary, Linear and Merge

Tags

2.1 Algorithms

Which of these are advantages of a Binary search algorithm?

• It is more suitable for large lists.

• It is more efficient as its takes less average steps.

• Suitable for small lists.

• Works on un-ordered lists.

Tags

2.1 Algorithms

Which of these are advantages of a Linear searching algorithm?

• It is more suitable for large lists.

• It is more efficient as its takes less average steps.

• Suitable for small lists.

• Works on un-ordered lists.

Tags

2.1 Algorithms

Which of these are advantages of Insertion sorting algorithms?

• Is very efficient on small lists.

• Can work on live data.

• Works very efficiently on large lists.

• Uses large amounts of memory.

Which of these are characteristics of a Merge sort?

• Is very efficient on small lists.

• Can work on live data.

• Works very efficiently on large lists.

• Uses large amounts of memory.

Which of the images is Pseudocode?

• A

• B

Tags

2.1 Algorithms