practice test questions Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is decomposition?

A

The breaking down of a problem into smaller, simpler steps or stages.

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

Which is easier to write or code ?

A

a linear search

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

A Syntax error is?

A

An error caused by misspelling code, or using the wrong keywords

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

What can searching algorithms be used for?

A

Software applications

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

Which of the below describes the way a bubble sort algorithm works?

A

Step through the list comparing current and next values and swapping if necessary

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

When decomposing a problem what kind of structure can we use?

A

A structure diagram

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

Which search algorithm is more efficient?

A

binary search

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

What is abstraction?

A

The removal of unnecessary details

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

A logic error is..?

A

An error in a program which is unintentionally incorrect, but the program works

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

Which search algorithm is good for a list with not many items?

A

Linear search

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

What is the point in using a flowchart?

A

It gives a clear flow on the way the code should work and gives a vague outline

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

Why do we use pseudocode when coding?

A

It is used in planning an algorithm when sketching out the structure of the program
before actually coding

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

What happens in stage 2 of the merge sort?

A

Each pair of sublists is repeatedly merged to produce new sorted sublists

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

How does binary search work?

A

It repeatedly divides portion of list in half

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

What is an algorithm?

A

A series of instructions to complete a task

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