New Member FAQ | Forums | Earn Revenue


Resources Entrance Ask Experts Exam Papers Jobs English Projects Universities Colleges Courses Schools Training My India



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.

website counter



Download Model question papers & previous years question papers

Posted Date: 17 Jul 2008      Posted By: anu      Member Level: Gold

2006 Jawaharlal Nehru Technological University B.Tech Information Technology SOFTWARE TESTING METHODOLOGY Question paper



Course: B.Tech Information Technology   University: Jawaharlal Nehru Technological University




Set No. 4
IV B.Tech I Regular Examinations

November - 2006

SOFTWARE TESTING METHODOLOGY

Information Technology

Time : 3 hours Max Marks : 80

Answer any FIVE Questions. All Questions carry equal marks.

1. (a) Give differences between Functional testing and Structural testing.
(b) Specify on which factors the importance of bugs depends. And give the
metric for it.
(c) Briefly explain various consequences of bugs.
(d) What are the remedies for test bugs? [4+4+4+4]

2. (a) Write different applications of path testing and illustrate with examples.
(b) Differentiate between control flow graphs and flowcharts. [10+6]

3. (a) Define a transaction. Give an example.
(b) How does Transaction flows occur, illustrate with help of examples.
[2+14]

4. Explain the domain boundary bugs for two dimensional domains. [16]

5. Write short notes on,
(a) Path products
(b) Path expressions
(c) Path sums
(d) Loops. [4+4+4+4]

6. (a) Minimize the function using Karnaugh map method,
F(A,B,C,D)=Sigma(1,2,3,8,9,10,11,14)+Sigma d (7,15).
(b) Demonstrate by means of truth tables the validity of the following
theorems of Boolean algebra
(i) Associative laws
(ii) Demorgan’s theorems for three variables
(iii) Distributive law of + over. [8+8]

7. (a) Mention design guidelines for building finite state machines into your
code.
(b) Write short notes on
(i) Switches, Flags, unachievable paths.
(ii) Essential and Inessential finite state behaviour. [6+5+5]

8. What are graph matrices and their applications? [16]






Return to question paper search

Next Question Paper: Organizing child care services

Previous Question Paper: SATELLITE COMMUNICATION

Related Question Papers:


  • PRODUCTION DESIGN AND ASSEMBLY AUTOMATION


  • IV B.Tech.(I-Semester) Examinations MECHANICAL WORKING OF METALS


  • IV B.Tech. II Semester Regular Examinations, April/May -2006 SPACE MECHANICS


  • PROBABILITY AND STATISTICS setno2


  • Code No: 2320106 Set No. 2 III B.Tech II Semester Regular Examinations, April/May 2009 TRANSPORTATION ENGINEERING


  • Categories


    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.



    Advertise Here





    Contact Us   Advertise   Editors    Privacy Policy    Terms Of Use   

    ISC Technologies.
    2006 - 2009 All Rights Reserved.