Duplicate of GCSE OCR CS 2.1 Algorithms (1/2)

Question 1

If you did a linear search on the above list How many comparisons to find the number 1? (6-9)

Accepted Answer

4

Question 2

what type of code is this?

Accepted Answer

psuedocode

Question 3

What is the first action in an insertion sort? (4-5)

Accepted Answer

Mark the first item as the ordered list

Question 4

Define the term computational thinking (1-2)

Accepted Answer

Developing an algorithm to solve a problem

Question 5

Identify the search performed by the above algorithm (9)

Accepted Answer

Linear

Question 6

Which sorting algorithm splits a list of items into individual lists? (1-2)

Accepted Answer

Merge

Question 7

Identify which statement describes algorithmic thinking (1-2)

Accepted Answer

Identifying the steps involved in solving a problem

Question 8

what shape represents a decision in a flow chart?

Accepted Answer

a diamond

Question 9

what happens if coding is incorrect?

Accepted Answer

you will get a syntax error

Question 10

What sort is this? Go through a list, swap items in the wrong order, repeatedly. (1-2)

Accepted Answer

Bubble

Question 11

If you did a binary search on the above list. How many comparisons to find 9? (4-5)

Accepted Answer

0-1

Question 12

Which of the following is not a component of computational thinking? (1-2)

Accepted Answer

Typing

Question 13

what is psuedocode used for?

Accepted Answer

to plan an algorithm using plain english

Question 14

Which sort is this? split a list into individual lists, combine these two lists at a time (1-2)

Accepted Answer

Merge

Question 15

Define the term abstraction within computational thinking (4-5)

Accepted Answer

Representing real problems in a computer program

Question 16

Identify the search algorithms (1-2)

Accepted Answer

Binary search

Question 17

what is an algorithm?

Accepted Answer

instructions set to reach a goal

Question 18

This list will be bubble sorted. What will the list look like after the first iteration? (9)

Accepted Answer

6 8 1 3 12

Question 19

what type of algorithm is this?

Accepted Answer

bubble sort

Question 20

what is the process called that breaks down a hard to answer problem into smaller problems

Accepted Answer

decomposition

Question 21

Which of the following is NOT a sorting algorithm? (1-2)

Accepted Answer

Binary

Question 22

what is algorithmic thinking

Accepted Answer

thinking of an algorithm to solve a problem

Question 23

Which sort is this? One item at a time, compare with ordered list, place in right order. (1-2)

Accepted Answer

Insertion

Question 24

what shape represents a process in a flow chart?

Accepted Answer

a rectangle

Question 25

what is a variable?

Accepted Answer

Data that is stored in a memory location, that can bechanged

Question 26

what is pattern recognition?

Accepted Answer

based on key features it sorts data into classes

Question 27

The following lists are to be merged, which element first goes into the new merged list? (4-5)

Accepted Answer

1

Question 28

where is an algorithm used?

Accepted Answer

they used indifferent areas where instruction sets areneeded

Question 29

Which sorting algorithm needs to go through the list repeatedly? (4-5)

Accepted Answer

Bubble

Question 30

If you did a binary search on the above list. How many comparisons to find number 10? (4-5)

Accepted Answer

1-2

Question 31

Define the term decomposition within computational thinking (1-2)

Accepted Answer

The breaking down of a problem into smaller problems

Question 32

what is decomposition

Accepted Answer

braking down big problems into small problems

Question 33

what is an algorithm

Accepted Answer

instructions set to help achieve a goal

Question 34

Which sort takes an item from a list, then puts it in the correct place in a sorted list? (4-5)

Accepted Answer

Insertion

Question 35

Identify the description of a binary search (4-5)

Accepted Answer

Put items in order, compare middle value, split list (loop)

Question 36

Identify the description of a linear search (4-5)

Accepted Answer

Items do not need be in order, check each item in turn.

Duplicate of GCSE OCR CS 2.1 Algorithms (1/2)

Questions 36

Duplicate of GCSE OCR CS 2.1 Algorithms (1/2)

Questions 36