Modular programming, Computer Engineering

Assignment Help:

Modular programming denotes to the practice of writing a program as a sequence of independently assembled source files. Every source file is a modular program intended to be assembled in a separate object file. Every object file constitutes a module. The linker collects the modules of a program in a coherent whole.

There are various reasons a programmer may choose to modularise a program.

1.  Modular programming allows breaking a large program in a number of smaller modules each one of more manageable size.

2. Modular programming makes possible to link source code written in two separate languages. A hybrid program written partly in assembly language and partly in higher level language necessarily involves at least one module for each language involved.

3. Modular programming enables for creation, maintenance as well as reuse of a library of generally used modules.

4.  Modules are easier to grasp.

5.  Different modules may be assigned to different programs.

6.  Debugging and testing may be done in a more orderly fashion.

7.  Document action can be easily understood.

8.  Modifications can be localised to a module.

A modular program can be signified using hierarchical diagram:

1326_MODULAR PROGRAMMING.png

The main advantages of modular programming are:

1.  Easier, smaller modules to manage

2.  Code repetition can be avoided by reusing modules.

We can split a program into subroutines or procedures. We need to CALL the procedure whenever needed. A subroutine call handovers the control to subroutine instructions and brings the control back to calling program.


Related Discussions:- Modular programming

Which function type is used for using "at exit-command", Which Function typ...

Which Function type has to be used for using "at exit-command" ? To Use AT EXIT - COMMAND, We must assign a function Type "E" to the relevant function in the MENU Painter OR S

Instruction per cycle in RISC, Q. Instruction per cycle in RISC? One in...

Q. Instruction per cycle in RISC? One instruction per cycle: A machine cycle is total time taken to fetch two operands from registers perform ALU operation on them and store re

Your worksheet and organizing the data, You presently work for an automotiv...

You presently work for an automotive parts supply store. Your company is growing, and is considering expansion. The company presently has three locations (North, South, and Central

What is the difference among declaration and definition, The declaration te...

The declaration tells the compiler that at some later point we plan to show the definition of this declaration. E.g.: void stars () //function declaration The definition con

What is non-repudiation, What is non-repudiation? Non Repudiation: Assu...

What is non-repudiation? Non Repudiation: Assurance that the sender is given with proof of delivery and that the recipient is provided with proof of the sender's identity so th

What are delay systems in telecommunication networks, What are delay system...

What are delay systems in telecommunication networks? Delay System: A class of telecommunication networks like data a network that places the call or message arrivals in a qu

Describe the types of flip-flops and latches, Describe the types of flip-fl...

Describe the types of flip-flops and latches. Flip-flops are of two types as illustrated below: a. Positive edge triggered b.  negative edge triggered Latches are

What are the variations in a fast adder, a. Design a fast adder. What are t...

a. Design a fast adder. What are the variations in a fast adder? b. Define how the virtual address is changed into real address in a paged virtual memory system. Give an example

Illustrate about packet switching, Q. Illustrate about Packet switching? ...

Q. Illustrate about Packet switching? Packet switching is used to avoid long delays in transmitting data over the network. Packet switching is a technique that limits the amoun

Design odd-even transposition algorithm, Q. Design Odd-Even Transposition A...

Q. Design Odd-Even Transposition Algorithm? Algorithm: Odd-Even Transposition for I=1 to N     {            If (I%2 != 0) //i.e. Odd phase            {

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd