In life, NO ONE and NOTHING will help you until you start helping YOURSELF.
--Your friends at LectureNotes

Previous Year Exam Questions for Software Testing - ST of 2017 - bput by Verified Writer

  • Software Testing - ST
  • 2017
  • PYQ
  • Biju Patnaik University of Technology Rourkela Odisha - BPUT
  • Information Technology Engineering
  • B.Tech
  • 21 Offline Downloads
  • Uploaded 1 year ago
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

Registration no: Total Number of Pages: 02 B.Tech. PEIT5401 7th Semester Regular / Back Examination 2017-18 Software Testing BRANCH: IT, ITE Time: 3 Hours Max Marks: 70 Q.CODE: B398 Answer Question No.1 which is compulsory and any five from the rest. The figures in the right hand margin indicate marks. Q1 a) b) c) d) e) f) Answer the following questions : Discuss the factors which make effective testing difficult. What are pairwise interaction faults? How does a white box test adequacy criterion differ from a black box test adequacy criterion? State any twotools for regression testing. (2x10) i) j) How is software testing different from hardware testing? How do we use a connection matrix to find the cyclomatic complexity number? State the techniques used to generate test from predicates. If there are k rules over n binary conditions, how many number of minimum and maximum test cases can be there? What is category partition method? Differentiate between verification and validation Q2 a) b) State the differences between testing and debugging Explain the difference between failure, fault and error with a suitable example. (5) (5) Q3 a) A program has to be designed to determine the nature of roots of a quadratic equation. The quadratic equation takes three input values from the range [0,100]. Design the test cases using the cause-effect graphing technique. Draw the control flow graph for the following function named find_maximum. Form the control flow graph, determine its cyclomatic complexity. (5) g) h) b) (5) intfind_maximum( inti, int j, int k) { int max; if (i>j) if (i>k) max= i; else max= k; else if (j>k) max= j; else max = k; return (max); } Q4 a) b) Discuss the adequacy criteria based on control flow. Consider the given program for calculating the gross salary of an employee. main() { float bs, gs, da, hra=0; (5) (5)

Text from page-2

printf(“enter the basic salary”); scanf(“%f”, &bs); if(bs<18000) { hra = bs * 10/100; da =bs * 90/100; } else { hra= 10000; da= bs * 98/100; } gs = bs + hra + da; printf(“ Gross Salary = Rs. %f”, gs); } Find out the define-use-kill patterns for all the variables in the source code of this application. Q5 a) b) Q6 a) b) Q7 Q8 a) b) c) d) What is regression testing? Discuss the different regression test selection techniques. What is model based testing? What is modified condition coverage? State its characteristics. (5) Discuss the steps involved in Combinatorial Test-Design Process. What is static testing? Briefly describe its types. (5) (5) A program reads three numbers, A, B, and C, with a range [1,50] and prints the largest number. Design test cases for this program using Boundary value checking and equivalence class partitioning technique. (10) Write short answer on any TWO : Structural Vs Functional Testing Dynamic Slicing State Model The Subsumes Relation (5) (5 x 2)

Lecture Notes