Introduction to Problem Solving Using Algorithm

Detailed vocabulary flashcards covering basic programming concepts, language levels, translation methods, algorithm properties, and pseudocode structures based on the lecture notes.

Programming

A set of instructions used to operate a computer to produce a specific result; the process of writing software.

Low Level Language

Instructions tied directly to one type of computer, such as machine language or assembly language.

High Level Language

Programming languages that can run on a variety of computer types and use instructions resembling written English, like Python, Java, or C++.

Machine Language

A collection of binary digits ($0$s and $1$s), also known as Executable Machine Code or Object Code, which is the only language a computer understands.

Opcode

Short for operation code; it is the part of a machine language instruction that specifies the operation to be performed.

Address

The part of a machine language instruction that indicates the memory location of the data to be used.

Assembly Language

A language one level higher than machine language consisting of simple codes; it must be translated into machine code using an assembler.

Source Code

Programs written in a high or low level language that must be translated into machine instructions before execution.

Compiler

A translator that converts all statements of a program at once into an executable object program for later execution.

Interpreter

A translator that converts and executes each statement individually and immediately.

Script

A file containing instructions written using a text editor, such as Python instructions written in Visual Studio Code or PyCharm.

Basic Program Structure

The conceptual model consisting of Input data, Process the data, and Output results ($IPO$).

Algorithm

A sequence of steps describing how to solve a problem that is well-defined, well-ordered, performable, results-producing, and finite.

Pseudocode

English-like phrases used to describe an algorithm in textual form, ideally with one action per line.

Flowchart

A diagram showing the flow of instructions in an algorithm using symbols linked together with arrows.

Identifier Name

A meaningful name given to variables to keep track of data, such as $StudentName$ or $Counter$.

Sequence

A program structure that defines the exact order in which instructions are executed.

Selection

A program structure that allows a choice between different operations based on specific conditions, such as $IF...ELSE$ statements.

Iteration

A program structure, also called looping or repetition, that allows the same operation to be repeated based on a condition.

Invocation

A program structure involving the calling or invoking of a specific set of statements when needed.

Testing

A method used to verify the correctness of a program and ensure it meets requirements.

Bug

A term used to describe an error in a program.

Debugging

The process of locating, correcting, and verifying the correction of an error in a program.

Rectangle Area Formula

$$\text{Area} = \text{length} \times \text{width}$$

Circle Circumference Formula

$$\text{Circumference} = 2 \times 3.142 \times \text{radius}$$

Fahrenheit to Celsius Conversion

$$\text{Celsius} = (\text{Fahrenheit} - 32) \times \frac{5}{9}$$