Stepwise Refinement and Pseudo-Codes: An Introduction
dc.contributor.author | Rao, V. Venkata | |
dc.contributor.author | Yegneshwar, S. | |
dc.date.accessioned | 2010-08-05T11:24:33Z | |
dc.date.available | 2010-08-05T11:24:33Z | |
dc.date.copyright | 1992 | |
dc.date.issued | 2010-08-05T11:24:33Z | |
dc.identifier.uri | http://hdl.handle.net/11718/7044 | |
dc.description.abstract | This note is meant to give an introduction to stepwise refinement as a method of describing/developing an algorithm, which can be later converted to a computer program in a procedural language like BASIC, FORTRAN, or PASCAL. In developing an algorithm in this strategy, using an informal language is convenient. Because of this the note also introduces pseudo-code concepts. There are four sections in the note: 1) What is computer programming, 2) Steps in developing a program, 3) Pseudo-code constructs, and 4) Stepwise refinement: An example. Each concept and point is illustrated through examples. | en |
dc.language.iso | en | en |
dc.subject | Computer and Information Systems | en |
dc.title | Stepwise Refinement and Pseudo-Codes: An Introduction | en |
dc.type | Cases and Notes | en |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
-
Cases and Notes [2722]
Cases and Notes