41.
Which of the following statements is/are TRUE
regarding JAVA?
(a)
Constants that cannot be changed are declared using the ‘static’ keyword.
(b) A class
can only inherit one class but can implement multiple interfaces.
Code :
(1) Only (a)
is TRUE.
(2) Only (b)
is TRUE.
(3) Both (a)
and (b) are TRUE.
(4) Neither
(a) nor (b) is TRUE.
Answer: 2
42. What
is the output of the following JAVA program?
Class Test
{
public
static void main (String [ ] args)
{
Test
obj = new Test ( );
obj.start
( );
}
void
start ( )
{
String
stra=”do”;
String
strb = method (stra);
System.out.print(“:”
+ stra + strb);
}
String
method (String stra)
{
stra=stra+”good”;
System.out.print
(stra);
return
“good”;
}
}
(1) dogood :
dogoodgood
(2) dogood :
gooddogood
(3) dogood :
dodogood
(4) dogood :
dogood
Answer: 4
43. Statistical
software quality assurance in software engineering involves ................
(1) using
sampling in place of exhaustive testing of software.
(2)
surveying customers to find out their opinions about product quality.
(3) tracing
each defect to its underlying cause, isolating the vital few causes, and moving
to correct them.
(4) tracing
each defect to its underlying causes, and using the Pareto principle to correct
each problem found.
Answer: 3
44. Which
of the following statements is/are FALSE with respect to software testing?
S1 :
White-box tests are based on specifications; better at telling whether program
meets specification, better at finding errors of ommission.
S2 :
Black-box tests are based on code; better for finding crashes, out of bounds
errors, file not closed errors.
S3 : Alpha
testing is conducted at the developer’s site by a team of highly skilled
testers for software that is developed as a product to be used by many
customers.
(1) Only S1
and S2 are FALSE.
(2) Only S1
and S3 are FALSE.
(3) Only S2
and S3 are FALSE.
(4) All of
S1, S2, and S3 are FALSE.
Answer: 1
45. A
signal processor software is expected to operate for 91.25 days after repair,
and the mean software repair time is expected to be 5 minutes. Then, the
availability of the software is :
(1) 96.9862%
(2) 97.9862%
(3) 98.9962%
(4) 99.9962%
Answer: 4
46. Consider
the method mcq ( ) :
int mcq
(boolean a, boolean b, boolean c, boolean d)
{
int
ans=1;
if
(a) {ans = 2;}
else
if (b) {ans = 3;}
else
if (c) {
if
(d) {ans=4;}
}
return
ans ;
}
If
M1 = Number
of tests to exhaustively test mcq ( );
M2 = Minimum
number of tests to achieve full statement coverage for mcq ( ); and
M3 = Minimum
number of tests to achieve full branch coverage for mcq ( );
then (M1,
M2, M3) = ....................
(1) (16, 3,
5)
(2) (8, 5,
3)
(3) (8, 3,
5)
(4) (16, 4,
4)
Answer: 1
47. A
simple stand - alone software utility is to be developed in ’C’ programming by
a team of software experts for a computer running Linux and the overall size of
this software is estimated to be 20,000 lines of code. Considering (a, b) =
(2.4, 1.05) as multiplicative and exponention factor for the basic COCOMO
effort estimation equation and (c, d)=(2.5, 0.38) as multiplicative and
exponention factor for the basic COCOMO development time estimation equation,
approximately how long does the software project take to complete?
(1) 10.52
months
(2) 11.52
months
(3) 12.52
months
(4) 14.52
months
Answer: 2
48. In
Software Configuration Management (SCM), which of the following is a use-case
supported by standard version control systems?
(a) Managing
several versions or releases of a software
(b) Filing
bug reports and tracking their progress
(c) Allowing
team members to work in parallel
(d)
Identifying when and where a regression occurred
Code :
(1) Only
(a), (c), and (d)
(2) Only
(a), (b), and (c)
(3) Only
(a), (b), and (d)
(4) Only
(b), (c), and (d)
Answer: 1
49. Consider
the following four processes with the arrival time and length of CPU burst
given in
milliseconds
:
Process
Arrival Time Burst Time
P1 0
8
P2 1
4
P3 2
9
P4 3
5
The average
waiting time for preemptive SJF scheduling algorithm is .................
(1) 6.5 ms
(2) 7.5 ms
(3) 6.75 ms
(4) 7.75 ms
Answer: 1
50. Consider
a virtual page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0,
1, 7, 0, 1. Suppose a demand paged virtual memory system running on a computer
system such that the main memory has 3 page frames. Then ................. page
replacement algorithm has minimum number of page faults.
(1) FIFO
(2) LIFO
(3) LRU
(4) Optimal
Answer: 4
0 Comments