Algorithms Flashcards
1
Q
Which are the 3 computational thinking principles?
A
- decomposition
- abstraction
- algorithmic thinking
2
Q
Abstraction
A
The process of removing unnecessary details and only including relevant details
3
Q
Abstraction examples
A
- flowcharts
- variables in program
4
Q
Decomposition
A
Breaking down complex problem down into smaller problems and solving each one individually
5
Q
Advantages of decomposition
A
- problems easier to solve
- different people can work on different
parts of a problem at the same time - reduces development time
- program components developed in
one program can easily be used in
other programs
6
Q
algorithmic thinking
A
- a logical way of getting from the
problem to the solution - by creating a set of rules, an algorithm
that is followed precisely leads to an
answer
7
Q
syntax error
A
errors which break the grammatical rules of programming language
- stop from program from running
8
Q
Logic error
A
Produce an unexpected output but wont stop the program from running
9
Q
An advantage of using trace tables
A
Excellent way to track down logic errors in the program
10
Q
Binary search properties
A
- requires data to be ordered
- more efficient than linear search
11
Q
Linear search properties
A
- doesn’t require data set to be in order
- work on any type of storage devices
- can be efficient for smaller data sets
- inefficient for large data sets
12
Q
bubble sort
A
- most insufficient of sorting algorithms
- easy to implement
- made for small data sets
13
Q
merge sort
A
- works well for large data sets
- very efficient method of sorting
14
Q
What are the 5 data types?
A
- integer
- float
- boolean
- character
- string
15
Q
casting
A
converting a variable from one data type to another
