answersLogoWhite

0


Best Answer

Step-wise refinement is a technique for software development using a top-down, structured approach to solving a problem. It allows the developer to use a controlled method of developing an algorithm that will eventually solve a given problem.

Basically, step-wise refinement involves the use of a generalized approach to a problem, perhaps written in pseudo-code. The next step would be to fill in one of the holes in the code. The pseudo-code describes a general, non-specific way to solve the problem deferring the actual decisions until last minute. That way the developer can assign place-holders in the logic until they are actually needed.

Then, each step involves the use of refining (adding the logic) a step in the development of the algorithm to make it more specific, doing so one step at at time.

When everything has been refined you have a complete program; however, it takes multiple steps (step-wise refining) to get to that point where a complete, syntactically correct program emerges.

User Avatar

Wiki User

14y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is Stepwise refinement techniques in data structure?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Where can you learn all about sorting techniques?

wikipedia or refer to a data structure books


Differentiate abstraction and refinement in software engineering?

Abstraction : 1.It provides compact design process. 2.when we consider modular solution to any problem,many levels of abstraction Can be posed. Refinement: 1.It allows more flexible design process. 2.stepwise refinement is a top-down design strategy.


What is database administartor?

dba is a person or group of persons who manages the data nd defining db structure,storage structure, accessing methods nd backup techniques


What are the subject-matters of data structure?

types of data structure types of data structure


How do you amend a data structure?

How do you amend a data structure?


What is the difference between allocation and search data structure?

difference between serch data structure and allocation data structure


What is homogeneous data structure?

collection of dissimilar type of data is called non homogeneous data structure as for example structure .


Techniques used to summarize organize and present data that have been collected are called?

Data Gathering and Representation Techniques


What has the author Thomas A Standish written?

Thomas A. Standish has written: 'Data structures, algorithms, and software principles' -- subject(s): Computer algorithms, Data structures (Computer science), Software engineering 'Data structure techniques' -- subject(s): Data structures (Computer science)


What is the weakness of Data structure diagram?

weakness of data structure diagrams


What is a homogeneous data structure and why is this a weakness for RDBMS?

in homogeneous data structure all the elements of same data types known as homogeneous data structure. example:- array


What are some examples of data mining techniques?

Although there are a number of data mining techniques there are three that are most commonly used. These common techniques include decision trees, artificial neutral networks and the nearest-neighbour method. These techniques each analyze data in different ways.