Topic 4.1

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

1/29

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

30 Terms

1
New cards

Problem

a situation that needs attention and

needs to be dealt with or solved

2
New cards

Decision Making

Intelligence Gathering, Design, and Choice

3
New cards

Computer Program

a sequence of instructions, written to instruct a computer to perform a specified task

4
New cards

Algorithm

a series of unambiguous instructions designed in order to solve a problem and achieve a certain goal in a finite number of steps

5
New cards

Properties of an Algorithm

finiteness, definiteness, input, output, effectiveness

6
New cards

Finiteness

An algorithm must always terminate after a finite number of steps a very finite number, a reasonable number

7
New cards

Definiteness

Each step of an algorithm must be precisely defined; the actions to be carried out must be rigorously and unambiguously specified for each case

8
New cards

Input

quantities which are given to it initially before the algorithm begins

9
New cards

Output

quantities which have a specified relation to the inputs

10
New cards

Effectiveness

all of the operations to be performed in the algorithm must be sufficiently basic that they can in principle be done exactly and in a finite length of time by a man using paper and pencil

11
New cards

Purpose of Pseudocode

to help programmers develop computer programs. Because pseudocode is written for humans the syntax used is not as strict as the one used in computer languages

12
New cards

Thinking Procedurally

step-by-step problem solving

13
New cards

Thinking Logically

Decision-making and conditions

14
New cards

Thinking Ahead

Pre-planning inputs, outputs, etc

15
New cards

Thinking Concurrently

the execution of different instructions simultaneously by multiple processors so as to achieve the best performance. 

16
New cards

Thinking Abstractly

Simplification and focus on essentials

17
New cards

Top-Down Design/Stepwise refinement

the complex problem is decomposed and for each sub-problem, an appropriate sub-procedure is developed

18
New cards

Sub-Procedure

contains a series of commands that perform a task: so the procedure is divided into a series of sub-procedures; this process is referred as a modular programming approach.

19
New cards

Identifier

the name that is used by the programmer to uniquely identify a variable, an object a sub-procedure etc.

20
New cards

Iteration

the process of repeating a series of instructions

21
New cards

Example of Pre-Planning

use of software libraries e.g Numpy or Pandas

22
New cards

Gantt Chart

a type of bar chart widely used for project schedule and project management, as a way of showing activities, tasks and events against time

23
New cards

Exception

an act or event that disrupts the anticipated flow of the program’s execution

24
New cards

Sequential Processing

is the execution of all sub-procedures one after the other by a single processor

25
New cards

Requirements of Concurrent Processing

better planning and coordination of resources

26
New cards

Abstraction

the process of taking away or removing characteristics from something in order to reduce it to a set of essential characteristics.

a technique for managing complexity of computer systems.

27
New cards

Collection

a data structure that consists of the data and the predefined methods which operate on the data.

28
New cards

Abstract Data Type

a group of operations and data

29
New cards

Mathematical Modelling

a system is understood well enough and scientists describe it using mathematical language

30
New cards

Computer Simulation

runs on a computer and reproduces the behavior of a real system.