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
The size of stack was declared as ten. Thus, stack cannot hold more than ten elements. The major operations which can be performed onto a stack are push and pop. However, in a prog

I need a recursive algorithm to implement the FIRST function to any grammar

Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the progr

Create a class "box" that will contain a random integer value v such that O

One of the best known methods for external sorting on tapes is the polyphase sort. Principle: The basic strategy of this sort is to distribute ordered initial runs of predetermi

What is an algorithm?  What are the characteristics of a good algorithm? An algorithm is "a step-by-step process for accomplishing some task'' An algorithm can be given in many

State in detail about the Integer Carrier set of the Integer ADT is the set {..., -2, -1, 0, 1, 2, ...}, and  operations on these values are addition, multiplication, subtrac

Objectives The purpose of this project is to give you significant exposure to Binary Search Trees (BST), tree traversals, and recursive code. Background An arbitrary BST i

The number of different directed trees with 3 nodes are ?? The number of disimilar directed trees with three nodes are 3

In this example, suppose the statements are simple unless illustrious otherwise. if-then-else statements if (cond) { sequence of statements 1 } else { sequence of st