Defect Report

Content of Defect Report

 Defect ID = Unique Identification Number
 Defect Description
 Version – Version of application
 Date Raised –
 Reference - where in you provided reference to
the document like, Requirement, Design
 Screenshots
 Detected by : Name/Id Of the Tester
 Status : (Bug life cycle)New
 Fixed By : Name of the Developer
 Date closed –
 Severity :: Which describe the impact of the
defect on the application
 Priority :: which is related to defect fixing
urgency

Defect Classification:
Severity
 Blocker :: Problem in major flow due to which
testing cannot be continued(Application Crash)
 Critical :: Problem in major feature  (Cannot
fund Transfer)
 Major :: Any undesirable behavior(sending mail
but not receiving any notification)
 Minor :: Does not impact the functionality

The Priority – Severity Matrix

 High Priority – High SeverityLogin button not
working
 High Priority – Low Severity Wrong Logo
 Low priority – High SeverityCrashes edge of
the software
 Low priority – Low SeveritySpelling Mistake
Defect Resolution Types
Accepted :: Rejected :: Duplicate :: Enhancement :: Not
reproducible :: Fixed :: By design

Defect Bug Life Cycle

NEW  ASSIGN OPENFIXED PENDING RETEST 
RETEST VERIFIED  CLOSED
1 repeating every character twice System.out.println("First non-repeating character is "+
String str = "Javae Exercise"; int l = str.length(); ch);
String new_str = ""; for (int i = 0; i < l; i++) { break;}}}}
new_str += str.substring(i,i+1) + str.substring(i, i+1); 7 Removing duplicates
}System.out.println(new_str); String str = "vikramm"; String res="";
2 sum of the digits present in the given string for(int i =0;i<str.length();i++) {
String str1 = "dhjd8888fhffs"; char ch = str.charAt(i);
char[] c = str1.toCharArray(); int sum = 0; int idx =str.indexOf(ch,i+1);
for (int i = 0; i < c.length; i++) { if(idx == -1) {
if (Character.isDigit(c[i])) { res +=ch; } }
int a = Integer.parseInt(String.valueOf(c[i])); System.out.println(res);
sum = sum + a; }} sop print duplicates
3 Occurrence of Count words
String str = "Javagggg is awesome66 is";
Anagram
String[] arr = str.split(" ");
String X = "silent"; String Y = "listnex";
int count = 0; String res = "";
char a[] = X.toCharArray();
Map<String,Integer> map =new HashMap<>();
char b[] = Y.toCharArray();
for(int i=0;i<arr.length;i++) {
Arrays.sort(a); Arrays.sort(b);
String s = arr[i]; // char ch =str.charAt(i);(CHARACTER)
boolean result = Arrays.equals(a, b);
map.put(s, map.containsKey(s) ? map.get(s)+1 : 1);
if(result == true) {
if(count<map.get(s)) {
System.out.println("String is anagram");
count = map.get(s);
res =s; } } First Repeated Character/non repeated character
System.out.println(map and res); String str = "madam";
4 Swap Two Strings for(int i=0;i<str.length();i++) {
char ch = str.charAt(i);
String s1 = "Apple"; String s2 = "Banana"; int firstindex = str.indexOf(ch);
s1 = s1+s2; int lastindex = str.lastIndexOf(ch);
s2 = s1.substring(0,s1.length()-s2.length()); if (firstindex !=lastindex) {
s1 = s1.substring(s2.length()); System.out.println(ch);
5 Reverse Each Word of a String break;
String str = "vikram is java";
String s[] =str.split(" "); Extract Last 4 Character
String rev=""; String input = "123456789";
for (String w : s) { String lastFourChars = "";
String revword =""; if (input.length() > 4) {
for(int i=w.length()-1;i>=0;i--) { lastFourChars = input.substring(input.length() - 4);
revword = revword +w.charAt(i);} } else { lastFourChars = input; }
rev = rev+revword+" ";} Uppercase First Letter
System.out.println(rev);}} String s = "i am going to delhi";
6 non repeating character String []arr = s.split(" ");
String str = "vvg"; for(int i=0;i<arr.length;i++) {
for (int i = 0; i < str.length(); i++) { char c =arr[i].charAt(0);
char ch = str.charAt(i); String c1 = String.valueOf(c).toUpperCase();
if (str.indexOf(ch, str.indexOf(ch) + 1) == -1) { String sub = arr[i].substring(1);
System.out.println(c1+sub);}
 if(arr[i]!=-1){
MOVE ALL 0’S END System.out.print(arr[i] + " ");
int arr[] = {-6,5,9,-10}; PRINT DUPLICATES
List<Integer>allnumber = new ArrayList<>(); if ((arr[i] == arr[j]) && (i != j))
List<Integer>negnumber = new ArrayList<>(); {System.out.println("Duplicate Element : "+arr[i]);}
for(Integer data:arr) {
if(data>=0) { Count Duplicates
allnumber.add(data); } int[] arr = {1, 2, 5, 5,6, 6, 6, 7, 2};
else {negnumber.add(data); }} for (int i = 0; i < arr.length; i++)
allnumber.addAll(negnumber); { int count =1;
System.out.println(allnumber); for (int j = i+1; j < arr.length; j++)
{ if (arr[i] == arr[j]) count++; else break; }
SORTING if (count>1) {
int temp = 0; System.out.println("Duplicate Element : "+arr[i]+ " is" +"
int[] arr ={10, 20, 30, 40}; " + count + "times");
for(int i=0;i<arr.length;i++) { missing number
for(int j=i+1;i<arr.length;j++) { int len; len = 7;
if(arr[i]>arr[j]) { int[] num = new int[]{1,2,4,6,7};
temp = arr[i]; int res = len * ((len + 1) / 2);
arr[i] = arr[j]; int num_sum = 0;
arr[j] = temp; for (int i: num)
REVERSE array { num_sum += i; }
System.out.println("Missing Array Number is "+(res -
int []intArray = {55,66,89};
num_sum));
for(int i=intArray.length-1;i>=0;i--)
}
System.out.print(intArray[i] + " ");
FIRST REPEATING
int[] arr = new int[] {1, -3, -3, 2, 2, 4};
Searching Of Element
List<Integer> element = new ArrayList<Integer>();
int[] a = {8,1,5,9,12,33,23,7,4,3,9};
for (int i : arr) {
int searchNum = 900;
if (!element.contains(i)) {
boolean found = false;
element.add(i);
for(int i=0;i <a.length ;i++) {
} else {
if(searchNum1 ==a[i]) {
System.out.println(i);
System.out.println(searchNum +" is available index "+i);
break;
found = true; break; }}
FIRST NON REPEATING
if(!found) {
int[] arr = new int[] {1, -3, -3, 1, 2, 4};
System.out.println(searchNum +" is "); } }
int size = arr.length;
for (int i = 0; i < size; i++) { int j;
Delete Duplicate
for (j = 0; j < size; j++){
int[] arr ={10, 20, 30, -40,-40};
if(i != j && arr[i] == arr[j])
for(int i=0;i<arr.length;i++)
break; }
{ for(int j=i+1;j<arr.length;j++) {
if (j == size)
if(arr[i]==arr[j])
{ System.out.println("First non-repeating: " + arr[i]);
{arr[i]=-1;}}}
break;
System.out.println("Remove duplicates");
for (int i = 0; i < arr.length; i++)
Reverse A string
String str = "Java is TCS FUTURE";
String s[] = str.split(" ");
String res = "";
for (int i = s.length - 1; i >= 0; i--) {
res +=s[i] + " "; }
Count vowel
int count = 0;
for (int i = 0; i < str.length(); i++)
{ if (str.charAt(i) == 'a' || str.charAt(i) == 'e' )
{count++; } }
System.out.print("Number of: " + count)}}

Count Occurrence of each vowel

String str = "You are using devcubicle!!!";
int[] counters = new int[5];
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
if (ch == 'a' || ch == 'A') {
counters[0]++;
} else if (ch == 'e' || ch == 'E') {
counters[1]++;
} else if (ch == 'i' || ch == 'I') {
counters[2]++;
} else if (ch == 'o' || ch == 'O') {
counters[3]++;
} else if (ch == 'u' || ch == 'U') {
counters[4]++; } }
System.out.println("Count of 'a' = " + counters[0]);
System.out.println("Count of 'e' = " + counters[1]);