Fichas
12: Algorith Design and Problem-Solving
Fichas del conjunto (24)
- 1Computational thinkingproblem-solving process with number of steps to reach a solution.
- 2What are the 4 key strands of computational thinking?Abstraction
Decomposition
Data modelling
Pattern recognition and algorithmic thinking - 3Abstractionfiltering out information not necessary to solve a problem. Deal with complexity. An algorithm is an abstraction of a process that takes inputs, executes a sequence of steps, and produces outputs
- 4DecompositionBreaking down problems into sub-problems to explain process clearer - program models, procedures, functions
- 5Data ModellingAnalysing and organising data. Abstract data models -model real world concepts. such as queues or stacks. Defining classes. Facts and rules. Random files
- 6Pattern RecognitionLooking for patterns or common solutions to common problems - more efficient ie sorting and searching - standard algorithms
- 7AlgorithmA sequence of defined steps that can be carried out to perform a task
- 8Algorithm designinvolves developing step by step instructions to solve a problem
- 9Structured EnglishA subset of the english langue that consists of command statements used to describe an algorithm
- 10PseudecodeA way of using keywords and identifiers to describe an algorithm without following the syntax o a particular programming language
- 11FlowchartShapes linked together to represent the sequential steps of an algorithm.
- 12When writing algorithms what are the 4 basic types of construct and what are they?-Assignment: value is given a name (identifier) or value associated with a given identifier is changed
-Sequence: Number of steps are performed one after another
-Selection: under certain conditions some steps are performed, otherwise different or no steps
-Repetition: steps performed number of times. iteration or looping - 13VariableA storage location for a data value that has an identifier
- 14Identifier tableA table listing the variable identifiers required for the solution, with explanations and data types.
- 15what is the symbol for not equal to in pseudecode?<>
- 16Nested IF statementsConditional statements within conditional statements
- 17what are the 3 loops and how show in pseudecode?repeat loop: repeat ___ unil ___
for loop: FOR (counter - 2 to 10) ____ Next counter
while loop: WHILE ____ DO ____ Endwhile - 18Rogue ValueA value used to terminate a sequence of values. (same data type but outsied of range of expected values) ie repeat until rogue or while not rogue do this
- 19Nested looploop containing another loop
- 20Stepwise Refinementbreaking down the steps of an outline solution into smaller and smaller steps
- 21ProcedureA sequence of steps that is given an identifier and can be called o perform a subtask. (each sub-task is a 'module' that refined separately. Modules are procedures and functions)
procedure ___
Endprocedure (doesn't return data type) - 22FunctionA sequence of steps that is given an identifier and returns a single value; function call is part of an expression. (function defines states data type of return value)
Function ___ returns (data type)
End function - 23Local VariableA variable that is accessible only within the module in which it is declared
- 24Global VariableA varaible that is accessible from all modules
Información
- Descripción
- A Level (Unit 2: Fundamental Problem-solving and Programming Skills) AS Computer Science Fichas sobre 12: Algorith Design and Problem-Solving, creado por HRYN red el 05/01/2023.
- Creado por
- HRYN red
- Visitas
- 2
- Valoración