QTP Script Use Run And Results - Kapil Sharma

QTP CheckPoints-1

Training Session: H.P-QTP 11.0: Class 2.1. (Working-Part 1) - Kapil Sharma

Training Session: H.P-QTP 11.0: Class 2.1. (Working-Part 1)

Now, our trial QTP 11.0 application test tool installed on Win-7 PC based on Oracle Virtual Box.

It's time to start this test tool and see what we can do with this tool. 

I will create separate blog labels and YouTube training clips for each function's for this test automation tool. 

So, let us start the QTP-11.0. 

Training Session: H.P-QTP 11.0: Class 1.2 (Installation-Part2) - Kapil Sharma

Training Session: H.P-QTP 11.0: Class 1.2 (Installation-Part2)

1.) Click QuickTest Professional Setup to start the QuickTest Professional Setup program.  

     This will install the QTP 11.0 application tool on user window PC. 

2.) These are some screen-shots during installation, user will observed during installation. 

Training Session: H.P-QTP 11.0: Class 1.1 (Installation-Part1)

H.P-QTP 11.0: Class 1.1 (Installation-Par1)

Prerequisites:
1.) Win-7 OS (http://windows.microsoft.com/en-us/windows7/get-know-windows-7)
2.) Oracle Virtual Box (https://www.virtualbox.org/)
3.) QTP 11.0 Trail Version
     (http://www8.hp.com/us/en/software-solutions/software.html?compURI=1172957#)

Steps for downloading QTP 11.0 trial version : 
1. From Trials and Demos > HP QTP Essentials 11.0 English Valuation. (Web GUI testing only)
2. Fill out the form, if required.
3. Select download option for QTP trial version.

Quick Test Professional 11 Introduction: 
http://merc-training.cce.hp.com/online/ITByArt-SAMPLES/QTP01IT-110%20SAMPLE/QuickTest_Pro_Sample/website/xml/content/a9157633c/index.xml

Test cases design techniques:

These are the following test case design techniques. 

A.) Boundary Value Analysis. (BVA)

B.) Error Guessing.

C.) Equivalence Class Partition. (ECP)  

D.) Cause-Effect Graph Analysis. (CEG)

Cyclometric complexity of a software:

It's a metric to measure the software (logic) complexity. 

Formula:--> E-N+2, where 'E' is no.of edges and 'N' is number of nodes.