--%>
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 : What are the examples of microkernel

    What are the examples of microkernel?

    		•
  • Q : Define Capability Normal 0 false false

    Normal 0 false false

  • Q : Perform Exception Handling with

    On occasion, some of Brewbean’s customers mistakenly leave an item out of a basket already checked out, therefore they create a new basket containing the missing items. Though they request that the baskets be combined and hence they are not charged extra shippin

    		•
  • Q : Explain the term an XHTML element

    Explain the term an XHTML element attribute.

    		•
  • Q : Define Arithmetic operator Arithmetic

    Arithmetic operator: The Operators, like +, -, *, / and %, which generate a numerical outcome, as a part of an arithmetic expression.

    		•
  • Q : Define Finite State Machines Finite

    Finite State Machines : A Finite State Machine (FSM) is one of the most suitable models for formal checks, especially for concurrent systems. However, FSMs can have problems with inheritance (the state model can change in derived classes) if state asp

    		•
  • Q : "this" pointer is different from a

    		•
  • 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 : What is an Attribute Attribute : It is

    Attribute: It is a particular usage of an instance variable. The set of attribute values held in a specific instance of a class state the current state of that instance. A class definition might impose specific constraints on the valid states of its i

    		•
  • Q : Define the term Swizzling Define the

    Define the term Swizzling: It is the process of recursively writing the contents of an object through object serialization.

    		•