विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| समतुल्यता विभाजन परीक्षण (Equivalence Partitioning Testing)× | सॉफ्टवेयर जटिलता मेट्रिक्स× | |
|---|---|---|
| क्षेत्र | सॉफ्टवेयर इंजीनियरिंग | सॉफ्टवेयर इंजीनियरिंग |
| परिवार | Process / pipeline | Process / pipeline |
| उद्भव वर्ष≠ | 1979 | 1976 |
| प्रवर्तक≠ | Glenford Myers | Thomas J. McCabe |
| प्रकार≠ | partitioning strategy | quantitative measurement |
| मौलिक स्रोत≠ | Myers, G. J. (1979). The Art of Software Testing. John Wiley & Sons. link ↗ | McCabe, T. J. (1976). A complexity measure. IEEE Transactions on Software Engineering, 2(4), 308–320. DOI ↗ |
| उपनाम≠ | equivalence partitioning, BVA, boundary value analysis | code complexity analysis, complexity measurement |
| संबंधित | 4 | 4 |
| सारांश≠ | Equivalence partitioning divides input domains into equivalence classes—sets of inputs expected to behave identically—then selects test cases from each class. Introduced by Myers (1979), this technique reduces test cases while maintaining effectiveness. Boundary value analysis (BVA) complements partitioning by testing values at partition boundaries where failures often occur. | Software complexity metrics quantify the structural and operational difficulty of code through numerical measurements. Introduced by Thomas McCabe in 1976, cyclomatic complexity became the foundational approach. These metrics assess maintainability, testability, and defect risk, enabling teams to identify problematic code regions and guide refactoring efforts. |
| ScholarGateडेटासेट ↗ |
|
|