--%>
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 Passing by value Passing by

    Passing by value: In this process separate memory builds for formal arguments and when any modifications done on formal variables, it will not influence the real variables. Therefore actual variables are preserved in this situation.

    		•
  • Q : What are the major issues related with

    What are the major issues related with multiprocessor caches and how might you resolve them?

    		•
  • 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 : Explain Enumerated type Enumerated type

    Enumerated type: A data type-not directly accessible in Java - in which symbolic names are employed for a series of constant numeric values. They facilitate the evading of magic numbers. They can be simulated in the Java with fields i

    		•
  • Q : Source and listener What do you mean by

    What do you mean by the term source and listener?

    		•
  • Q : What is Big-endian Big-endian : This is

    Big-endian: This is a common difference among machines, the order in which they store individual bytes of multi-byte numerical data. Big-endian machine stores the higher-order bytes previous to the lower-order bytes.

    		•
  • Q : Define the term Address space Define

    Define the term Address space: The region of virtual memory in which a procedure is run.

    		•
  • Q : What is First in-first out First in,

    First in, first out: It is FIFO semantics of the queue data structure. Items are eliminated in the order in which they arrived in the queue; therefore older items are always eliminated before newer ones.

    		•
  • Q : What is an Arithmetic expression

    Expression: It is a combination of operands and operators which generates a resultant value. Expressions contain a resulting type that affects the context in which they might be employed.

    		•
  • Q : What is Stepwise refinement Stepwise

    Stepwise refinement: It is a divide and conquer approach to the programming, in which a complicated problem is recursively divided into smaller, sub-problems and more manageable. This approach to program design is frequently employed with structured p

    		•