le No: 156CW R18 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech II Year II Semester Examinations, August - 2022 SOFTWARE TESTING METHODOLOGIES (Common to CSE, IT) Max-Marks:75 Answer any five questions All questions carry equal marks 1a) To what & sting be used to validate that the program is fit for its purpose? Discuss and ex; is dichotomies, b) Explain various c \ces of bugs. What are the remedies for test bugs? Explain. 1748] 2a) — State and explain various \n rules for path testing. b) What is the purpose of test the principles of test case design. (758) 3.a) What are the transaction flows? Expl b) Discuss the following strategies of dat i) All-predicate-uses (APU) strategy ii) All-computational (ACU) strategy. complications. ing with suitable examples: Q 1748] 4.0) What is meant by Data-flow testing? Compare “es and data-flow testing strategi b) What is meant by a nice domain? Give an example f¢ dimensional domains. [8+7] 5.) How can we check the consistency and completeness in the d b) Define path product, path expression and path sum. Give pe 6.a) Define decision table and explain don’t care and impossible terms. b) Explain test case design and sketch KV charts of three and four variables. 7a) What are principles of state testing? Explain its advantages and disadvantages. — b) Differentiate between good state graphs and bad state graphs. ey ) 8.) Write an algorithm for Node Reduction and illustrate the applications of it. b) Define graph matrices and evaluate graph matrix with pictorial graph. [8+] ==-00000—--Code No: 156CW GS B. Tech IIE Year II Semester Examinations, August/September - 2021 SOFTWARE TESTING METHODOLOGIES R18 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD (Common to CSE, IT) imesgfPburs Max. Marks: 75 Answer any five questions . All questions carry equal marks La) b) 2a) b) 3a) b) 4a) b) 5a) b) 6. Ta) b) 8a) b) State and explajp4furious dichotomies in software testing. Explain t Bug. [847] bugs? How can they be caught? What are contré sensitizing paths. 1758] Explain heuristics proced) Compare data flow and ing strategies. Explain transaction-flow gta hentation with example. 1748] What is program slicing? Explai ogram slicing. Explain predicates of domain testi examples. [847] Write the role of path expression and pati pretiatggtn testing. Write the procedure to count the minimum méibe of paips in a graph. 1748] Demonstrate through truth tables the validity of REf6) ’ngNheorems of Boolean algebra: a) Associative Laws 2 b) De morgan’s theorems for three variables ©) Distributive Law. . [54545] Explain about good state and bad state graphs. How to handle bad s Write short notes on: i) Transition Bugs ii) Dead States. v Explain the features of the Jmeter Testing environment. How to record tests and set checkpoints in win runners? Explain, -~-00000-Code No: 156CW R18 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERATAD 1B. Tech I Year Semester Examinations, Febevary=2023 YG ‘SOFTWARE TESTING METHODOLOGIES (Common to SE,11) ‘Max. Marks: 75 Note! per consists of Part A, Part B, sory, which caries 25 marks. In Part A, Answer all questions. rer any oe question from each unit. Each question carries 10 marks as sub questions. PART-A @5Marks 1a) Define path tesing ey 2 Rieke Phemratonn 8 ©) We a sho aon on ia) ©) What athe igniicace of sng? 6 ©) Wate shor note om phe ay 8) Litourthe werent operon thn eyo solvesny boolean algebra. [3] ®) Defines transom bop i §) Whatis good state geaph? 7 B) 1) Datne sonacton ai, i) 3) Uitte opicatons of gh matics. 5 Q (50 Marks) 22) ieee sign gi 'b) Describe the model for testing. & (515) oR 3. Classify the different types of bugs and explain. > 110) 4a) State and explain the transaction flow testing techniques. ) Compare stati slicing wih dynamic slicing i OR 5. How developers and testers treat nice and ugly domains? Mlastate with the hel examples. tof 6.) Mlustrate maximum path count arithmetic with an example, 'b) Describe the usage of regular expression in flow anomaly detection. [ora) OR 7a) _Iustfy the use of decision table implementation for designing test cases. 'b) Explain the procedure for specification validation using KV chans. (s+) 8. Explain the following terms: 4 Design guideline for building inte state machine (A pprieesenin inte ste beri (545) or 9 fragt notes ns ») ~ he concep aston esting. (s+51 10: ecm edition optimization. b) Give Gbriet, ary on relations, [5+5] or 1 ode relucioe using mrt operations aed exp. (10)Y Code No: 186CW R18 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech HII Year Il Semester Examinations, February/March - 2022 SOFTWARE TESTING METHODOLOGIES (Common to CSE, IT) ‘3 hours Max. Marks: 75 Answer any five questions All questions carry equal marks 1a) Discuss \lementation and application of path testing, b) Deseri ion and sensitization in transaction flow testing, 1847] 2.a) Explain about ap} number of paths with suitable example, b) Discuss in detail ab [847] 3.a)__ Describe software implenfeny te graphs. b) Explain about partition algor [847] 4.a) Briefly explain about consequencs }) Discuss about three and four variable Veffths with examples. 1847] 5.a)__ What are dataflow anomalies? Explain aboft dgféflayy anomaly state graph. b) Write and explain testability tips of state testify 1847] Describe motivational overview of graph matrices. [8+7] 6.) Distinguish the following: i) Modularity vs erick fl ep vs structure b) , ) 7.) Explain basic concepts of path products and path expressior b) Discuss about node-reduction algorithm. Os om 8 Explain the following: a) Testing one-dimensional domains b) Coding bugs ° ©) Identity elements, W) --00000--