Structured programming, Data Structure & Algorithms

What do you understand by term structured programming? Explain the structured programming as well.                                

Ans.

Structured Programming is explained below

This term is used for programming design that emphasizes the following points:-

(1) Hierarchical design of programming structure by making use of only the simple control forms of alteration, comparison and iteration.

(2) Representation of the hierarchical design directly in the program text, by making use of the structured control statement.

(3) Program text in which the textured series if statement corresponds to the execution series.

(4) By making use of single purpose groups of stack even if statement must be copied when a program is written by following these tenets of structural programming, it is much simple to understand, debug, verify to be correct and take modify and re- verify. Eg. C, Java, C ++

 

 

Posted Date: 7/13/2012 1:51:02 AM | Location : United States







Related Discussions:- Structured programming, Assignment Help, Ask Question on Structured programming, Get Answer, Expert's Help, Structured programming Discussions

Write discussion on Structured programming
Your posts are moderated
Related Questions
Channel access In first generation systems, every cell supports a number of channels. At any given time a channel is allocated to only one user. Second generation systems also

What are the different ways of representing a graph? The different ways of representing a graph is: Adjacency list representation: This representation of graph having of an


State the complex reallocation procedure Some languages provide arrays whose sizes are established at run-time and can change during execution. These dynamic arrays have an in

that will determine the volume of the sphere or the volume of cone or volume of pyramid depending on the choice of the user

prove that n/100=omega(n)


A depth-first traversal of a tree visits a nodefirst and then recursively visits the subtrees of that node. Similarly, depth-first traversal of a graph visits a vertex and then rec

write a program that find,search&replace a text string

Acyclic Graphs In a directed graph a path is said to form a cycle is there exists a path (A,B,C,.....P) such that A = P. A graph is called acyclic graph if there is no cycle in