<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Quality Assurance on Nalar</title>
    <link>https://nalar.dev/tags/quality-assurance/</link>
    <description>Recent content in Quality Assurance on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 08 Sep 2026 00:00:00 +0700</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/quality-assurance/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Reducing Test Combinations with Pairwise Testing</title>
      <link>https://nalar.dev/reducing-test-combinations-with-pairwise-testing/</link>
      <pubDate>Tue, 08 Sep 2026 00:00:00 +0700</pubDate>
      <guid>https://nalar.dev/reducing-test-combinations-with-pairwise-testing/</guid>
      <description>&lt;p&gt;Configuration-heavy software creates a testing problem that grows faster than it first appears. A feature may behave differently by account type, payment method, region, browser mode, storage backend, or feature flag. Testing each choice separately can miss interaction bugs, while testing every combination can become impractical.&lt;/p&gt;&#xA;&lt;p&gt;&lt;strong&gt;Pairwise testing&lt;/strong&gt; is a combinatorial test-design technique for this situation. Instead of requiring every complete combination, it constructs a set of tests in which every pair of parameter values appears together at least once.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
