Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Computer Science🎆 > Algorithms > Flashcards

Algorithms Flashcards

1
Q

what is computational thinking?

A

using techniques to help us solve complex problems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

why do we need to think computationally?

A

to help us solve complex problems more easily

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

name an example of thinking computationally

A

planning our your route when going to meet a friend

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

what is a complex problem?

A

a problem that is not easy to solve or understand at first

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

which computational thinking technique involves breaking a problem down into smaller parts?

A

decomposition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

to create a successful computer program, how many computational thinking techniques are usually required?

A

all 4

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

when is a computer most likely to be used when using computational thinking?

A

at the end when programming a computer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

what is pattern recognition?

A

when we look for similar patterns within problems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

why do we need to look for patterns in problems?

A

patterns make it easier for us to solve complex problems

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

what might happen if we don’t look for patterns in problems?

A

our solution may be inefficient

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

what is abstraction?

A

the process of filtering out both irrelevant characteristics and unnecessary detail

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

what is a model?

A

a representation of a problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

what is an algorithm?

A

a set of step by step instructions to help solve a problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

what are algorithms used for?

A

to plan out the solution to a problem

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

how can an algorithm be represented?

A

as a flowchart or pseudo code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

what is a flowchart?

A

a diagram that represents a set of instructions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

what is the correct symbol for a process instruction in a flowchart?

A

a rectangle

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

what is the correct symbol for an input in a flowchart?

A

a parallelogram

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

what links each instruction in a flowchart?

A

an arrow

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

what is the correct symbol for a decision in a flowchart?

A

a diamond

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

what is pseudocode?

A

a way of describing a set of instructions that doesent use specific syntax?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

what is evaluation?

A

the process that allows us to make sure our solution is correct

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

what does a searching algorithm do?

A

search through a set of data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

what does serial search do?

A

looks at the first item of data, then each one in turn until it finds the data item required

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

what is an advantage of serial search?

A

it is a simple algorithm

26
Q

what does binary search do?

A

takes the data and splits in half repeatedly until it finds the data item requested

27
Q

which searching algorithm would be best to use with ordered data?

A

binary, when a list is ordered

28
Q

what is an advantage of binary search?

A

it is very quick

29
Q

what is the biggest disadvantage of binary search?

A

it can only be used if the data is sorted into an order

30
Q

what does a sorting algorithm do?

A

puts a list of items into order

31
Q

what does bubble sort do?

A

sorts a list by comparing two items that are side by side to see which is out of order

32
Q

how many passes will a bubble sort go through?

A

as many passes it needs until the data is fully ordered

33
Q

why does a bubble sort do a final pass even when he data is in the correct order?

A

it does not recognise that the data is in order until the final pass requires no changes

34
Q

what is an advantage of bubble sort?

A

it is a very small and simple program

35
Q

what does a bucket sort do?

A

seperate a a list of data into different collections of data, these collections are then sorted back into a list

36
Q

what is a disadvantage of bucket sort?

A

it is more complicated than a bubble sort

37
Q

what is an advantage of bucket sort?

A

it is quicker to run than a bubble sort

38
Q

what 3 building blocks are used when designing algorithms?

A

sequencing, selection and iteration

39
Q

what is sequencing?

A

the order in which the steps are carried out in an algorithm

40
Q

why is sequencing important?

A

it is important that the sequence of steps is correct to ensure the algorithm functions as intended

41
Q

what might happen is the sequence is wrong?

A

the algorithm may produce unexpected results

42
Q

how is sequencing represented in a flowchart?

A

as a series of boxes that follow each other, linked by arrows

43
Q

how is sequencing represented in pseudocode?

A

with each step of the algorithm written on a line of its own

44
Q

what is selection?

A

a decision

45
Q

why is selection important?

A

it allows us to include more than one path through a solution

46
Q

how many paths can be followed from a decision?

A
  1. true or false
47
Q

in pseudocode how is a decision represented?

A

IF-THEN-ELSE

48
Q

which of the instructions, IF THEN ELSE represents a question?

A

IF

49
Q

which of the instructions IF THEN ELSE points to what to do if the answer to the question is false?

A

ELSE

50
Q

what does the instruction ELSE IF allow?

A

allows there to be more than 2 paths through an algorithm

51
Q

what is iteration?

A

repeating steps in an algorithm

52
Q

why is iteration important?

A

it allows us to simplify an algorithm by removing unnecessary steps

53
Q

what is another name for iteration?

A

loop

54
Q

what is a condition?

A

a situation that is checked every time iteration occurs

55
Q

what is meant by testing a condition?

A

checking to see if a condition has been met

56
Q

how is iteration represented in pseudocode?

A

REPEAT UNTIL

57
Q

how is iteration represented in a flowchart?

A

as a decision

58
Q

what is a counter used for in iteration?

A

to keep track of how many times the solution has iterated

59
Q

what is logical reasoning?

A

using rules to solve problems

60
Q

what is logical reasoning used for?

A

to predict the outcome of an algorithm

61
Q

why is logical reasoning used?

A

to compare the effectiveness of different algorithms to solve a problem

Computer Science🎆 (4 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions