Paper 2 CS · UNIT 05 · MOCK TEST

System Software and Operating System — Mock Test 9

25 questions · about 30 minutes. Press End Mock any time to see your score and the correct answers.

0 / 25 answered 00:00

Q1. For the page reference string 4, 3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5, the number of page faults with LRU page replacement and 3 frames is

A6 B8 C10 D12

Q2. Match List I with List II.
Choose the correct answer from the options given below:

List I	List II
A. Activation record	I. Linker loader
B. Location counter	II. Garbage collection
C. Reference count	III. Subroutine call
D. Address relocation	IV. Assembler

AA-III, B-IV, C-II, D-I BA-IV, B-III, C-I, D-II CA-IV, B-III, C-II, D-I DA-II, B-III, C-I, D-IV

Q3. Match List I with List II.
Choose the correct answer from the options given below:

List I	List II
A. Least frequently used	I. Memory is distributed among processors
B. Critical section	II. Page replacement policy in cache memory
C. Loosely coupled multiprocessor system	III. Program section that once begun must complete execution before another processor accesses the same shared resource
D. Distributed operating system organization	IV. O/S routines are distributed among available processors

AA-III, B-II, C-IV, D-I BA-I, B-II, C-III, D-IV CA-II, B-III, C-I, D-IV DA-II, B-I, C-III, D-IV

Q4. Match List I with List II.
Choose the correct answer from the options given below:

List I	List II
A. Firmware	I. Number of logical records into physical blocks
B. Batch file	II. ASCII format
C. Packing	III. Resource allocation
D. Banker's algorithm	IV. ROM

AA-II, B-I, C-IV, D-III BA-II, B-I, C-III, D-IV CA-IV, B-II, C-I, D-III DA-IV, B-I, C-II, D-III

Q5. Match List I with List II.
Choose the correct answer from the options given below:

List I	List II
A. Stack algorithm	I. Deadlock
B. Elevator algorithm	II. Disk scheduling
C. Priority scheduling	III. Page replacement algorithm
D. Havender's algorithm	IV. CPU scheduling

AA-III, B-II, C-IV, D-I BA-II, B-III, C-IV, D-I CA-III, B-II, C-I, D-IV DA-II, B-III, C-I, D-IV

Q6. Given below are two statements: Assertion (A) and Reason (R).
Assertion (A): A load-and-go assembler avoids the overhead of writing the object program out and reading it back in.
Reason (R): This can be done with either a one-pass or a two-pass assembler.
Choose the correct answer.

ABoth (A) and (R) are true and (R) is the correct explanation of (A) BBoth (A) and (R) are true but (R) is NOT the correct explanation of (A) C(A) is true but (R) is false D(A) is false but (R) is true

Q7. Test suite is consist of:

ASet of defect cases BSet of boundary cases CSet of test cases DSet of nest cases

Q8. Match List I with List II.
List I
(A) Scenario testing
(B) Regression testing
(C) Component testing
(D) Beta testing
List II
(I) To verify the I/O behavior of test object
(II) User acceptance methodology
(III) No new bugs after changes in program
(IV) The documentation of a use case

A(A)-(IV), (B)-(III), (C)-(II), (D)-(I) B(A)-(II), (B)-(I), (C)-(III), (D)-(IV) C(A)-(IV), (B)-(III), (C)-(I), (D)-(II) D(A)-(III), (B)-(I), (C)-(IV), (D)-(II)

Q9. ________ is intended to show that a system both conforms to its specifications and meets the expectations of the system customer.

ASoftware specification BSoftware design CSoftware evaluation DSoftware validation

Q10. For a function of two variable, boundary value analysis yields.

A4n + 3 test cases B4n + 1 test cases Cn + 4 test cases D2n + 4 test cases

Q11. Fault-based testing technique is

AUnit testing BBeta testing CStress testing DMutation testing

Q12. Which of the following is/are behavioral testing technique(s)?
(A) Equivalence Partitioning
(B) Graph-Based Testing Method
(C) Boundary Value Analysis
(D) Data flow Testing
(E) Loop Testing
Choose the correct answer from the options given below:

A(B) and (D) only B(A), (B) and (C) only C(D) and (E) only D(A), (C) and (E) only

Q13. Software validation mainly checks for inconsistencies between:

AUse cases and user requirements BImplementation and system design blueprints CDetailed specifications and user requirements DFunction specifications and use cases

Q14. In the context of software testing, which of the following statements is/are NOT correct?
P: A minimal test set that achieves 100% path coverage will also achieve 100% statement coverage.
Q: A minimal test set that achieves 100% path coverage will generally detect more faults than one that achieves 100% statement coverage.
R: A minimal test set that achieves 100% statement coverage will generally detect more faults than one that achieves 100% branch coverage.
Choose the correct answer from the options given below:

AR only BQ only CP and Q only DQ and R only

Q15. Consider the following statements:
S1: White-box tests are based on specifications; better at telling whether program meets specification, better at finding errors of omission.
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.
Which of the following is correct?

AOnly S1 and S2 are FALSE. BOnly S1 and S3 are FALSE. COnly S2 and S3 are FALSE. DS1, S2 and S3 all are FALSE.

Q16. 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;
}

Let M1 = number of tests to exhaustively test mcq(), M2 = minimum number of tests to achieve full statement coverage, and M3 = minimum number of tests to achieve full branch coverage. Then the value of (M1, M2, M3) is:

A(16, 3, 5) B(8, 3, 5) C(16, 4, 5) D(8, 4, 5)

Q17. What is the normal order of activities in which traditional software testing is organised?
1. Integration Testing
2. System Testing
3. Unit Testing
4. Validation Testing

A3, 1, 2, 4 B3, 1, 4, 2 C4, 3, 2, 1 D2, 4, 1, 3

Q18. Which of the following testing techniques ensures that the software product runs correctly after the changes during maintenance?

APath Testing BIntegration Testing CUnit Testing DRegression Testing

Q19. Which of the following statement(s) is/are TRUE with regard to software testing?
I. Regression testing technique ensures that the software product runs correctly after the changes during maintenance.
II. Equivalence partitioning is a white-box testing technique that divides the input domain of a program into classes of data from which test cases can be derived.

Aonly I Bonly II Cboth I and II Dneither I nor II

Q20. For a program of k variables, boundary value analysis yields ______ test cases.

A4k – 1 B4k C4k + 1 D2k – 1

Q21. The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes, is: [where P is the number of predicate nodes in the flow graph V(G)]

AP + 1 BP – 1 CP – 2 DP + 2

Q22. In software testing, how are error, fault and failure related to each other?

AError leads to failure but fault is not related to error and failure BFault leads to failure but error is not related to fault and failure CError leads to fault and fault leads to failure DFault leads to error and error leads to failure

Q23. Verification:
(A) refers to the set of activities that ensure that software correctly implements a specific function
(B) gives answer to the question – Are we building the product right?
(C) requires execution of software

Arefers to the set of activities that ensure that software correctly implements a specific function Bgives answer to the question – Are we building the product right? Crequires execution of software DBoth (A) and (B)

Q24. In which testing strategy are the requirements established during requirements analysis validated against the developed software?

AValidation testing BIntegration testing CRegression testing DSystem testing

Q25. Arrange the following levels of interrupt protection within the Linux Kernel in order of increasing priority:
(A) user mode programs
(B) bottom half interrupt handlers
(C) kernel system service routines
(D) top half interrupt handlers

A(A), (B), (D), (C) B(A), (C), (B), (D) C(A), (C), (D), (B) D(D), (A), (C), (B)