Problem-Solving and Program Design

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

1/23

flashcard set

Earn XP

Description and Tags

Flashcards generated from lecture notes on problem-solving, program design, algorithms, data types, and control structures.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

24 Terms

1
New cards

Algorithm

A step-by-step set of instructions to solve a problem or complete a task.

2
New cards

Finite Steps (Algorithm Characteristic)

The algorithm must have a limited number of steps; it cannot go on forever.

3
New cards

Precise (Algorithm Characteristic)

Each step must be clear and well-defined.

4
New cards

Unambiguous (Algorithm Characteristic)

There should be no confusion; every step must be easily understood.

5
New cards

Flow of Control (Algorithm Characteristic)

Steps must follow a logical sequence, moving from one step to the next in order.

6
New cards

Terminate (Algorithm Characteristic)

The algorithm must eventually stop after completing the task.

7
New cards

Variable

A container that holds information, and its value can change while a program is running.

8
New cards

Constant

A container that holds information, but its value never changes.

9
New cards

Integer Data Type

Whole numbers (e.g., 5, 10, -3).

10
New cards

Floating Point Data Type

Numbers with decimals (e.g., 3.5, 10.25, -2.7).

11
New cards

Character Data Type

A single letter, digit, or symbol (e.g., ‘A’, ‘5’, ‘$’).

12
New cards

Boolean Data Type

Only True or False.

13
New cards

String Data Type

A group of characters (words, sentences).

14
New cards

IPO Chart

A tool to break down a system or a program into its three main components: Input, Process, Output.

15
New cards

Input (IPO)

The data or information that is entered into the system.

16
New cards

Process (IPO)

The actions or computations performed on the input to transform it.

17
New cards

Output (IPO)

The result or information produced after processing.

18
New cards

Pseudocode

A way of writing algorithms in a format that is easy to understand, using simple English-like commands.

19
New cards

IF-THEN (Conditional Branching)

Used when there is only one condition to check.

20
New cards

IF-THEN-ELSE (Conditional Branching)

Used when there are two possible outcomes.

21
New cards

Nested IF (Conditional Branching)

Used when there are multiple conditions to check (IF inside another IF).

22
New cards

FOR Loop

Used when the number of repetitions is known.

23
New cards

WHILE Loop

Used when a condition must be met to continue.

24
New cards

REPEAT-UNTIL Loop

Used when you want to execute the block at least once, then check the condition at the end.