From 8a7dfa0972c83fd811a4296e7373574bea4a28d0 Mon Sep 17 00:00:00 2001
From: Nguyễn Gia Phong <mcsinyx@disroot.org>
Date: Sun, 19 Jul 2020 20:34:40 +0700
Subject: [usth/ICT2.7] Remove Udacity transcribes

---
 ... - B&C Coverage Quiz Solution - lang_en_vs4.srt | 67 ----------------------
 1 file changed, 67 deletions(-)
 delete mode 100644 usth/ICT2.7/P4L3 White-Box Testing Subtitles/21 - B&C Coverage Quiz Solution - lang_en_vs4.srt

(limited to 'usth/ICT2.7/P4L3 White-Box Testing Subtitles/21 - B&C Coverage Quiz Solution - lang_en_vs4.srt')

diff --git a/usth/ICT2.7/P4L3 White-Box Testing Subtitles/21 - B&C Coverage Quiz Solution - lang_en_vs4.srt b/usth/ICT2.7/P4L3 White-Box Testing Subtitles/21 - B&C Coverage Quiz Solution - lang_en_vs4.srt
deleted file mode 100644
index 2b6fe4b..0000000
--- a/usth/ICT2.7/P4L3 White-Box Testing Subtitles/21 - B&C Coverage Quiz Solution - lang_en_vs4.srt	
+++ /dev/null
@@ -1,67 +0,0 @@
-1
-00:00:00,190 --> 00:00:03,010
-Obviously there are many possible tests that we can use to
-
-2
-00:00:03,010 --> 00:00:05,910
-reach 100% branch and condition coverage. So I'm just going to show a
-
-3
-00:00:05,910 --> 00:00:08,740
-possible one, which is x equal to 3 and y is
-
-4
-00:00:08,740 --> 00:00:11,410
-equal to negative 2. If we specify this as case, you can
-
-5
-00:00:11,410 --> 00:00:14,900
-see that the overall condition is false, because neither x is
-
-6
-00:00:14,900 --> 00:00:17,990
-equal to 0 nor y is greater than 0. Therefore we will
-
-7
-00:00:17,990 --> 00:00:22,420
-follow the false, false branch, and achieve 100% branch and condition coverage
-
-8
-00:00:22,420 --> 00:00:25,400
-for this code. And we might require to be even more thorough,
-
-9
-00:00:25,400 --> 00:00:28,690
-that all the combinations of our conditions inside each
-
-10
-00:00:28,690 --> 00:00:31,790
-decision, inside each predicate, are tested. Which is what is
-
-11
-00:00:31,790 --> 00:00:36,010
-called, multiple condition coverage. But because of the way
-
-12
-00:00:36,010 --> 00:00:39,050
-this criterion is defined, it is combinatorial, becuse you have
-
-13
-00:00:39,050 --> 00:00:42,220
-to consider all the possible combinations of conditions. And
-
-14
-00:00:42,220 --> 00:00:45,210
-therefore it's extremely expensive, to the point of being impractical.
-
-15
-00:00:45,210 --> 00:00:47,610
-So instead of defining that criterion, we're going to find
-
-16
-00:00:47,610 --> 00:00:51,000
-another one which finds a good trade off between thoroughness
-
-17
-00:00:51,000 --> 00:00:52,815
-of the tests and their cost.
-- 
cgit 1.4.1