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
Typical programming languages such as Pascal, C or Java give primitive data kinds such as integers, boolean, reals values and strings. They give these to be organised into arrays,

Triangular Matrices Tiangular Matrices is of 2 types: a)  Lower triangular b)  Upper triangular

How To implement stack using two queues , analyze the running time of the stack operations ?

In assignment, you have already started the process of designing a database for the Beauty Salon mini-case (enclosed again below), mainly in the phase of conceptual database design

The space-complexity of the algorithm is a constant. It just needs space of three integers m, n and t. Thus, the space complexity is O(1). The time complexity based on the loop

Method to measure address of any element of a matrix stored in memory. Let us consider 2 dimensional array a of size m*n further consider that the lower bound for the row index

A telephone directory having n = 10 records and Name field as key. Let us assume that the names are stored in array 'm' i.e. m(0) to m(9) and the search has to be made for name "X"

a. Determine the result of inserting the keys 4,19, 17, 11, 3, 12, 8, 20, 22, 23, 13, 18, 14, 16, 1, 2, 24, 25, 26, 5 in order to an empty B-Tree of degree 3. Only draw the configu

Q. What do you understand by the term by hash clash? Explain in detail any one method to resolve the hash collisions.