New Semester
Started
Get
50% OFF
Study Help!
--h --m --s
Claim Now
Question Answers
Textbooks
Find textbooks, questions and answers
Oops, something went wrong!
Change your search query and then try again
S
Books
FREE
Study Help
Expert Questions
Accounting
General Management
Mathematics
Finance
Organizational Behaviour
Law
Physics
Operating System
Management Leadership
Sociology
Programming
Marketing
Database
Computer Network
Economics
Textbooks Solutions
Accounting
Managerial Accounting
Management Leadership
Cost Accounting
Statistics
Business Law
Corporate Finance
Finance
Economics
Auditing
Tutors
Online Tutors
Find a Tutor
Hire a Tutor
Become a Tutor
AI Tutor
AI Study Planner
NEW
Sell Books
Search
Search
Sign In
Register
study help
business
software testing and quality assurance
Flexible, Reliable Software Using Patterns And Agile Development 1st Edition Henrik B Christensen - Solutions
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 paths.
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 this program segment.(b) Determine the cyclomatic complexity for this program (show the intermediate
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 ”, &y);while (x ! = y){if (x > y)x = x – y;else y = y – x;}printf (“x = %d”, x);}
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) Every condition has been tested
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 large”);}else {printf (“b is large”);}}(a) 1 test case for statement coverage, 2 for branch
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 means 100% statement coverage.(c) 90% statement coverage means 90% decision coverage.(d) 90% decision
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 cases
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 are not dc paths. Write test cases for every du-path.
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, Equilateral, Not a triangle, invalid inputs](a) Draw a program graph, DD path graph and write test cases
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 technique.
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 < marks 50 D Grade Generate all du-paths and write test cases for all du-paths.
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 paths./* Program to calculate total telephone bill amount to be paid by an customer*/#include#include1.
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 one test case from every slice.
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 suite of five test cases and calculate the mutation score of the test suite.
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 all-definitions and generate test cases for these paths.#include#include1. void main()2. {3. int
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 slice.
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 program.(d) Verification is the process of understanding a program.
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) None of the above.
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
Software verification activities are most useful at the level of:(a) SRS document(b) SDD document(c) Source code(d) Documentations
Source code should be examined to check:(a) Syntax errors(b) Semantics errors(c) Standards(d) All of the above
What is the advantage of source code inspections?(a) Examine the source code before the execution environment is ready.(b) It can be performed by inexperienced persons.(c) It is not expensive.(d) Source code writers can do it.
Peer reviews are also known as:(a) Inspections(b) Walkthroughs(c) Informal reviews(d) Formal reviews
What is not included in the cost of performing inspections?(a) Setting up forms and databases(b) Statistical analysis of various metrics(c) Time spent on documenting outside meeting(d) Writing the documents to be inspected
Reviews, inspections and dynamic testing have the same objective of:(a) Identifying faults(b) Fixing faults(c) Removing faults(d) All of the above
Quality assurance methods are usually considered as:(a) Defective(b) Preventive(c) Corrective(d) Perfective
What is the basic difference between a walkthrough and an inspection?(a) An inspection is led by the author, while a walkthrough is led by the moderator.(b) An inspection is led by the moderator, while a walkthrough is led by the author.(c) Authors are not present during inspections while they
Software quality is determined by:(a) The number of bugs only(b) The sales level of the software(c) How well the software meets the needs of the business(d) None of the above
Typical defects that are easier to find in reviews than in dynamic testing are:(a) Deviations from standards(b) Requirement defects(c) Design defects(d) All of the above
Which should not be included as a success factor for a review?(a) Management supports a good review process(b) Defects found are discussed openly(c) Each review does not have a predefined objective(d) None of the above
The later in the development life cycle a fault is discovered, the more expensive it is to fix. Why?(a) Due to poor documentation, it takes longer to find out what the software is doing.(b) Wages are rising.(c) The fault has already resulted in many faults in documentation, generated faulty source
Inspections can find all of the following except:(a) Variables not defined in the source code(b) Omission of requirements(c) Errors in documents and the source code(d) How much of the source code has been covered
During software development, when should we start testing activities?(a) After the completion of code(b) After the completion of design(c) After the completion of requirements capturing(d) After the completion of feasibility study
In reviews, the moderator’s job is to:(a) Prepare minutes of the meeting(b) Prepare documents for review(c) Mediate between participants(d) Guide the users about quality
What can static analysis not identify?(a) Memory leaks(b) Data of defined variables but which are not used(c) Data of variables used but not defined(d) Array bound violations
Which of the following statements are not true?(a) Inspections are very important for fault identifications.(b) Inspections should be led by a senior trained person.(c) Inspections are carried out using documents.(d) Inspections may often not require documents.
Differentiate between verification and validation. Describe various verification methods.
Which verification method is most popular and why?
Describe the following verification methods:(a) Peer views(b) Walkthroughs(c) Inspections
Explain the issues which must be addressed by the SRS document checklist.
Discuss the areas which must be included in a good SDD design checklist. How is it useful to improve the quality of the document?
Discuss some of the issues related to source code reviews. How can we incorporate these issues in the source code review checklist?
Showing 3500 - 3600
of 3990
First
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
Step by Step Answers
Get 50% OFF
Claim Now
