--%>

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 Stack trace Define the

    Define the term Stack trace: It is a display of the runtime stack.

  • Q : What is an Assembly language Assembly

    Assembly language: This is a symbolic language closely analogous to the instruction set of a Central Processing Unit. The program employed to translate a program written in assembly language is termed an assembler.

  • Q : Define Homology Modeling In Structural

    Homology Modelling is a process in which models are generated. The generated models may be conceptual or graphical or/and mathematical.So, we have different methods, tools and techniques for all kinds of modeling.Modelling methods are broadly classifi

  • Q : Define the term XQuery Define the term

    Define the term XQuery?

  • 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 : Explain Global variable Global variable

    Global variable: It is a phenomenon which is more generally regarded as being a trouble in structured programming languages than in object-oriented languages. In structured programming language, like C or Pascal, a global variable is one stated outsid

  • Q : Data structure appears in a COBOL

    The following data structure appears in a COBOL program used by a bureau de change:01 AUXILAIRY-ITEMS.    05 AMOUNT-REQUIRED PIC999V99.    05 SUCCESS-INDICATOR PIC 9.    88 SUCCESS VALUE 1.01 C

  • Q : Define Deprecated Deprecated : Somewhat

    Deprecated: Somewhat that has been made superseded by later on versions of the API. Deprecated methods must not be employed as there is no guarantee that they will carry on to subsist in the future versions.

  • Q : Define Formal argument Formal argument

    Formal argument: The definition of a method’s argument is the part of a method header. Each and every formal argument has an associated type. Whenever a method is called, the actual argument values are copied into the analogous formal arguments.

  • Q : What are collections and generics What

    What are collections and generics?