Skip to main content

'Structured Programming' In C Language


          The structured programming refers to the process in which we break the overall job down into separate pieces of modules.The modules are further can be broken into smaller sigments or pieces which are known as submodules . Modules must be chosen in such a way that we can specify how there is a contact between each pair of modules.

  This specifies two things:-

 1] What the module will do?

2] What assumptions is it making about the behaviour of the other modules? In particular, we must specify what inputs a particular module is to recieve from the various other modules and what outputs it is required to provide for them.
  In other words, structured programming is a subset of procedural programming that enforces a logical structure on the program being written to make it more efficient and easier to understand and modify. Structured programming frequently employs a top-down design model,in which developers map out the overall program structure into separate subsections. A defined function or set of similar function is coded in a separate module or submodules, which means that code can be loaded into memory more efficiently and that module can be reused in other programs. After a module has been tested individually, it is then integrated with other modules into the overall program structure.
 structured programming wa s first suggested by Corrado Bohm and Guiseppe jacopini. The two mathematicians demonstrated that any computer program can be written with just three structures:-

 i> Decisions.
ii> Sequences.
iii> loops.
  

 Almost any language can use structured programming techniques to avoid common pitfalls of unstructured languages. most modern procedural languages includes features that encourages structured programming. Object-oriented programming(OOP) can be thought of as a type of structured programming techniques for program flow , and adds more structure for data to the model.
Advantages of structured programming:-

 i>  It decreases the complexity of the program by breaking it down into smaller logical units.

 ii> Allows several programmers to code simultaneously.

 iii> Allows common functions to be written once and then used in all the programs needing them.

 iv> Decreases debugging time because modules make it easier to isolate errors.

 v> Amendments to single modules do not affects the rest of the program.

 vi> It saves time to use modular structures rather than using self-made structures.If a job can be using what is already available and known to be well tried and tested then trying out something new for the sake of trying is waste of effort.

 vii> Structured programming is a standard method , so less time is required in writing programs.

 viii> It is easier to name modules in such a way that they are easy to locate in the documentation , and consistent.

Comments

Post a Comment

Please comment.

Popular posts from this blog

Process Scheduling And Types of Process Schedular :-

        ⇰ PROCESS SCHEDULING Process Scheduling  is a task  of Operating System that schedules processes of different states like new, ready, waiting, terminated  and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time.  ⏩   Followings are some objectives of Process Scheduling :-  i > To increase the amount of users within acceptable response times.  ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and  give reference to the processes holding the key resources.      ⇰  PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and  allows multiple users to shar...
8 comments
Read more

Semaphores In Process Synchronization

   ⇰  Semaphores :-   Semaphore is actually a method or tool to prevent race condition. Race condition can cause loss of data or even deadlock situation. For prevention from these conditions, the semaphore is one of the method.  Semaphore was proposed by Dijkstra in 1965. Simaphore    is a very significant technique to manage concurrent processes.  Semaphore is useful tool in the prevention of race condition. But the use of semaphore never means a guarantee that a program is free from these problems.     Semaphore is an integer variable which is used in mutual exclusive manner by various concurrent cooperative processes in order to acheive synchronization. Hence semaphore is one of the way to achieve synchronization.  Semaphore is basically  a variable which is non-negative and shared between threads. This variable is used to solve the critical section problem and to achieve process synchronization in the multiprocess...
Post a Comment
Read more

DeadLock In Operating System

      ⇰  DEADLOCK :- As we know in a multiprogramming environment several processes may compete for a finite number of resources. If a process requests resources and if the resources are not available at that time, the process enters a state called  waiting state. Sometimes, a waiting process is never again able to change state or never out from waiting state, because the resources it has requested are held by or taken by other waiting processes before this process.This situation is called a Deadlock.     ⇰  DEADLOCK CHARACTERIZATION:- In a deadlock processes never finish executing and system resources are tied up  and also  preventing other jobs from starting. Here are some features that characterize deadlocks. A deadlock situation can arrive if the following four conditions hold simultaneously in any operating system :- 1. Mutual exclusion :- A process must hold at least one resource in a nonsharable mode so tha...
3 comments
Read more