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
Importance of Object-Oriented over java Java is basically based on OOP notions of classes and objects. Java uses a formal OOP type system that should be obeyed at compile-t

What is the best-case number of comparisons performed by mergesort on an input sequence of 2 k distinct numbers?

Draw trace table and determine output from the subsequent flowchart using below data:  X = 5, -3, 0, -3, 7, 0, 6, -11, -7, 12

How sparse matrix stored in the memory of a computer?

What is an Algorithm? An algorithm is a sequence of unambiguous instructions for solving a problem, i.e., for getting a needed output for any legitimate input in a finite amoun

For splaying, three trees are maintained, the central, left & right sub trees. At first, the central subtree is the complete tree and left and right subtrees are empty. The target

Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine.    A n

Run time complexity of an algorithm is depend on

Prove that uniform cost search and breadth- first search with constant steps are optimal when used with the Graph-Search algorithm (see Figure). Show a state space with varying ste

algorithm to search a node in linked list