Topic 4—Computational thinking, problem-solving and programming

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/32

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

33 Terms

1
New cards

Sub-procedures

In computer programming, a subprocedure is a sequence of program instructions that perform a specific task, packaged as a unit.

2
New cards

AND

The output is true when A and B is true.

3
New cards

OR

The output is true when A is true or B is true, or both are true.

4
New cards

NOT

The output is true when the input is false (unary operator).

5
New cards

NAND

The output is true only when when A and B are false

6
New cards

NOR

The output is true when A and B are false.

7
New cards

XOR

The output is true when only A or B is true (Note the "or both" condition does not apply).

8
New cards

Gantt Chart

A chart in which a series of horizontal lines shows the amount of work done or production completed in certain periods of time in relation to the amount planned for those periods.

9
New cards

Abstraction

The process of abstraction in programming is used to hide certain details and only show the essential features of the object.

10
New cards

Array

A data structure consisting of a collection of elements identified by an index or key.

11
New cards

Sequential search

This is a method for finding a target value within a list. It searches through teach element one by one until the target value is found.

12
New cards

Binary search

A search algorithm that finds the position of a target value within a sorted array. It uses a divide an conquer approach.

13
New cards

Bubble sort

This is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order.

14
New cards

Selection sort

This is a simple algorithm starts by finding the minimum value in the array and moving it to the first position. This step is then repeated for the second lowest value, then the third, and so on until the array is sorted.

15
New cards

Pseudocode

A notation resembling a simplified programming language, used in program design.

16
New cards

Flowchart

A graphical representation of a computer program in relation to its sequence of functions.

17
New cards

Higher level language

A programming language that is closer to human languages than machine languages.

18
New cards

Compiler

A special program that processes statements written in a particular programming language and turns them into machine language

19
New cards

Interpreter

A program that can analyze and execute a program line by line.

20
New cards

Virtual machine

A virtual machine is a software computer that, like a physical computer, runs an operating system and applications.

21
New cards

Variable

A storage location paired with an associated symbolic name (an identifier), which contains some known or unknown quantity of information referred to as a value.

22
New cards

Constant

A value that cannot be altered by the program during normal execution.

23
New cards

Operator

A symbol such as +, −, ×, etc

24
New cards

Object

A particular instance of a class which can be a combination of variables, functions, and data structures.

25
New cards

mod

It finds the remainder after division of one number by another

26
New cards

div

Integer division.

27
New cards

FOR loop

This statement provides a compact way to iterate over a range of values.

28
New cards

WHILE loop

This statement continually executes a block of statements while a particular condition is true.

29
New cards

Precondition

A condition that must be fulfilled before other things can happen or be done.

30
New cards

Postcondition

A condition that must always be true just after the execution of some section of code or after an operation in a formal specification.

31
New cards

Concurrent processes

Several computations are executed during overlapping time periods

32
New cards

Stepwise refinement

A way of developing a computer program by first describing general functions, then breaking each function down into details which are refined in successive steps until the whole program is fully defined.

33
New cards

Exceptions

An event, which occurs during the execution of a program, that disrupts the normal flow of the program's instructions.