...QUICK TEST PROFESSIONAL 11 Table of Contents 1 Session 1 INTRODUCTION TO QTP 9.5 3 1.1 Introduction 3 1.2 Add-ins in 9.5 3 1.3 Use of Addins 3 1.4 Add-in Manager 4 1.5 Benefits of Automated Testing: 4 1.6 The 7 phases of QTP 5 1.6.1 Preparing to record 5 1.6.2 Recording a session on your application 5 1.6.3 Enhancing your test 6 1.6.4 Debugging your test 6 1.6.5 Running your test 6 1.6.6 Analysing the test results 6 1.6.7 Reporting defects 6 1.7 QTP Main Window 7 2 Recording Modes and Run Modes 11 2.1 Major steps before scripting 11 2.2 Exercise 11 2.3 Recording Modes 12 2.3.1 Normal 12 2.3.2 Analog 12 2.3.3 Low Level 14 2.4 Run Modes / Execution Modes / Playback Modes 15 2.4.1 Run Mode 15 2.4.2 Maintenance Run Mode 15 2.4.3 Update Mode 16 3 Session 3 17 3.1 Introduction 17 3.2 Object Repository Types 17 3.2.1 Local Object Repository 17 3.2.2 Shared Object Repository 18 3.2.3 How to associate Shared Repository 19 3.3 Object Repository Window 19 3.4 Exporting Local Objects to an Object Repository 20 3.5 Managing Shared Object Repository Associations: 20 3.6 Object Repository Manager 21 3.6.1 Performing Merge Operations 22 4 Section 4: SYNCHRONISING YOUR TEST 25 4.1 Synchronisation Options 25 4.1.1 Modifying Timeout Values 25 4.1.2 Adding Exist and Wait Statements 25 4.1.3 Creating Synchronisation Points 25 4.2 Exercise 26 4.2.1 Using Wait statement...
Words: 7929 - Pages: 32
...Vijay V. Vazirani College of Computing Georgia Institute of Technology Copyright c 2001 Approximation Algorithms Springer Berlin Heidelberg NewYork Barcelona Hong Kong London Milan Paris Singapore Tokyo To my parents Preface Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872–1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P = NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of approximation algorithms as it stands today. It is reasonable to expect the picture to change with time. The book is divided into three parts. In Part I we cover a combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected – nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly categorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character...
Words: 140657 - Pages: 563
...PLFS: A Checkpoint Filesystem for Parallel Applications John Bent∗† Garth Gibson‡ Gary Grider∗ Ben McClelland∗ , , , , Paul Nowoczynski§ James Nunez∗ Milo Polte† Meghan Wingate∗ , , , ABSTRACT Categories and Subject Descriptors D.4.3 [Operating Systems]: File Systems ManagementFile organization General Terms Performance, Design Keywords High performance computing, parallel computing, checkpointing, parallel file systems and IO ∗ LANL Technical Information Release: 09-02117 Los Alamos National Laboratory ‡ Carnegie Mellon University § Pittsburgh Supercomputing Center † (c) 2009 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by a contractor or affiliate of the U.S. Government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only. SC09 November 14–20, Portland, Oregon, USA. Copyright 2009 ACM 978-1-60558-744-8/09/11 ...$10.00. 100 Speedup (X) Parallel applications running across thousands of processors must protect themselves from inevitable system failures. Many applications insulate themselves from failures by checkpointing. For many applications, checkpointing into a shared single file is most convenient. With such an approach, the size of writes are often small and not aligned with file system boundaries. Unfortunately for these applications, this preferred data...
Words: 12373 - Pages: 50