\documentclass{article}


\begin{document}
\section{McCabe complexity of a program}

The ``cyclomatic complexity" of a program is:
\ \ M = E-N+2P
\ \ M=E-N+2

e=amount of edges

N=amount of nodes

P=amount of connected components

theorem: In a strongly connected graph the cyclomantic number is equal to the maximum number of linearly independent circuits. 

but what does this represent??

about the homework: The second one is online. Write solutions in Microsoft document. Talk about a different coverage perspective than prime paths. McCabe complexity tells you how complex your program is. 

\textbf{circuit:} a path that starts and ends ath te same node, and never repeats an edge.
A set of circuits is \textbf{linear independent} if each has an edge that others do not have.

This coverage is not the same as edge covering, because you are just covering all linear independent cycles

\section{Black box testing}

\textbf{White box testing} is when you have access to the source code of the program and all its variables. \textbf{Black box testing} is when this is not the case. \textbf{Partition-based testing:} The input space can be split into equivalence classes such that inputs from the same partition/equivalence class lead to the same ind of output/effect. It then makes sense to require that every partition should be tested at leas onece. Even without source co, we can often propose a reasonable partitioning.
\end{document}