Q.1
____________ is a software analysis method used to identify structural units in code under test.
  • a) Linear code sequence and jump
  • b) State coverage
  • c) Lossless packs
  • d) Linear jumps
Q.2
LCSAJ stands for _______________
  • a) Loading Code standard as Jumps
  • b) Linear code sequence and jump
  • c) Loading code sequence and jump
  • d) Linear coverage sequence and jump
Q.3
The JJ in JJ-path stands for ___________
  • a) Just Jump
  • b) Jump-in-JUnit
  • c) Java-JUnit
  • d) Jump-to-Jump
Q.4
In a narrower sense, LCSAJ is also called ____________
  • a) JJ-Path
  • b) Code Coverage
  • c) System Code Analysis
  • d) Code Breakdown
Q.5
______________________ is the most common and least efficient debugging technique.
  • a) Brute force debugging
  • b) Backtracking
  • c) Cause elimination
  • d) Program slicing
Q.6
An effective method for locating errors in small programs is to ___________ the incorrect results through the logic of the program until the point where the logic went astray is found.
  • a) Search
  • b) Backtrack
  • c) Slice
  • d) Eliminate
Q.7
__________ involves the use of induction or deduction and introduces the concept of binary partitioning.
  • a) Brute force debugging
  • b) Backtracking
  • c) Cause elimination
  • d) Program slicing
Q.8
________________ is the computation of the set of programs statements.
  • a) Brute force debugging
  • b) Backtracking
  • c) Cause elimination
  • d) Program slicing
Q.9
The point at which the program slice affects the values at some point of interest is __________
  • a) Slicing criterion
  • b) Program criterion
  • c) Sliced Parts criterion
  • d) Information flow control
Q.10
Program slicing can be used in ______________ to locate source of errors more easily.
  • a) Testing
  • b) Coding
  • c) Debugging
  • d) Checking
0 h : 0 m : 1 s