Question

Modularity. What does the term “modularity” mean and what does good modularity in an algorithm do for us? Define (in your own words) modularity and then give three examples of how it can be used as a powerful tool for our algorithms and ultimately our programs.

Answer 1

Modularity means dividing the functionality of an algorithm into independent, interchangeable modules, such that each contains everything necessary to execute only one aspect of the desired functionality.

Advantages

• Smaller components are easier to maintain
• Program can be divided based on functional aspects
• Desired level of abstraction can be brought in the program
• Components with high cohesion can be re-used again
• Concurrent execution can be made possible
• Desired from security aspect

Example

The spell check feature in word processor is a module of software, which runs along side the word processor itself.

Software design life cycle models are designed into several phases or modules.

Object oriented programming languages have classes and objects which is also a good example of modularity