All Matches

Solution Library

Expert Answer

Textbooks

Search Textbook questions, tutors and Books

Oops, something went wrong!

Change your search query and then try again

Result Not Found

Books FREE
Tutors
Study Help
Ask a Question
AI Study Help New

Search
Sign In
Register

study help
business
software testing and quality assurance

Questions and Answers of Software Testing And Quality Assurance

Consider a program to multiply and divide two numbers. The inputs may be two valid integers (say a andb) in the range of [0, 100].(a) Generate boundary value analysis test cases and robust test
Consider the following points based on faculty appraisal and development system of a university:Points Earned University view 1 – 6 Work hard to improve 6 – 8 Satisfactory 8 – 10 Good 10 – 12
Consider a program to perform binary search and generate the test cases using equivalence class testing and decision table based testing.
Write a program to count the number of digits in a number. Its input is any number from interval [0, 9999]. Design the boundary value analysis test cases and robustness test cases.
Why is functional testing also known as black box testing? Discuss with the help of examples.
What are the limitations of boundary value analysis technique? Discuss the situations in which it is not effective.
Cyclomatic complexity is designed by:(a) T.J. McCabe(b) B.W. Boehm(c) Victor Basili(d) Bev. Littlewood
Cyclomatic complexity can be calculated by:(a) V(G)= e-n+2P(b) V(G)= +1(c) V(G)= number of regions of the graph(d) All of the above
The cyclomatic complexity equation V(G)= +1 is applicable only if every predicate node has:(a) Two outgoing edges(b) Three or more outgoing edges(c) No outgoing edge(d) One outgoing edge
Cyclomatic complexity is equal to:(a) Number of paths in a graph(b) Number of independent paths in a graph(c) Number of edges in a graph(d) Number of nodes in a graph
A node with indegree 0 and outdegree =0 is called:(a) Source node(b) Destination node(c) Predicate node(d) None of the above
A node with indegree =0 and outdegree 0 is called:(a) Source node(b) Destination node(c) Predicate node(d) Transfer node
An independent path is:(a) Any path that has at least one new set of processing statements or new condition(b) Any path that has at most one new set of processing statements or new condition(c) Any
DD path graph is called:(a) Defect to defect path graph(b) Design to defect path graph(c) Decision to decision path graph(d) Destination to decision path graph
Every node in the graph matrix is represented by:(a) One row and one column(b) Two rows and two columns(c) One row and two columns(d) Two rows and one column
The size of graph matrix is:(a) Number of edges in the flow graph(b) Number of nodes in the flow graph(c) Number of paths in the flow graph(d) Number of independent paths in the flow graph
A program with high cyclomatic complexity is:(a) Large in size(b) Small in size(c) Difficult to test(d) Easy to test
Developers may have to take some tough decisions when the cyclomatic complexity is:(a) 1(b) 5(c) 15(d) 75
Every node of a regular graph has:(a) Different degrees(b) Same degree(c) No degree(d) None of the above
The sum of entries of any column of incidence matrix is:(a) 2(b) 3(c) 1(d) 4
The sum of entries of any row of adjacency matrix gives:(a) Degree of a node(b) Paths in a graph(c) Connections in a graph(d) None of the above
The adjacency matrix of a directed graph:(a) May have diagonal entries equal to 1(b) May be symmetric(c) May not be symmetric(d) May be difficult to understand
Length of a path is equal to:(a) The number of edges in a graph(b) The number of nodes in a graph(c) The number of nodes in a path(d) The number of edges in a path
Strongly connected graph will always be:(a) Weakly connected(b) Large in size(c) Small in size(d) Loosely connected
A simple graph has:(a) Loops and parallel edges(b) No loop and a parallel edge(c) At least one loop(d) At most one loop
In a directed graph:(a) Edges are the un-ordered pairs of nodes(b) Edges are the ordered pairs of nodes(c) Edges and nodes are always equal(d) Edges and nodes are always same
What is a graph? Define a simple graph, multigraph and regular graph with examples.
How do we calculate degree of a node? What is the degree of an isolated node?
What is the degree of a node in a directed graph? Explain the significance of indegree and outdegree of a node.
Consider the following graph and find the degree of every node. Is it a regular graph?Identify source nodes, destination nodes, sequential nodes, predicate nodes and junction nodes in this graph.
Consider the graph given in exercise
and find the following:(i) Incidence matrix(ii) Adjacency matrix(iii) Paths(iv) Connectedness(v) Cycles
Define incidence matrix and explain why the sum of entries of any column is always 2.What are various applications of incidence matrix in testing?
What is the relationship of an adjacency matrix with connection matrix?
What is a graph matrix? How is it related to a connection matrix?
Why is adjacency matrix not symmetric in a directed graph? How can we calculate indegree and outdegree of all nodes from the adjacency matrix?
What is a path? How is it different from an independent path?
Define the following in a graph:(i) Cycles(ii) Connectedness
Consider the following graph:(i) Calculate the degree of every node and identify the cycles.(ii) Is this graph strongly connected?(iii) Draw the incidence matrix and adjacency matrix.(iv) Find all
What is cyclomatic complexity? Discuss different ways to compute it with examples.
Explain program graph notations. Use these notations to represent a program graph from a given program.
Consider the following program segment:/* sort takes an integer array and sorts it in ascending order*/1. void sort (int a [ ], int n) {2. int i, j;3. for(i=0;i
Consider the following program segment:1. int find-maximum (int i, int j, int k)2. {3. int max;4. if(i>j) then 5. if (ik) max=j 8. else max=k 9. return (max);10. }(a) Draw the control flow graph for
Write a program to determine whether a number is even or odd. Draw the program graph and DD path graph. Find the independent paths.
Consider the following program and draw the program path graph and DD path graph.Also find out cyclomatic complexity and independent paths.void main ( ){int x, y;scanf (“%d ”, &x);scanf (“%d
What are differences between a directed graph and un-directed graph? Which one is more relevant in software testing and why?
How do we define the connectedness of a graph? Why every strongly connected graph is also called weakly connected graph?
Which is not a structural testing technique?(a) Mutation testing(b) Data flow testing(c) Slice based testing(d) Decision table based testing
Which is a structural testing technique?(a) Data flow testing(b) Control flow testing(c) Mutation testing(d) All of the above
Data flow testing is related to:(a) ER diagrams(b) Data flow diagrams(c) Data dictionaries(d) None of the above
Mutation testing is related to:(a) Fault seeding(b) Fault severity(c) Fault impact analysis(d) None of the above
Mutation score does not indicate anything about:(a) Size of a test suite(b) Effectiveness of a test suite(c) Performance of a test suite(d) Usefulness of a test suite
100% statement coverage and branch coverage means:(a) Every statement has been tested(b) Every outcome of a branch statement has been tested(c) Every statement and every branch has been tested(d)
How many test cases are required for 100% statement and branch coverage of the following source code?void main ( ){inta, b;scanf (“%d”, &a);scanf (“%d”, &b);if (a>b) {printf (“a is
Which of the following statements about the relationship of statement coverage and decision coverage is correct?(a) 100% statement coverage means 100% decision coverage.(b) 100% decision coverage
In data flow testing, which criterion generates the maximum number of test cases?(a) Test all du-paths(b) Test all uses(c) Test all definitions(d) All of the above generates the same number of test
Statements coverage will not check for :(a) Missing statements(b) Extra statements(c) Dead statements(d) Unused statements
Statement coverage is commonly used to measure:(a) Test effectiveness(b) Number of faults(c) Testing time(d) Complexity of code
Structural testing techniques may help us to:(a) Understand the source code(b) Generate test cases using various paths(c) Comprehend the program(d) All of the above
A program slice is:(a) More complex than the original program(b) Larger than the original program(c) Smaller than the original program(d) More critical than the original program
Which mutants are more popular in practice?(a) First order mutant(b) Second order mutant(c) Third order mutant(d) Zero order mutant
Source code coverage measurement is :(a) A partial measure of test effectiveness(b) Not related to testing(c) Easily achievable in practice(d) None of the above
Which of the following is not related?(a) White box(b) Black box(c) Glass box(d) Structural
Mutation score is related to:(a) Effectiveness of a test suite(b) Size of a test suite(c) Complexity of a test suite(d) Criticality of a test suite
Which is a mutation testing tool?(a) Insure++(b) Jester for Java(c) Nester for c++(d) All of the above
Which is difficult to achieve?(a) 100% statement coverage(b) 100% branch coverage(c) 100% condition coverage(d) 100% path coverage
Program slicing was introduced by:(a) Mark Weiser(b) Victor Basili(c) L. Briand(d) Mc Cabe
What is structural testing? How is it different from functional testing?
What are different types of structural testing techniques? Discuss any two techniques with the help of examples.
Discuss the significance of path testing. How can we make it more effective?
Show with the help of an example that a very high level of statement coverage does not mean that the program is defect-free.
Write a program to find roots of a quadratic equation.(a) Draw program graph, DD path graph. Also find independent paths and generate test cases.(b) Find all du-paths and identify those du-paths that
Explain define/use testing. Consider the NextDate function and write a program in ‘C’language. Find all du paths and dc paths. Design test cases for every definition to every usage.
Consider a program for classification of a triangle. Its input is a triple of positive integers(saya, b andc) from interval [1, 100]. The output may be one of the following:[Scalene, Isosceles,
What is slice based testing? How can it improve testing? Explain the concept with the help of an example and write test cases accordingly.
What is mutation testing? What is the purpose of mutation score? Why are higher order mutants not preferred?
Differentiate between black box and white box testing. Consider a program to find the largest number amongst three numbers. Generate test cases using one black box testing and one white box testing
How is data flow testing performed? Is it possible to design data flow test cases manually? Justify your answer.
What do you mean by a program graph? What is its use? How can we use it in the design of du-paths?
Write a program to print the grade of a student according to the following criteria:(i) marks > 80 A+ Grade(ii) 70 < marks 80 A Grade(iii) 60 < marks 70 B Grade(iv) 50 < marks 60 C Grade(v) 40 <
Consider the program given below. Find all du-paths and identify those du-paths that are definition clear. Also find all du-paths, all-uses and all-definitions and generate test cases for these
Consider the program for determination of the total telephone bill amount to be paid by a customer given in exercise 4.14. Consider all variables and generate possible program slices. Design at least
Consider the program for determination of the total telephone bill amount to be paid by a customer given in exercise 4.14. Generate two first order mutants and one second order mutant. Design a test
Consider a program to input two numbers and print them in ascending order given below. Find all du-paths and identify those du-paths that are definition clear. Also find all du-paths, all-uses and
Consider a program to input two numbers and print them in ascending order given in exercise 4.17. Consider all variables and generate possible program slices. Design at least one test case from every
Establish the relationship between data flow testing and slice based testing.
What is the importance of mutation testing? Why is it becoming popular?
Software verification includes:(a) Reviews(b) Inspections(c) Walkthroughs(d) All of the above.
Which of the following is not true?(a) Verification is the process of executing a program.(b) Verification is the process of examining a program.(c) Verification is the process of inspecting a
Which of the following is not a verification method?(a) Peer reviews(b) Cause effect graphing(c) Walkthroughs(d) Inspections
In walkthroughs, who presents the document to the members?(a) Author(b) Moderator(c) Customer(d) Developer
Which of the following is not a weakness of walkthroughs?(a) The presenter may hide critical areas.(b) Participants may not ask penetrating questions.(c) Documents are shown to all participants.(d)
Which of the following is not used as a term for inspections?(a) Formal technical reviews(b) Peer reviews(c) Technical reviews(d) Reviews
In inspections, who presents the document to the members?(a) Author(b) Developer(c) Specialized person(d) Customer
Which verification method requires maximum participants?(a) Peer reviews(b) Walkthroughs(c) Inspections(d) None of the above.
What is the IEEE standard for SRS document?(a) IEEE std. 830 – 1998(b) IEEE std. 829 – 1993(c) IEEE std. 860 – 1998(d) IEEE std. 863 – 1998
What is the IEEE standard for SDD document?(a) IEEE std. 830 – 1998(b) IEEE std. 1016 – 1998(c) IEEE std. 829 – 1998(d) IEEE std. 831 – 1998
SRS stands for:(a) Software Requirements specifications(b) System Requirements Specifications(c) Systematic Requirements Specifications(d) Sequential Requirements Specifications
Verification of the SRS documents is carried out to:(a) Document the requirements(b) Improve the quality(c) Capture the requirements(d) Notify the requirements
Which is not a characteristic of a good SRS?(a) Correct(b) Complete(c) Consistent(d) Brief

Showing 2800 - 2900 of 3313

First
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

Services

Sitemap
Fun
Definitions
Become Tutor
Study Help Categories
Recent Questions
Expert Questions

Company Info

Security
Copyrights
Privacy Policy
Terms & Conditions
SolutionInn Fee
Scholarship

Get In Touch

About Us
Contact Us
Career
Jobs
FAQ
Campus Ambassador

Secure Payment

Download Our App

© 2024 SolutionInn. All Rights Reserved