QUICK LINKS
BRIEF OVERVIEW
UNIT I
Purpose of Testing
Dichotomies
Model for Testing
Consequences of Bugs
Taxonomy of Bugs
Summary
UNIT II
Basics of Path Testing
Predicates, Path Predicates and Achievable Paths
Path Sensitizing
Path Instrumentation
Application of Path Testing
Summary
UNIT III
Transaction Flows
Transaction Flow Testing Techniques
Implementation
Basics of Data Flow Testing
Strategies in Data Flow Testing
Application of Data Flow Testing
Summary
UNIT IV
Domains and Paths
Nice and Ugly domains
Domain Testing
Domain and Interface Testing
Domains and Testability
Summary
UNIT V
Path products and Path expression
Reduction Procedure
Applications
Regular Expressions and Flow Anomaly Detection
Summary
UNIT VI
Logic Based Testing
Decision Tables
Path Expressions
KV Charts
Specifications
Summary
|
RESOURCES
- Data Flow Testing Strategies - Good Example
- Lession Plan for III CSE 2 Batch
- E-Book: Software Testing Techniques, 2nd Edition, Boris Beizer
- Important Concepts in Exam Point of View. (for 6 Units)
- Is complete testing possible? To what extent software should be tested?
- Explain taxonomy of bugs? (May also ask to explain any one or two types of bugs in detail)
- Explain path testing criteria and path selection criteria. Consider the following flow-graph?
Select optimal number of paths to achieve C1+C2 (statement coverage + branch coverage). (Diagram will change according to marks)
- Explain the concept of Path Instrumentation. (May ask to explain path instrumentation or Co-incidental correctness or Link / Traversal marker or Link counters).
- Explain Data-flow testing strategies. (May also ask to explain one of the strategies.)
- Explain Data-flow anomalies in detail.
- Explain the concept of Nice and Ugly domains.
- Explain domains and interface testing. (includes closure compatibility, span compatibility etc)
- Explain testing in one dimensional and two dimensional domains.
- Explain the reduction procedure to evaluate the control flow graph to path expression. (May ask to implement on a diagram).
- Explain Regular expression and flow anomaly detection. (should also include Huang’s theorem)
- Explain the applications of paths (Max/Min.count of paths, probability, mean time).
- Reduce the following functions using K-Maps
F(A,B,C,D) = P(4,5,6,7,8,12,13)+d(1,15)
- How can we form specifications into sentences? Write down different phrases that can be used for words? Explain about the ambiguities and contradictions in specifications?
- Explain the theorems of Boolean algebra. How to get prime implicant with an example.
- Previous Years Question Papers:
* represents the degree of importance
- Unit 5 questions in previous question papers.
- Unit 6 questions in previous question papers.
- Unit 7 questions in previous question papers.
- Unit 8 questions in previous question papers.
|
