Scribd
Upload
38 views5 pages

Module 4

The document discusses several software design techniques including flowcharts, pseudocode, finite state machines, and extended finite state machines. It provides examples and rules for creating a basic flowchart to log into a Facebook account. Pseudocode is described as an informal way to describe a program algorithm without strict syntax. Finite state machines are defined as having finite sets of states and transitions between them to recognize patterns in binary strings. Extended finite state machines similarly use state machines but can have internal state variables and inputs.

Uploaded by

Sumayya Fiaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
38 views5 pages

Module 4

The document discusses several software design techniques including flowcharts, pseudocode, finite state machines, and extended finite state machines. It provides examples and rules for creating a basic flowchart to log into a Facebook account. Pseudocode is described as an informal way to describe a program algorithm without strict syntax. Finite state machines are defined as having finite sets of states and transitions between them to recognize patterns in binary strings. Extended finite state machines similarly use state machines but can have internal state variables and inputs.

Uploaded by

Sumayya Fiaz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

MODULE 4

SUITABILITY OF SOFTWARE BEHAVIOURAL


DESIGN TECHNIQUE
Flow chart
An illustrative representation of the algorithm is a flowchart. As many methods as possible can
be used to draw a flowchart

Rules for a flowchart


 A flow chart is mostly drawn from prime to bottom.

 All the boxes within the flow chart should be connected with the Associate in
Nursing arrow.
 All flowcharts begin with a terminal or method image.

List of symbols
 Terminal: used to indicate the start and stop
 Input/output: taking input and showing output
 Process: indicates any type of internal operations like calculation
 Decision: only YES/NO or TRUE/FALSE can be written
 Connector: use to connect the breaks of the flowchart
 Control flow: shows the direction of flow

The below figure is a flowchart to log in to your facebook account

Figure 1 Flowchart example


Pseudo-code

 Pseudo-code may be a compact and informal high-level description of a program.


 Pseudo-code isn’t a malicious program.
 Pesude is an off-the-cuff way of describing a program.
 Pseudo-code will use the tongue or compact notational system.
 It’s not meant for compilation
 It’s a rough sketch of the particular program

Syntax of pseudo-code
 No indicated pseudo-code syntax exit
 Thus we don't have to be compelled to follow any strict syntax sort of computer
language.
 Pseudo-codes vary in vague from author to author
 It usually borrows its syntax from widespread programming languages like C, Fortran,
Pascal, Java, and so on

Formal specification method


A formal specification may be a declaration that's expressed in language, syntax, and
linguistics. this suggests that the language is mathematically based mostly} and can't be
common language based. within the formal specification, understanding, and perception of
the planning and necessities of the software system square measure provided. In some
cases, it'll be doable to animate a regular system specification for a model.

Finite state machine


There are unit 2 kinds of finite state machines (FSMs): settled finite state machines,
typically referred to as settled finite automata, and non-deterministic finite state machines,
typically referred to as non-deterministic finite automata. Their area unit slight variations
in how state machines appear visually, however, the ideas behind them stem from identical
process ideas. By definition, settled finite automata acknowledge, or accept, regular
languages, and a language is regular if a settled finite automaton accepts it. FSMs are
sometimes tutored programming languages based on binary strings that follow a specific
pattern. Each regular and non-regular language may be created out of binary strings. The
binary string language is the language used to represent all strings that contain the initial
character. In this language, strings like 001, 010, 0, and 01111 are valid unit strings (along
with several others), however, strings like 111, 10000, 1, and 11001100 (along with several
others) are not valid.

Extended finite state machine


EFSMs are a straightforward and natural classification of models for synchronous systems.
Associate in Nursing EFSM models a synchronous system employing a state machine that
has finitely several modes (also called states) and transitions (edges) between them.
Examples
I:inti: int are the input variables
The output variable Z is an integer.
X: int: int is the internal state variable.

You might also like