Software Tesing Methodologies MCA Question Paper : vardhaman.org

College : Vardhaman College Of Engineering
Degree : M.C.A
Semester : V
Subject : Software Tesing Methodologies
Document type : Question Paper
Website : vardhaman.org

Download Previous / Old Question Papers : https://www.pdfquestion.in/uploads/vardhaman.org/6476-MA5R11DEC-13.pdf

Vardhaman Software Testing Question Paper

MCA V Semester Regular Examinations, December – 2013
(Regulations: VCE-R11)
(Master of Computer Applications)
Date : 15 December, 2013
Time : 3 Hours
Max. Marks : 60
** Answer any FIVE Questions.
** All Questions carry equal marks

Related : Vardhaman College Of Engineering Data Warehousing & Data Mining M.C.A Question Paper : www.pdfquestion.in/6475.html

All parts of the questions must be answered in one place only

1. a) Give the various bugs encountered at different phases of software development life cycle. 8M
b) Which is better – Functional testing or Structural testing? Justify your answer. 4M

2. a) Consider the below pseudo code:
Input (a, b, c);
d ? b*b – 4*a*c;
if (d>0) then
r ? 2;
if (d=0) then
r ? 1;
if (d<0) then
r ? 0;
Output (r);
Give the steps/procedure for constructing a control flow graph (CFG) by considering the above pseudo code. 8M
b) Illustrate with an example, the path sensitization. 4M

3. a) Distinguish between Inspections, Reviews, and Walkthroughs. 6M
b) Illustrate with an example, the different data flow testing strategies. 6M
4. a) Describe the different domain errors encountered when a software tester assume the bugs. 4M
b) Explain with an example, One-dimensional domain testing and two dimensional domain testing. Give the different bugs encountered in the above domain testing techniques. 8M

5. a) Design a decision table for the simple ATM banking system assuming the necessary data. 6M
b) Briefly describe the KV charts for functions of a single variable and double variables. 6M

6. a) List the design guidelines for implementing a finite-state machine behavior. 6M
b) Give the principles of state testing. How the bugs impact on state testing. 6M
7. a) Illustrate with an example, how the properties of relations are applicable to the software testing. 6M
b) Describe in detail the Node-Reduction algorithm. 6M

8. a) Describe the steps used for synchronization of test cases. Illustrate the difficulties faced when synchronizing the various types of applications. 6M
b) Give the procedure for testing the data driven applications and web applications using QTP.6M

Discrete Structures

Automate Theory : (Computer Science and Engineering)
Time: 3 hours
Max Marks: 60
** Answer any FIVE Questions.
** All Questions carry equal marks

All parts of the questions must be answered in one place only
1 a) Obtain the principle disjunctive form of (P®Q)Ç(Q«R) . 6M
b) Show that the following implications without construction the truth table.
i. (P®Q)?P®(PÇQ)
ii. (Q®(PÇØP))®(R®(PÇØP))?R®Q 6M

2 a) Given A={xIx is an integer and 1<=x<=5}, B={3,4,5,17}, and C={1,2,3,……}, find AUB and AnB, and AUC 6M
b) Let f (x) = x + 2, g(x) = x – 2 and h(x)=3x for x?R, where R is the set of real numbers. Find g o f ; f o g; f o f ;h o g; f o h o g 6M

3 a) Show that every finite semi group has an idempotent. 6M
b) How many words of four letters can be formed from the letters of the word INFINITE? 6M

4 a) Solve the recurrence relation T(k) = 3kT(k -1) = 0,T(0) =1. 6M
b) Solve an-5an-1+6an-2=2n 6M

5 a) Explain the differences between NFA and DFA. 6M
b) Design a DFA which accepts all strings which are ending with 101 over an Alphabet {0,1}. 6M

6 a) Define Greibach Normal Form (GNF), and convert the following CFG into GNF S®AbD A®Aa / bb / ee D®Da /Db / xy / yz 9M
b) Obtain a regular grammar to obtain the even palindromes over a’s and b’s 3M
7 a) Obtain PDA to accept strings of balanced parentheses and verify by a suitable example. 6M

b) Convert the following grammar to CNF.
S -> bA aB
A -> bAA aS a
B -> aBB bS b 6M

8 a) Design Turning machine to recognize the language L = {0n1n2n / n ³1} 8M
b) Describe the Chomsky hierarchy of languages and give corresponding automata. 4M