Updates to MIS lecture, add a stetch of graph discussion

Lectures/Deadlines.tex

@@ -71,14 +71,14 @@ Unit VnV/Implement & Week 12 & Week of Apr 3\\
 %\item \textbf{Feb 13: Fasil, Hunter, Phil, Adrian}
 %\item \textbf{Feb 16: Gaofeng, Al, Seyed Ali, Xinyu}
 %\ei
-\item Proof of Concept Demonstrations (L14) (20 min)
-\bi
-\item \textbf{Mar 1: Cynthia, Valerie, Waqar, Yi-Leng}
-\ei
+% \item Proof of Concept Demonstrations (L14) (20 min)
+% \bi
+% \item \textbf{Mar 1: Cynthia, Valerie, Waqar, Yi-Leng}
+% \ei
 \item MG+MIS Present (L17, L18) (20 minutes)  %(Drasil SRS Code)
 \bi
-\item {Mar 12: Nada, Morteza, Kim Ying, Atiyeh}
-\item {Mar 15: Fatemeh, Yiding, Tanya, Volunteer?}
+\item \textbf{Mar 12: Nada, Morteza, Kim Ying, Atiyeh}
+\item \textbf{Mar 15: Fatemeh, Yiding, Tanya, Volunteer?}
 \ei
 \ei
 

Lectures/L15_MIS/MIS.tex

@@ -75,6 +75,7 @@
 % \item L17 - POC + MG Presentations
 % \item L18 - MIS Presentations
 % \ei
+\item Friday's class in ITB/201
 \item Mathematical review
 \begin{itemize}
   \item \cite{HoffmanAndStrooper1995}
@@ -99,16 +100,12 @@
 \begin{frame}
 \frametitle{MG and MIS Presentations}
 \begin{itemize}
-\item MG Presentation
+\item MG+MIS Presentation
 \bi
 \item Likely Changes
 \item Decomposition Hierarchy Figure
 \item Uses Relation Hierarchy
 \item Secrets of Most Important Modules
-\ei
-\item MIS Presentations
-\bi
-\item Uses Relation Hierarchy
 \item Syntax
 \bi
 \item Access Programs (types of inputs and outputs)
@@ -140,6 +137,18 @@
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
+\begin{frame}
+\frametitle{Emphasis}
+\begin{itemize}
+\item Math notation (stoichiometry example on Friday)
+\item GUI modules (environment variables)
+\item Types of modules
+\item Abstract Data Types (graph example)
+\end{itemize}
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
 % \begin{frame}
 % \frametitle{Finish Previous Day's Discussion}
 % \begin{itemize}
@@ -975,6 +984,24 @@ seq\_init():
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
+\begin{frame}
+\frametitle{Graph Example}
+\begin{itemize}
+\item Assume need to calculate degree and shortest path, all edges of length 1
+\item Problems with working directly with adjacency matrix
+\begin{itemize}
+  \item Data structure changes - only need half of matrix, binary instead of integer
+  \item What if distance between connected nodes is not 1?
+  \item What if you have information to store with the nodes?
+  \item What if you need more calculations on the graph?
+\end{itemize}
+\item Abstract version, start from G = (V, E)
+\item Maybe too abstract, try vertices are natural numbers
+\end{itemize}
+\end{frame}
+
+%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+
 \begin{frame}
 \frametitle{Appendix: Information Hiding Examples}
 \begin{itemize}