# CSE - Questions and solutions set-20

Computer science and engineering(CSE) - Question & solution set-20
Question:-
Option (A)
1/16
Option (B)
4/16
Option (C)
3/16
Option (D)
5/16
Correct Option:
D
Question Solution:
p(boys £ girls) = p(boys = 0) + p(boys = 1)
= 4C0(1/2)0{1-(1/2)}4 + 4C1(1/2)1 {1-(1/2)}3 = 5/16
Question:-
Option (A)
1 NF
Option (B)
2 NF
Option (C)
3 NF
Option (D)
BC NF
Correct Option:
A
Question:-
Option (A)
only 4
Option (B)
only 3
Option (C)
only 2 and 3
Option (D)
none of these
Correct Option:
D
Question Solution:
(a) For code, most commonly used measure is Lines of Code (LOC). The basic purpose of length is for effort estimation.
(b) Halstead’s length measure, measures on absolute scale.
N1 - is total operators
N2 - total operands
Length = N1 + N
Volume = N logn = No. of bits needed to store program.
Little verification of halstead’s, no one uses them and its not useful for prediction.
(c) Using LOC functionally can not be measured, for that function points is used. Function points is the best known approach. The key advantage of FP is that it can be determined from SRS.
(d) Major drawback of function point are:
1. Not repeatable
2. Not precisely known even for a built system.
Question:-
Option (A)
zx + z’x
Option (B)
z’x + zx’
Option (C)
yx’ + zx’
Option (D)
yx’ + zx
Correct Option:
B
Question:-
Option (A)
DNF-satisfiability is NP-complete
Option (B)
The post correspondence problem is decidable for strings over the alphabet {0}
Option (C)
CNF-satisfiability is not NP-complete
Option (D)
The problem of finding shortest path between any two vertices in graphs is NP-complete.
Correct Option:
B
Question Solution:
DNF-satisfiability is in P. So choice (a) is false.
CNF-satisfiability is NP-complete. So choice (c) is false.
The Djikstras algorithm is O(n2) (polynomial time) and hence is in P. So (d) is false.
Choice (b) is true.