--%>
Assignment Help - homework help

Concept of object oriented analysis with explanation

Q. Explain the concept of object oriented analysis with explanation of all steps of analysis. 

Ans. Object oriented analysis: Object oriented analysis provide a simple, yet powerful mechanism for indentifying objects, the building blocks of the software to be developed. It is mainly concerned with the decomposition of a problem into component part and establishing a logical model to describe the system.

The two general findings about OOA are:

1.      OOA fulfils the properties of analysis.

2.      OOA has a smooth transition to design model which should cover following things:

(1)         Objectives: These are the ultimate expectation for the user towards the entire information system (both computerized and manual).

(2)         Application domain knowledge: This defines the vocabulary of the application, its meaning and properties.

(3)         Requirements of the environments: This is the description of the behaviour required from the human organization to meet the objectives.

(4)         Requirements of the computer system: This is a description of the behaviour required from the computer system to meet the objectives.

 

 

   Related Questions in Programming Languages

  • Q : Define the term Assignment statement

    Define the term Assignment statement: It is a statement employing the assignment operator.

    		•
  • Q : What is an Argument Argument : It is

    Argument: It is the information passed to a method. Arguments are as well sometimes termed as parameters. The method expecting to receive arguments should contain a formal argument declaration for each as portion of its method header. Whenever a metho

    		•
  • Q : Explain different cursors types in ADO

    What are the different cursors types in ADO and illustrated them?

    		•
  • Q : Explain LURCH LURCH (Menzies et al.

    LURCH (Menzies et al. 2004) uses random search to explore a state machine’s state space. Because the search is random, it gives no guarantee that the state space has been exhaustively explored, so LURCH cannot be used for verification. However,

    		•
  • Q : Define Binary search Binary search :

    Binary search: This is a search of sorted data, in which the middle place is examined first. The search continues with either the right or the left part of the data, therefore removing half the remaining search space. This procedure is repeated at eac

    		•
  • Q : CSS and CSS3 State some of the

    State some of the difference between the CSS and the CSS3.

    		•
  • Q : Define Static nested class Static

    Static nested class: It is a nested class with static reserved word in its header. Dissimilar inner classes, objects of static nested classes contain no enclosing object. They are as well termed as nested top-level classes.

    		•
  • Q : What is Low level programming languages

    Low level programming languages: It is frequently termed as `assembly languages’; these give little more than the fundamental instruction set of a particular Central Processing Unit. Therefore programs written in low level programming languages

    		•
  • Q : Define the term Garbage collector

    Garbage collector: It is a daemon thread which recycles objects to which there are no extant references in a program.

    		•
  • Q : Scope resolution operator The scope

    		•