MCQs and Quiz on Software Engineering for Jobs, Subject Specialists, FPSC, PPSC, NWFP PSC, BPSC and all other Jobs
In a particular program, it is found that 1% of the code accounts for 50% of the execution time. To code the program in FORTRAN, it takes 100 man-days. Coding in assembly language is 10 times harder than coding FORTRAN, but runs 5 times faster. Converting an existing FORTRAN program to an assembly language program is 4 times harder.
If aweightage of 3 is given to the programmers effort and a weightage of 2 is given to the execution time, then coding 99% in FORTRAN and the 1% in assembly language performs better than coding in FORTRAN completely and rewriting the 1% in assembly language by a factor of about
Option 1
|
1.2 |
Option 2
|
1.3 |
Option 3
|
1.6 |
Option 4
|
It does not perform better |
A good specification should be
Option 1
|
distinctly specific |
Option 2
|
functional |
Option 3
|
unambiguous |
Option 4
|
All of these |
Information hiding is to hide from user, details
Option 1
|
that are not relevant to him |
Option 2
|
that are relevant to him |
Option 3
|
that are confidential |
Option 4
|
that may be maliciously handled by him |
Which of the following comments about object oriented design of software, it not true?
Option 1
|
Objects inherit the properties of the class |
Option 2
|
An object can belong to two classes |
Option 3
|
Classes are defined based on the attributes of objects |
Option 4
|
Classes are always different |
Structured programming codes include
Option 1
|
alteration, iteration |
Option 2
|
sequencing |
Option 3
|
All of these |
Option 4
|
None of these |
Which of the following is a desirable property of a module?
Option 1
|
Low cohesiveness |
Option 2
|
Independency |
Option 3
|
High coupling |
Option 4
|
Multi functional |
Which of the following types of maintenance takes the maximum chunk of the total maintenance effort in a typical life cycle of a software product?
Option 1
|
Perfective maintenance |
Option 2
|
Preventive maintenance |
Option 3
|
Corrective maintenance |
Option 4
|
Adaptive maintenance |
Let M be a node that represents a if –then –else node in a Program Graph. Let the number of paths from its if part to the end node is y, and from the else part to the end node is z. if the number of paths form the start node to the node M is x, then the total number of paths through M is
Option 1
|
x( y + z ) |
Option 2
|
x y + z |
Option 3
|
x z +y |
Option 4
|
x +y + z |
Assuming the existence of a start and end nodes for a program graph, the total number of paths is equivalent to the ____________set of test data required to test the software.
Option 1
|
supremum |
Option 2
|
minimum |
Option 3
|
maximum |
Option 4
|
optimum |