NPTEL Software Testing Week 11 Assignment 11 Answers Join Telegram Group👇
NPTEL Software Testing Week 10 Assignment 10 Answer 2022 :-
Q1. Which of the following features of static websites are tested using graphs?
- We check if all the connections are valid and if there are any dead links.
- We check if all the information given is correct in each of the linked web pages.
NPTEL Software Testing Week 11 Assignment Answers: CLICK HERE
Q.2. While testing web applications, which of the following is true regarding client-side vs. server-side testing?
- Client and server are separated and testers typically don’t have access to the server code.
- Testers have equal accesss to the client code and server code eventhough they are separated.
Q.3. State yes or no: It is possible to generate all the input screens that are passed to a web application.
NPTEL Software Testing Week 11 Answers Join this Group👇
Q.4. Which of the following is a list of techniques that can be used to provide test values to a web application?
- Generate values automatically using an appropriate algorithm.
- Request user to supply inputs.
- Random choice, user session data, construct based on the domain of application.
- Generate inputs randomly and then choose based on the application.
Q.5. Which of the following features can be checked using HTML without the need to write extra scripting constraints?
- Change of transfer mode, checking for length of input and checking against a list of pre-defined values.
- Change of transfer mode and change of data type of input.
- Checking of inter–dependency of input values.
- Checking for length of input and also the data type
Q.6. Is a control graph model useful for testing system level properties of web applications?
Q.7. Which of the following is a complete list of operators that are used in component expressions?
- Sequencing and selection.
- Iteration and selection.
- Sequencing, iteration and selection.
- Sequencing, iteration, selection and aggregation
NPTEL Software Testing Week 11 Assignment Answers Join this Group👇
Q.8. Which of the following defines the nodes of a yo-yo graph?
- Nodes of a yo-yo graph are the classes of the inheritance hierarchy.
- Nodes of a yo–yo graph are the methods of different classes, one node for each of the new, inherited and overridden methods
Q.9. Which of the following best defines the edges of a yo-yo graph?
- Edges of a yo-yo graph are the method calls among methods of different classes.
- Edges of a yo-yo graph are among classes at different levels of inheritance.
- Edges of a yo-yo graph are from a caller method to a callee method.
- Edges of a yo-yo graph are either the actual method calls or the calls that cannot be made due to overriding.
Q.10. State true or false: All the faults in object-oriented programs can be determined statically.
Any Kind of Update Join Our Telegram Group👇This answer is provided by us only for discussion purpose if any answer will be getting wrong don’t blame us. If any doubt or suggestions regarding any question kindly comment. The solution is provided by Chase2learn. This tutorial is only for Discussion and Learning purpose.
About NPTEL Software Testing Course:This course will cover various techniques for test case design, as used for testing of software artifacts including requirements, design and code. We will discuss algorithms and techniques for test case design based on graphs, logic, syntax of programming languages and on inputs. Special techniques for testing object-oriented features and web applications will also be discussed. The course will end with symbolic testing techniques. These broadly will cover test cases for both white-box and black-box. If you have not registered for exam kindly register Through https://examform.nptel.ac.in/ COURSE LAYOUT The course structure and content covers, over a period of 12 weeks:
- Week 1: Techniques and algorithms for test case design: Graphs based testing- structural coverage criteria.
- Week 2: Graphs based testing: Data flow coverage criteria
- Week 3: Graphs based testing: Data flow coverage criteria
- Week 4: Graphs coverage for source code, design elements and requirements
- Week 5: Techniques and algorithms for test case design: Logic based testing- Predicates, logic based coverage criteria
- Week 6: Specification based logic coverage, logic coverage on finite state machines
- Week 7: Input space partitioning: Input domain modeling, combination strategies criteria
- Week 8: Syntax based testing: Coverage criteria based on syntax, mutation testing
- Week 9: Test case design (as learnt above) applied to object-oriented applications
- Week 10: Test case design (as learnt above) applied to web applications
- Week 11: Symbolic testing
- Week 12: Concolic testing, Conclusion