UNIT 1 – Fundamentals of Software short

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

1/49

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

50 Terms

1
New cards

Program

A sequence of instructions written in a computer language to solve a problem

2
New cards

Goal of Programming

Solve problems quickly and accurately using computers

3
New cards

Law of Equifinality

Same result can be achieved through different methods (solution strategies)

4
New cards

Optimum Solution

Best strategy uses least time and resources

5
New cards

Task Analysis

Breaking down a problem to understand what needs to be done

6
New cards

Algorithm

A finite

7
New cards

Pseudocode

Structured English-like statements to describe an algorithm

8
New cards

Pseudocode Advantages

More precise than natural language

9
New cards

Pseudocode Note

Not executable; used for planning before coding

10
New cards

Flowchart Definition

Graphical representation of an algorithm using standard symbols

11
New cards

Program Flowchart

Shows logic of a single program

12
New cards

System Flowchart

Shows how related programs interact

13
New cards

Flowchart Benefits

Easier error detection

14
New cards

Flowchart Rule 1

Use standard symbols only

15
New cards

Flowchart Rule 2

Flow from top to bottom and left to right

16
New cards

Flowchart Rule 3

One entry/exit per symbol (except decisions)

17
New cards

Flowchart Rule 4

Operations independent of programming language

18
New cards

Flowchart Rule 5

Label decision branches clearly

19
New cards

Control Structures

Sequence

20
New cards

Sequence Control

Instructions executed one after another

21
New cards

Selection Control

Decision making (if

22
New cards

Repetition Control

Loops for repeating actions (for

23
New cards

Problem-Solving Phase

Analysis

24
New cards

Analysis & Specification

Understand and define the problem

25
New cards

General Solution (Algorithm)

Determine required data and logical steps

26
New cards

Verification

Test algorithm logically to confirm it solves the problem

27
New cards

Implementation Phase

Coding

28
New cards

Coding

Translate algorithm into programming language

29
New cards

Testing/Debugging

Run program

30
New cards

Maintenance Phase

Use and Update the program

31
New cards

Use Phase

Deploy the program for intended purpose

32
New cards

Update Phase

Modify program to meet new requirements or fix errors

33
New cards

Key Advice

Think first

34
New cards

Algorithm Example

Print "Good Morning" (Start → Print → End)

35
New cards

Cooking Rice Algorithm

Illustrates sequence

36
New cards

Pseudocode Example

Area of circle (Ask radius

37
New cards

Terminal Symbol

Shows start/end of flowchart (oval shape)

38
New cards

Input/Output Symbol

Shows input/output operations (parallelogram)

39
New cards

Processing Symbol

Shows calculations or actions (rectangle)

40
New cards

Decision Symbol

Shows yes/no conditions with two paths (diamond)

41
New cards

Flow Line

Connects symbols to show direction of flow (arrow)

42
New cards

Sequential Control Structure

Default control where statements run in order

43
New cards

Selection Control Structure

Makes decisions based on conditions (if/else)

44
New cards

Repetition Control Structure

Repeats code while condition is true (loops)

45
New cards

Waterfall Model

Sequential phases: Analysis → Design → Code → Test → Maintain

46
New cards

Debugging

Finding and fixing errors in code

47
New cards

Algorithm Must Be Finite

Ends after limited steps

48
New cards

Algorithm Must Be Ordered

Steps follow clear sequence

49
New cards

Equifinality Principle

Multiple paths to same solution

50
New cards

Optimum Way

Most efficient solution with least resources