⟩ Explain Cyclomatic complexity?
(1)The number of independent paths through a program.
(2)The cyclomatic complexity of a program is equivalent to the number of decision statements plus 1.
(1)The number of independent paths through a program.
(2)The cyclomatic complexity of a program is equivalent to the number of decision statements plus 1.
How to force WR to learn the sub-items on a menu?
How to check property of specific Icon is highlighted or not?
BitMap or GUI Checkpoints
How do you handle unexpected events and errors?
How to to get the information from the status bar without doing any activity/click on the hyperlink?
Text Field Validations
How to break infinite loop
User-defined function that would write to the Print-log as well as write to a file
the MSW_id value sometimes changes, rendering the GUI map useless
What is Boundary Test?