Modularity, abstraction, and modelling, Programming Languages

Assignment Help:

Modularity, Abstraction, and Modelling

Whether proving a theorem by creating up from lemmas to simple basic theorems to more accurate results, or designing a circuit by creating up from elements to modules to complex processors, or designing a software system by making up from generic functions to classes to class libraries, humans operates  with  complexity by exploiting the power of modularity and abstraction. Without such functions, a single person could be overwhelmed by the complexity of a machine, as there is only so much information that a one person can consciously manage at a time.

 

Modularity is the concept  of creating components that  may be re-used; and  abstraction is the concept that  after  preparing a module,  most  of the  information  of the module construction may be ignored and  a simpler description given  for module communication.

 

Given  simple  modules, one  may move  up  a level  of abstraction and  create a new  module by having together various  previously-create modules, thinking only  of their  abstract information, and  not their  implementations. And, of course, this function may be repeated over several stages. This function provides one the ability to construct machine with complexity far beyond what would be possible if it were important to understand every element in detail.

 

Any module may be defined in a large number of types.   We might illustrate the circuitry in a digital watch in parts of how it works as a clock and a stopwatch, or in terms of currents and voltages within the circuit, or in terms of the heat given at different types of the circuitry. Each of these is a different kind of model of the watch.  Different models will be important for different tasks: there is no single correct operation.  Rather, every model exposes different dimensions of the machine, allowing us to explore different aspects of the design space of a machine, and to sell off different factors in the performance of a machine.

 


Related Discussions:- Modularity, abstraction, and modelling

Visual logic, how much it will cost? i need learn how to make rightsided tr...

how much it will cost? i need learn how to make rightsided triangle in forloop

Program for a single new-line character, The following function calls suppo...

The following function calls supposedly write a single new-line character, but some are incorrect. Identify which calls don't work and explain why.     printf("%c", '\n');

Language-integrated query, Language-Integrated Query Language integrated qu...

Language-Integrated Query Language integrated query (LINQ, obvious "link") is a Enthusiasm .NET Structure element that contributes ancient data querying abilities to .NET dialects,

Define a prolog predicate flatten, Define a Prolog predicate flatten(List, ...

Define a Prolog predicate flatten(List, FlattenedList) that asserts List is any nested list of atoms and FlattenedList is the same list with the nesting removed. The atom [] should

Create xml document to save calendar information, Prepare an XML document t...

Prepare an XML document that contains calendar information such as the following text describes: The calendar is owned by a person (e.g. John Smith) and has a few paragraphs tha

Looping, You are required to develop a program that calculates the charges ...

You are required to develop a program that calculates the charges for DVD rentals, where current release cost RM3.50 and all others cost RM2.50. If a customer rents several DVDs, e

Assembly language coding, i need a coding to glow 8 LEDs on a port with pwm...

i need a coding to glow 8 LEDs on a port with pwm effect

Write the html code to bind this xml data, Question: (a) (i) Describe w...

Question: (a) (i) Describe what an XML Data Island is and outline the restrictions of using a Data Island. (ii) The following XML file book.xml is used to keep track of a l

Robot factory game, A deterministic finite automaton (DFA) is an abstract m...

A deterministic finite automaton (DFA) is an abstract machine that reads input from a serial (nonreversible) stream and changes between a finite number of  states according to the

Define the procedures cons, Show that we can represent pairs of nonnegative...

Show that we can represent pairs of nonnegative integers using only numbers and arithmetic operations if we represent the pair a and b as the integer that is the product 2 a 3 b .

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