Updates to lecture numbers and slides for black box testing

Lectures/L33_WhiteBoxTestingContinued/WhiteBoxTestingContinued.tex

@@ -31,7 +31,7 @@
 \input{../def-beamer}
 \Draftfalse
 
-\newcommand{\topicTitle}{32 White Box Testing Continued (Ch.\ 6)}
+\newcommand{\topicTitle}{33 White Box Testing Continued (Ch.\ 6)}
 \ifDraft
 \newcommand{\topic}{\topicTitle~DRAFT}
 \else

Lectures/L34_BlackBoxTesting/BlackBoxTesting.tex

@@ -29,7 +29,7 @@
 \mode<presentation>{}
 
 \input{../def-beamer}
-\Drafttrue
+\Draftfalse
 
 \newcommand{\topicTitle}{34 Black Box Testing (Ch.\ 6)}
 \ifDraft
@@ -81,27 +81,22 @@ TBD
 \begin{itemize}
 
 \item Today's slide are partially based on slides by Dr.\ Wassyng
-\item No tutorials next week
-
-\item A4
-\bi
-\item Due April 3 at 11:59 pm
-\ei
+\item A4: Due April 9 at 11:59 pm
+\item Final tutorials on Friday, Apr 6
 
 \item Course evaluations
 \bi
-\item CS 2ME3: 28\%
-\item SE 2AA4: 40\%
-\item \href{https://evals.mcmaster.ca/login.php}{https://evals.mcmaster.ca/}
-\item Closes: 11:59 pm, Monday, April 10
-\ei
-
-% \item CAS poster and demo competition
+\item \href{https://evals.mcmaster.ca}{https://evals.mcmaster.ca}
+\item Start: Tues, Mar 27, 10:00 am
+\item Close: Tues, Apr 10, 11:59 pm
+\item {Your participation is highly valued}
+\item {Grade bonus for class participation}
 % \bi
-% \item April 6, 4 - 6 pm
-% \item ITB/201 (tentative)
-% \item 12 graduate student submissions
+% \item CS 2ME3 C02: 40\%
+% \item CS 2ME3 C01: 23\%
+% \item SE 2AA4 C01: 22\%
 % \ei
+\ei
 
 \end{itemize}
 }
@@ -111,6 +106,56 @@ TBD
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
+\begin{frame}
+\frametitle{Path-Coverage Criterion}
+
+\begin{itemize}
+\item Select a test set $T$ that traverses all paths from the initial to the final node of $P$s control flow
+\item It is finer than the previous kinds of coverage
+\item However, number of paths may be too large, or even infinite (see while loops)
+\item Loops
+\begin{itemize}
+\item Zero times (or minimum number of times)
+\item Maximum times
+\item Average number of times
+\end{itemize}
+\end{itemize}
+
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\begin{frame}
+\frametitle{The Infeasibility Problem}
+
+\begin{itemize}
+\item Syntactically indicated behaviours (statements, edges, etc.) are often impossible
+\item Unreachable code, infeasible edges, paths, etc.
+\item Adequacy criteria may be impossible to satisfy
+\begin{itemize}
+\item Manual justification for omitting each impossible test case
+\item Adequacy ``scores'' based on coverage - example 95 \% statement coverage
+\end{itemize}
+\end{itemize}
+
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
+\begin{frame}
+\frametitle{Further Problem}
+
+\begin{itemize}
+\item \structure{What if the code omits the implementation of some part of the
+    specification?}
+\item White box test cases derived from the code will ignore that part of the
+  specification!
+\end{itemize}
+
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
 \begin{frame}
 \frametitle{Black Box Testing Example}
 
@@ -506,7 +551,7 @@ dist & PointT & real & ~\\
   independent component
 \item This does not exploit incrementality
 \item Finding an ad-hoc way to take advantage of the hierarchy
-\item Think about testing PointT.java and PointMassT.java
+\item Think about testing PointT.py and PointMassT.py
 \end{itemize}
 \end{frame}
 

Lectures/L37_ReviewForFinal/ReviewForFinal.tex

@@ -31,7 +31,7 @@
 \input{../def-beamer}
 \Drafttrue
 
-\newcommand{\topicTitle}{37 Review for Final}
+\newcommand{\topicTitle}{36 Review for Final}
 \ifDraft
 \newcommand{\topic}{\topicTitle~DRAFT}
 \else