ICT Flashcards

1
Q

Computational thinking

A
  • Its a way of learning skills to help us solve problems without needing a computer
  • With practice it allows us to understand and analyse a problem we can then breack it down into simple steps and develop a solution that computer and or human can understand
  • There are main steps to computational thinking :
  • decomposition *pattern recognition
  • abstraction *algorithms
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Decomposition

A
  • Breaking complez problems down into smaller, more mangeable parts or tasks
  • Steps must be:
  • simple *specific
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Pattern recognition

A
  • We can look for anything that is similar or shares the same characteristics
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Abstraction

A
  • With abstraction you look at all of the information and then decide what is important to help you solve your problem
  • Anything that isnt necessary is removed
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Algorithms

A
  • An algorithm is a set of instructions or rules that we create to carry out a task
  • We can use algorithms to get computers to carry out tasks
  • We can use the constructs of sequencing, selction and iteration to design algorithms
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Algorithms constructs

A
  • Sequencing is the order of the instructions
  • Selection happens when there is a step where there are 2 or more possibilities
  • Iteration is when a step must happen more than once
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Introduction to programming

A

All : understand how we can solve problems usng computational thinking
Most : be also to represent problems using data flow diagram
Some : start to solve problems indepently

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

Sorting algorithms

A
  • Programmers use some algorithms to sort lists of data

- Example sorting a list of numbers into numerical order

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

An insertion sort

A
  • An algorithm that sorts out a list of items one by one
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Array

A

list of variables

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

Bubble sort

A
  1. Move from left to right
  2. Compare each variable to the one next to it and if possible switch
  3. Move on to next pair
  4. When get to end, start from left
  5. Repeat until all in order
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Quick sort

A
  1. Choose a pivot
  2. Swap numbers either side of pivot
  3. Swap final number from right with pivot
  4. Pivot ends up in right place
  5. Repeat for numbers each side of pivot
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Symbols

A
  • START/END : an oval represents a start or end
  • ARROWS : a line is a connection
  • INPUT/OUTPUT : a parallelogram represents a process
  • DECISION : a diamond indicates a decision
How well did you know this?
1
Not at all
2
3
4
5
Perfectly