1. If
the primal Linear Programming problem has unbounded solution, then it’s dual
problem will have
(A) feasible solution
(B) alternative solution
(C) no feasible solution at all
(D) no bounded solution at all
Answer: C
Explanation:
Unboundedness Property: If the
primal (dual) problem has an unbounded solution, then the dual (primal) problem
is infeasible
2. Given
the problem to maximize f(x), X=(x1,x2,...xn)
subject to m number of inequality constraints.
gi(x)≤bi, i=1,2.....,m
including the non-negativity constraints x≥0.
Which one of the following conditions is a
Kuhn-Tucker necessary condition for a local maxima at x’ ?
(A) ∂L(X’, λ’, S’)/∂xj = 0, j = 1,
2,...m
(B) λi’[gi(X’)-bi]
= 0, i = 1, 2,...m
(C) gi(X’)≤bi, i = 1, 2...m
(D) All of these
Answer: D
3. The
following Linear Programming problem has:
Max Z
= x1+x2
Subject to x1-x2≥0
3x1-x2≤-3
and x1, x2≥0
(A) Feasible solution
(B) No feasible solution
(C) Unbounded solution
(D) Single point as solution
Answer: B
4. Given
a flow graph with 10 nodes, 13 edges and one connected components, the number
of regions and the number of predicate (decision) nodes in the flow graph will be
(A) 4, 5
(B) 5, 4
(C) 3, 1
(D) 13, 8
Answer: B
Explanation:
Cyclomatic complexity is a software metric.
It provides a quantitative measure of the logical complexity of a program.
Cyclomatic complexity has a foundation in
graph theory and is computed in one of three ways.
1. The number of regions correspond to the
cyclomatic complexity.
2. Cyclomatic complexity V(G) for a flow
graph G, is defined as, V(G)=E-N+2
where E=Number of flow graph edges
N=Number of flow graph nodes
3. Cyclomatic complexity, V(G) for a flow
graph G, is defined as, V(G)=P+1
where P=Number of predicate nodes contained
in flow graph G.
Here, N=10,E=13
V(G)=E-N+2 = 13-10+2 = 3+2 = 5
Therefore, No of regions = 5. (According to
rule 1.)
According to rule 3, V(G)=P+1
V(G) refers to the cyclomatic complexity
which is equal to the no of regions.
5=P+1
P=5-1=4
So, the number of predicate nodes in the flow
graph is 4.
So, the number of regions and the number of
predicate nodes in the flow graph will be 5,4
5. Function
points can be calculated by
(A) UFP*CAF
(B) UFP*FAC
(C) UFP*Cost
(D) UFP*Productivity
Answer: A
Explanation:
UFP (Unadjusted Function Point)
CAF (Complexity Adjustment Factor)
Function Point FP = UFP*CAF
6. Match
the following:
List-I
a. Data coupling
b. Stamp coupling
c. Common coupling
d. Content coupling
List-II
i. Module A and Module B have shared data
ii. Dependency between modules is based on
the fact they communicate by only
passing of data.
iii. When complete data structure is passed
from one module to another.
iv. When the control is passed from one module to the middle of another.
Codes:
a b c d
(A) iii
ii i iv
(B) ii
iii i iv
(C) ii
iii iv i
(D) iii
ii iv i
Answer: B
Explanation:
Coupling: A measure
of how closely connected two routines or modules are; the strength of the
relationships between modules. Low coupling is often a sign of a
well-structured computer system and a good design.
Types of coupling
Content coupling (high) (Pathological
coupling) occurs when one module modifies the internal workings of another
module (e.g., accessing local data of another module).
Common coupling (Global
coupling) occurs when two modules share the same global data (e.g., a global
variable).
External coupling occurs when
two modules share an externally imposed data format, communication protocol, or
device interface.
Control coupling is one
module controlling the flow of another, by passing it
information on what to do (e.g., passing a
what-to-do flag).
Stamp coupling
(Data-structured coupling) occurs when modules share a composite data structure
and use only a part of it. (e.g., passing a whole record to a function that
only needs one field of it).
Data coupling occurs when
modules share data through, for example, parameters. (e.g., passing an integer
to a function that computes a square root).
Message coupling (low): This
is the loosest type of coupling. It can be achieved by state decentralization
(as in objects) and component communication is done via parameters or message
passing.
7. A
process which defines a series of tasks that have the following four primary
objectives is known as
1. to identify all items that collectively
define the software configuration.
2. to manage changes to one or more of these
items.
3. to facilitate the construction of
different versions of an application.
4. to ensure that software quality is maintained
as the configuration evolves over time.
(A) Software Quality Management Process
(B) Software Configuration Management Process
(C) Software Version Management Process
(D) Software Change Management Process
Answer: B
8. One
weakness of boundary value analysis and equivalence partitioning is
(A) they are not effective.
(B) they do not explore combinations of input
circumstances.
(C) they explore combinations of input
circumstances
(D) none of the above
Answer: B
9. Which
one of the following is not a software myth?
(A) Once we write the program and get it to
work, our job is done.
(B) Project requirements continually change,
but change can be easily accommodated
because software is flexible.
(C) If we get behind schedule, we can add
more programmers and catch up.
(D) If an organization does not understand
how to control software projects internally, it
will invariably struggle when it outsources
software projects.
Answer: D
10. Match
the following with respect to relationship between objects and classes:
List-I
a. State diagram
b. Object diagram
c. Class diagram
d. Instance diagram
List-II
i. Useful for both abstract modelling and for
designing actual program.
ii. Describes object classes.
iii. Useful for documenting test cases.
iv. Describing the behaviour of a single
class of objects.
Codes:
a b c d
(A) iv
i ii iii
(B) ii
iii iv i
(C) iii
iv ii i
(D) ii
iv i iii
Answer: A
0 Comments