LECTURE 8 TEST DESIGN TECHNIQUES - I

Similar documents
Equivalence Class Partitioning and Boundary Value Analysis -Black Box Testing Techniques

LECTURE 9 TEST DESIGN TECHNIQUES - II

UNIT-4 Black Box & White Box Testing

UNIT-4 Black Box & White Box Testing

Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

CS 424 Software Quality Assurance & Testing LECTURE 3 BASIC CONCEPTS OF SOFTWARE TESTING - I

No Source Code. EEC 521: Software Engineering. Specification-Based Testing. Advantages

Black Box Testing. EEC 521: Software Engineering. Specification-Based Testing. No Source Code. Software Testing

CS 451 Software Engineering Winter 2009

QUIZ #5 - Solutions (5pts each)

Software Testing. Software Testing. in the textbook. Chapter 8. Verification and Validation. Verification Techniques

Software Testing Prof. Rajib Mall Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur

Black-box Testing Techniques

Analysis for Testing. by: rex Black. quality matters Q3 2009

Testing & Debugging TB-1

Darshan Institute of Engineering & Technology for Diploma Studies

Chapter 9. Software Testing

Chapter 11, Testing. Using UML, Patterns, and Java. Object-Oriented Software Engineering

Discrete Structures Lecture The Basics of Counting

Introduction to Domain Testing

Testing is a very big and important topic when it comes to software development. Testing has a number of aspects that need to be considered.

Contents Introduction to RezDesk... 3 Activating your Account... 4 Logging In... 5 Editing a New Travel Profile... 6 Contact Information...

COS 226 Midterm Exam, Spring 2011

Types of Software Testing: Different Testing Types with Details

k-selection Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong

CISC-235* Test #3 March 19, 2018

Nearest Neighbor Classification. Machine Learning Fall 2017

The Specification Phase

Discrete Wiskunde II. Lecture 6: Planar Graphs

CA Test Data Manager Key Scenarios

4.7 Approximate Integration

2. You are required to enter a password of up to 100 characters. The characters must be lower ASCII, printing characters.

Lesson 16: More on Modeling Relationships with a Line

Computer Science and Software Engineering University of Wisconsin - Platteville 9-Software Testing, Verification and Validation

HASH CRACK: PASSWORD CRACKING MANUAL BY JOSHUA PICOLET DOWNLOAD EBOOK : HASH CRACK: PASSWORD CRACKING MANUAL BY JOSHUA PICOLET PDF

ASTQB Advance Test Analyst Sample Exam Answer Key and Rationale

MS&E 226: Small Data

LECTURE 11 TEST DESIGN TECHNIQUES IV

Privacy and Security in Online Social Networks Department of Computer Science and Engineering Indian Institute of Technology, Madras

HMMT February 2018 February 10, 2018

Software Testing. Lecturer: Sebastian Coope Ashton Building, Room G.18

Bureau of Water System Engineering

Concur Cliqbook Travel New User Interface

Complexity Classes and Polynomial-time Reductions

COS 226 Fall 2015 Midterm Exam pts.; 60 minutes; 8 Qs; 15 pgs :00 p.m. Name:

5 Graphs

Testing & Continuous Integration. Kenneth M. Anderson University of Colorado, Boulder CSCI 5828 Lecture 20 03/19/2010

2010 SMT Power Round

CSE 6242/CX Ensemble Methods. Or, Model Combination. Based on lecture by Parikshit Ram

Lecture-14 Lookup Functions

Software Testing CS 408

GSE Scale Systems M660 CUSTOM TRANSMIT

Functional Testing (Black Box Testing)

NOM SIMULATOR TEST PLAN. Sections. A.1 Introduction

10.2 Basic Concepts of Limits

Software Design Models, Tools & Processes. Lecture 6: Transition Phase Cecilia Mascolo

User/Phone Add Configuration

Many of the slides in this lecture are either from or adapted from slides provided by the authors of the textbook Computer Systems: A Programmer s

CS454/654 Midterm Exam Fall 2004

Lecture 15 of unit 2 on us discussed both those testing methods in test selections criteria in previous session, (Refer Slide Time: 00:23)

Software Testing. Testing 1

Finding Strongly Connected Components

CSE 403: Software Engineering, Fall courses.cs.washington.edu/courses/cse403/16au/ Unit Testing. Emina Torlak

Math 3336 Section 6.1 The Basics of Counting The Product Rule The Sum Rule The Subtraction Rule The Division Rule

Ontology Summit 2013: Ontology Evaluation Across the Ontology Lifecyle Track B: Extrinsic Aspects of Ontology Evaluation

Introduction to Algorithms April 21, 2004 Massachusetts Institute of Technology. Quiz 2 Solutions

kalmstrom.com Business Solutions

1 Minimum Spanning Tree (MST)

Theme 2 Program Design and Testing

EXTREME POINTS AND AFFINE EQUIVALENCE

HHS ENTERPRISE PORTAL

Progress from objects/ Numicon to bead string to number track to number line.

Test design: Part I. Software Testing: INF3121 / INF4121

Sample Questions ISTQB Foundation Answers

Choices for Using Wildcard Masks

Lecture 9: Linear Programming

7.0 Test Design Techniques & Dynamic Testing

Lecture 10: Introduction to Correctness

Lecture 15 Software Testing

Part 5. Verification and Validation

MEDIAZONE EVENT DISPLAY DOCUMENTATION VERSION 1.2

High Availability Options

V4 Matrix algorithms and graph partitioning

ORGANIZING THE DATA IN A FREQUENCY TABLE

Software Engineering Prof.N.L.Sarda IIT Bombay. Lecture-11 Data Modelling- ER diagrams, Mapping to relational model (Part -II)

Grade 7/8 Math Circles Graph Theory - Solutions October 13/14, 2015

CAMERA User s Guide. They are most easily launched from the main menu application. To do this, all the class files must reside in the same directory.

Assignment # 4 Selected Solutions

Verification and Validation. Ian Sommerville 2004 Software Engineering, 7th edition. Chapter 22 Slide 1

4.2 ALGORITHM DESIGN METHODS

Equivalence Class Partitioning. Equivalence Partitioning. Definition and Example. Example set of classes

Definitions. Key Objectives

Object-Oriented Software Engineering Practical Software Development using UML and Java

Chapter 3: Dynamic Testing Techniques

Software Testing. Software Testing. Theory, Practise and Reality IBM Corporation

**BEFORE YOU BEGIN: PLEASE NOTE **

Chapter 2: The Normal Distribution

CS 5803 Introduction to High Performance Computer Architecture: RISC vs. CISC. A.R. Hurson 323 Computer Science Building, Missouri S&T

A Proposed Method in Agile Practices to Create Requirements Documentation and Test Cases

14.1 Answer: 14.2 Answer: 14.3 Answer: 14.4 Answer:

Transcription:

LECTURE 8 TEST DESIGN TECHNIQUES - I EQUIVALENCE CLASS PARTITIONING: Equivalence Class Partitioning is a test case design techniques in black box testing. Equivalence partitioning is a Test Case Design Technique to divide the input data of software into different equivalence data classes. Test cases are designed for equivalence data class. The equivalence partitions are frequently derived from the requirements specification for input data that influence the processing of the test object. A use of this method reduces the time necessary for testing software using less and effective test cases. Equivalence Partitioning = Equivalence Class Partitioning = ECP It can be used at any level of software for testing and is preferably a good technique to use first. In this technique, only one condition to be tested from each partition. Because we assume that, all the conditions in one partition behave in the same manner by the software. In a partition, if one condition works other will definitely work. Likewise we assume that, if one of the conditions does not work then none of the conditions in that partition will work. Equivalence partitioning is a testing technique where input values set into classes for testing. Valid Input Class = Keeps all valid inputs. Invalid Input Class = Keeps all Invalid inputs. Let's consider the behavior of tickets in the Flight reservation application, while booking a new flight. Example 1 Let's consider the behavior of tickets in the Flight reservation application, while booking a new flight. Ticket values 1 to 10 are considered valid & ticket is booked. While value 11 to 99 is considered invalid for reservation and error message will appear, "Only ten tickets may be ordered at one time". Prepared by: Engr. M. Nadeem Page 1

Here is the test condition 1. Any Number greater than 10 entered in the reservation column (let say 11) is considered invalid. 2. Any Number less than 1 that is 0 or below, then it is considered invalid. 3. Numbers 1 to 10 are considered valid 4. Any 3 Digit Number say -100 is invalid. We cannot test all the possible values because if done, number of test cases will be more than 100.To address this problem, we use equivalence partitioning hypothesis where we divide the possible values of tickets into groups or sets as shown below where the system behavior can be considered the same. The divided sets are called Equivalence Partitions or Equivalence Classes. Then we pick only one value from each partition for testing. The hypothesis behind this technique is that if one condition/value in a partition passes all others will also pass. Likewise, if one condition in a partition fails, all other conditions in that partition will fail. Prepared by: Engr. M. Nadeem Page 2

Example 2 A text field permits only numeric characters Length must be 6-10 characters long Partition according to the requirement should be like this: At the time of testing, test 4 and 12 as invalid values and 7 as valid one. It is easy to test input ranges 6 10 but harder to test input ranges 2-600. Testing will be easy in the case of lesser test cases but you should be very careful. Assuming, valid input is 7. That means, you belief that the developer coded the correct valid range (6-10). Example 3 Prepared by: Engr. M. Nadeem Page 3

Example 4 Boundary value Analysis: In Boundary Value Analysis, you test boundaries between equivalence partitions Boundary value analysis is a test case design techniques in black box testing. Normally Boundary value analysis is part of stress and negative testing. In our earlier example instead of checking, one value for each partitions you will check the values at the partitions like 0, 1, 10, and 11 and so on. As you may observe, you test values at both valid and invalid boundaries. Boundary Value Analysis is also called range checking. For Example: Using Boundary Value Analysis technique tester creates test cases for required input field. For example; an Address text box which allows maximum 500 characters. So, writing test cases for each character once will be very difficult so that will choose boundary value analysis. Prepared by: Engr. M. Nadeem Page 4

Example 1 Suppose you have very important tool at office, accept valid User Name and Password field to work on that tool, and accept minimum 8 characters and maximum 12 characters. Valid range 8-12, Invalid range 7 or less than 7 and invalid range 13 or more than 13. Write Test Cases for Valid partition value, Invalid partition value and exact boundary value. Test Cases 1: Consider password length less than 8. Test Cases 2: Consider password of length exactly 8. Test Cases 3: Consider password of length between 9 and 11. Test Cases 4: Consider password of length exactly 12. Test Cases 5: Consider password of length more than 12. Example 2 Test cases for the application whose input box accepts numbers between 1-1000. Valid range 1-1000, Invalid range 0 and Invalid range 1001 or more. Write Test Cases for Valid partition value, Invalid partition value and exact boundary value. Test Cases 1: Consider test data exactly as the input boundaries of input domain i.e. values 1 and 1000. Test Cases 2: Consider test data with values just below the extreme edges of input domains i.e. values 0 and 999. Test Cases 3: Consider test data with values just above the extreme edges of input domain i.e. values 2 and 1001. Prepared by: Engr. M. Nadeem Page 5

Equivalence partitioning and boundary value analysis are closely related and can be used together at all levels of testing. Example 3 Example 4 Example 5 Prepared by: Engr. M. Nadeem Page 6