My Profile
Active Members
TodayLast 7 Days
more...
Awards & Gifts
Online Exams
Fresher Jobs
Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian
cities including Bangalore, Chennai, Hyderabad, Pune or Kochi
Resources
Find educational articles, blogs, discussion threads and other resources.
Colleges
Find details about any college in India or search for courses.
|
Download Model question papers & previous years question papers
|
Posted By: Sra1 Member Level: Diamond Posted Date: 02 Jun 2008
|
2008 Jawaharlal Nehru Technological University B.Tech Computer Science & Engineering SOFTWARE ENGINEERING (Supplimentary Examinations, Aug/Sep 2007) Question paper
Set No 2
------------
III B.Tech II Semester Regular Examinations, Apr/May 2008
SOFTWARE TESTING METHODOLOGIES
( Common to Computer Science & Engineering and Information
Technology)
Time: 3 hours Max Marks: 80
Answer any FIVE Questions
All Questions carry equal marks
* * * * *
1. (a) Why is it impossble for a tester to find all the bugs in a system? Why might it not be necessary for a program to be completely free of defects before it is delivered to its customers?
(b) To what extent can testing be used to validate that the program is fit for its
purpose? Discuss. [10+6]
2. What is meant by a Loop? State and explain various kinds of Loops with suitable examples. Also discuss how to select optimal paths for C1+C2.(Statement coverage + Branch coverage) [16]
3. (a) State and explain various transaction flow junctions and mergers.
(b) Explain the terms Inspections, Reviews and Walkthroughs. [6+10]
4. Discuss in detail the nice domains and ugly domains with suitable examples. [16]
5. (a) Define path product, path expression and path sum. Explain with examples.
(b) Explain applications of Paths, Path Products and Regular Expressions. [8+8]
6. (a) Explain about the don?t care conditions in the logic based testing.
(b) Explain about the ambiguities and contradictions in the specifications. [16]
7. The behavior of a finite-state machine is invariant under all encodings. Justify. [16]
8. (a) What are the matrix operations in tool building?
(b) Discuss the algorithm for finding set of all paths. [8+8]
Return to question paper search
|
|
|
Submit Previous Years University Question Papers and make money from adsense revenue sharing program
Are you preparing for a university examination? Download model question papers
and practise before you write the exam.
|
Watch TV Channels
|