Computational Thinking Flashcards

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

What is abstraction?

A

The process of removing elements of a code or program that aren’t relevant or that distract from more important elements.

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

What is decomposition?

A

Decomposition is when we break a problem or task down into smaller parts to make it easier to tackle.

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

What is a trace table?

A

A trace table is a technique used to test an algorithm and predict step by step how the computer will run the algorithm.

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

What is a record?

A

A record is a collection of fields, possibly of different data types, typically in a fixed number and sequence.

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

What are the 4 flow chart symbols you need to know?

A

-Oval: Start/End
-Rectangle: Process
-Arrow: Relationships between shapes
-Diamond: Decision

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

How does a linear search work on unsorted data?

A

If the list is not sorted then the only way to search an element is to sequentially visit each element.

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

What is a truth table?

A

The truth table displays the logical operations on input signals in a table format.

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