COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
Flowcharting
|
|
Algorithms
|
|
Pseudocodes
|
|
Stepwise Refinement
|
Detailed explanation-1: -Stepwise Refinement (Example) Start with the initial problem statement. Break it into a few general steps. Take each “step", and break it further into more detailed steps. Keep repeating the process on each “step", until you get a breakdown that is pretty specific, and can be written more or less in pseudocode.
Detailed explanation-2: -Stepwise refinement is the idea that software is developed by moving through the levels of abstraction, beginning at higher levels and, incrementally refining the software through each level of abstraction, providing more detail at each increment.
Detailed explanation-3: -In the design of algorithms, partition refinement is a technique for representing a partition of a set as a data structure that allows the partition to be refined by splitting its sets into a larger number of smaller sets.
Detailed explanation-4: -Data refinement is used to convert an abstract data model (in terms of sets for example) into implementable data structures (such as arrays). Operation refinement converts a specification of an operation on a system into an implementable program (e.g., a procedure).