Tarjetas de memoria: Fundamentals of Algorithm and Programming — 16 tarjetas

Algorithm — definition?

A finite set of well-defined instructions to solve a problem.

Algorithm Steps — role?

Sequential instructions guiding from input to output.

Algorithm Properties — characteristics?

Correctness, finiteness, clarity, efficiency.

Representation Methods — examples?

Flowcharts, pseudocode, natural language.

Termination — importance?

Ensures algorithm concludes after finite steps.

Variables — define?

Memory locations holding data that can change.

Constants — define?

Memory locations with unchanging fixed values.

Variables vs Constants — difference?

Variables can change; constants cannot.

Data Types — examples?

Integer, Float, String, Boolean.

Type Assignment — purpose?

Declaring variables with specific data types.

Control Structures — include?

if, else, for, while, switch, nested structures.

Input Methods — example?

Keyboard input functions like input() or scanf().

Output Methods — example?

Display functions like print() or printf().

Algorithm Efficiency — measured by?

Time and space complexity, using Big O notation.

Problem Solving Strategies — examples?

Divide and conquer, greedy, dynamic programming.

Basic Programming Concepts — key?

Syntax, semantics, statements, expressions, comments, error handling.