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
WRITE AN ALGORITHM TO READ TWO NUMBERS AND PRINT THE LOWER VALUE

the voltage wave forms are applied at the inputs of an EX-OR gate. determine the output wave form

discuss the operating system under the following: MONOLITHIC SYSTEM,LAYER SYSTEM AND VIRTUAL MACHINES

Run time complexity of an algorithm is depend on

AVL trees and the nodes it contains must meet strict balance requirements to maintain O(log n) search time. These balance restrictions are kept maintained via various rotation func

An advertising project manager developed the network diagram shown below for a new advertising campagign.  In addition, the manager gathered the time information for each activity,

Construct G for α, n, and W given as command line parameters. Throw away edges that have an asymmetric relation between nodes. That is, if A is connected to B, but B is not connect

I am looking for assignment help on the topic Data Structures. It would be great if anyone help me.

Consider the file " search_2013 ". This is a text file containingsearch key values; each entry is a particular ID (in the schema given above). You are tosimulate searching over a h

Merge sort is a sorting algorithm which uses the basic idea of divide and conquers. This algorithm initially divides the array into two halves, sorts them separately and then merge