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)
- Previous Years Question Papers:
* represents the degree of importance
- Unit 5 questions in previous question papers.
- Unit 6 questions in previous question papers.
- Reduce the following functions using K-Maps (16 M) **
F(A,B,C,D) = P(4,5,6,7,8,12,13)+d(1,15)
- Whether the predicates are restricted to binary truth-values or not. Explain. (10 M)
- What are decision tables? Illustrate the applications of decision tables. How is a decision table useful in testing. Explain with an example. (16 M) **
- How can we determine paths in domains in Logic based testing? (8 M)
- How the Boolean expression can be used in test case design (8 M)
- Flow graphs are abstract representations of programs. Justify? (8 M)
- Explain prime implicant, sum of product form and product of sum form. (8 M)
- How can we form specifications into sentences? Write down different phrases that can be used for words? (8 M)
- Explain about the ambiguities and contradictions in specifications.? (8 M)
- Demonstrate by means of truth tables the validity of the following theorems of Boolean algebra: (8 M) **
- Associative Laws
- Demorgan's theorems for three variables
- Distributive Law
- Absorption Rule
- Unit 7 questions in previous question papers.
- Unit 8 questions in previous question papers.
|