Scribd
Upload
27 views

Structure (D) Procedure

Modularity is the fundamental characteristic of computer software that allows decomposition into separate, independent parts [QUESTION 3]. Flowcharts and pseudocode can be used to specify algorithms through a step-by-step process [QUESTION 4]. Data flow diagrams are used to specify data streams and data stores [QUESTION 5]. The modular hierarchy of a program is also known as its program structure [QUESTION 6]. Dynamic models address the behavioral aspects of a program's architecture [QUESTION 7]. Vertical partitioning is often called factoring [QUESTION 8]. The principle of information hiding suggests that modules can be characterized by design decisions that are hidden from all other modules [QUESTION 9]. Modularity is a fundamental characteristic of computer software [QUESTION 10].

Uploaded by

Thison 2k
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
27 views

Structure (D) Procedure

Modularity is the fundamental characteristic of computer software that allows decomposition into separate, independent parts [QUESTION 3]. Flowcharts and pseudocode can be used to specify algorithms through a step-by-step process [QUESTION 4]. Data flow diagrams are used to specify data streams and data stores [QUESTION 5]. The modular hierarchy of a program is also known as its program structure [QUESTION 6]. Dynamic models address the behavioral aspects of a program's architecture [QUESTION 7]. Vertical partitioning is often called factoring [QUESTION 8]. The principle of information hiding suggests that modules can be characterized by design decisions that are hidden from all other modules [QUESTION 9]. Modularity is a fundamental characteristic of computer software [QUESTION 10].

Uploaded by

Thison 2k
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

3.

_____________is the fundamental


characteristic of computer software that
permits decomposition.

(a) Aesthetics (b) Modularity (c)


Structure (d) Procedure

4. A step - by - step specification for an


algorithm can be provided by ___________

(a) Flowchart (b) Pseudocode


(c)Structured English (d)DFD

5. Data streams and data stores can be specified


using _______________
(a)DFD (b) ERD (c) WBS
(d)Structure charts

6. ___________hierarchy is also called program


structure.

(a) Control (b) Functional (c)


Modular (d) Event

7. _______________models address the


behavioral aspects of the program architecture.

(a) Static (b) Dynamic (c) Scalar


(d) Vector

8. Vertical partitioning is often called


as_______________
(a) Factoring (b) Data structure (c)
Cohesion (d) Coupling

9. The principle of ____________suggests that


the modules can be characterized by design
decisions that hides from all other.

(a) information Hiding (b) inheritance


(c) abstraction (d)extraction

10. _____________ is a fundamental


characteristic of computer software

(a) Information hiding (b) Structure (c)


Abstraction (d) Modularity

11. ____________ provide a mechanism for


recording complex decision logic
(a) Data flow diagram (b) Structured chart
(c) Decision tables (d) Pseudo code

12. Enumerated values are denoted by


_____________
(a) identifier (b) discrete types (c)
data type (d) constants
13. Type checking is classified in to
_____________types.
(a) three (b) six (c) five
(d) four
14. Automatic type coercion is utilized in the
______________ programming Language
(a) APL (b) LISP (c) SNOBOl (d)
PL/1
15. FORTRAN permits __________ operations
between similar data types
(a) automatic (b) mixed mode (c) type
less (d) type
16. An enumeration type is defined by listing
the set of values for ____________
(a) Class (b) Function (c) Object
(d) Base class
17. ________________ values are denoted by
identifiers and character literals
(a) Enumeration Types (b) Data types
(c) Arrays (d) Coding
18. _______________ provides only one
instance of an entity
(a) Data Abstraction (b) Data
hiding
(c) Data Encapsulation (d) Data
Overriding

19. _____________ is an event that suspends


normal execution of the program
(a) Execution b) Exception (c) Event –
driven (d) Compilation
20. Step-wise refinement is ______________
(a) bottom up technique (b)
top down technique
(c) architectural design (d) unit
testing

UNIT – IV

You might also like