B. All of the mentioned

C. Inheritance

D. Aggregation

A. instance

B. object

C. case

A. Level-1 DFD

B. All of the mentioned

D. Level-2 DFD

A. Aggregation

B. All of the mentioned

C. Dependency

B. in Parallel

C. sequentially

D. none of the mentioned

A. Logical file

C. Physical file

D. Data Structure

A. Data Store

C. All of the mentioned

D. Data Process

B. All of the mentioned

C. SDD

D. None of the mentioned

B. Checking whether DFDs are balanced or not

C. All of the mentioned

D. Maintaining the data dictionary

B. Top-down decomposition approach

C. Graphical representation of results using DFDs

D. Divide and conquer principle

A. Transformation of a textual problem description into a graphic model

B. All of the mentioned

C. Functional decomposition

A. None of the mentioned

B. Structured Analysis (SA)

C. Detailed Design (DD)

A. Active Object

B. None of the mentioned

D. Multiple instance

A. five

B. one

D. three

A. Wirfs-Brock method

B. Coad and Yourdon method

D. Rumbaugh method

A. Objects may be

B. erstood as stand-alone entities

C. Easier maintenance

E. Objects are potentially reusable components

A. operations that monitor an object for the occurrence of a controlling event

B. operations that perform a computation

C. operations that manipulate data in some way

A. Triangle

B. Arrow

D. Rectangle

A. XML

C. SGML

D. HTML

B. OOD is concerned with developing an object-oriented system model to implement requirements

C. None of the mentioned

D. OOA is concerned with developing an object model of the application domain

A. Objects encapsulate state and representation information

C. Objects are abstractions of real-world

D. All of the mentioned

A. Maintains the data dictionary

B. Checks whether DFDs are balanced or not

D. Support structured analysis and design (SA/SD)

A. DeMarco and Yourdon methodology

B. Gane and Sarson methodology

D. Constantine and Yourdon methodology

A. None of the mentioned

C. Transform

D. Function

B. Sub Class

C. Class

D. Super Class

A. Protocol Description

B. Implementation Description

C. Type Description

A. None of the mentioned

B. PROC

C. PRIVATE

A. Polymorphism

B. Abstract Classes

C. Encapsulation

A. A function such as search-book is represented using a circle

B. Functions represent some activity

D. Function symbol is known as a process symbol or a bubble in DFD

A. Stamp Coupling

B. Content Coupling

C. Control Coupling

A. Control Coupling

B. Content Coupling

D. External Coupling

B. None of the mentioned

C. All of the mentioned

D. Cohesion

A. Project managers

C. Technical writers

D. Programmers

A. Temporal Cohesion

B. Sequential Cohesion

C. Functional Cohesion

B. Program flowchart

C. Module

D. Data-flow diagram

B. Classes

C. Functions

D. Sub procedures

A. Object oriented analysis

B. Object oriented design

C. Structured approach

A. Module can use other modules

C. Modules are robust

D. Modules Can be separately compiled and stored in a library

A. A List

C. A plan

D. Sequential structure

A. Systems analysis

B. Project design

D. Installation

B. Maintenance and Evaluation

C. Analysis

D. Design

B. Analysis

C. Design

D. Development and Documentation

B. None of the mentioned

C. It consists of module definitions

D. Modules support functional abstraction

B. Efficiency

C. Complexity

D. Accuracy

A. Architecture

B. Interface

C. Data

A. Functional Cohesion

B. Sequential Cohesion

C. Functional Cohesion

A. Stamp Coupling

C. Control Coupling

D. Content Coupling

A. flowchart

C. documentation

D. design

A. Temporal Cohesion

C. Logical Cohesion

D. Functional Cohesion

A. creating program code

B. identifying the task to be computerized

D. creating the algorithm