summaryrefslogtreecommitdiff
path: root/day2
diff options
context:
space:
mode:
authorShantanu Choudhary2009-10-08 23:16:13 +0530
committerShantanu Choudhary2009-10-08 23:16:13 +0530
commit0b89a9ad757262323b9bcb1e1c303de4447305a5 (patch)
tree9eb1ea10d121299c33eea952e3f6c68a53af0758 /day2
parent7e1335294c63d326a951c0fc5ecf4ee308583f8f (diff)
downloadworkshops-0b89a9ad757262323b9bcb1e1c303de4447305a5.tar.gz
workshops-0b89a9ad757262323b9bcb1e1c303de4447305a5.tar.bz2
workshops-0b89a9ad757262323b9bcb1e1c303de4447305a5.zip
Added links.tex, compilation of various links.
Diffstat (limited to 'day2')
-rw-r--r--day2/session1.tex7
-rw-r--r--day2/session2.tex14
-rw-r--r--day2/session3.tex2
-rw-r--r--day2/tda.tex13
4 files changed, 27 insertions, 9 deletions
diff --git a/day2/session1.tex b/day2/session1.tex
index 1d80bd4..b96a7ff 100644
--- a/day2/session1.tex
+++ b/day2/session1.tex
@@ -803,4 +803,11 @@ title('triangular head; scale '\
\end{columns}
\inctime{20}
\end{frame}
+\begin{frame}{Summary}
+ \begin{itemize}
+ \item Basics of Numpy.
+ \item Array operations.
+ \item Plotting in 2D.
+ \end{itemize}
+\end{frame}
\end{document}
diff --git a/day2/session2.tex b/day2/session2.tex
index 9a02146..5af1818 100644
--- a/day2/session2.tex
+++ b/day2/session2.tex
@@ -426,8 +426,18 @@
Make a plot of $\frac{dx}{dt}$ vs. $x$.
\inctime{30}
\end{frame}
-
-
+\begin{frame}{Summary}
+ \begin{itemize}
+ \item Advanced NumPy
+ \item SciPy
+ \begin{itemize}
+ \item Linear Algebra
+ \item Integration
+ \item Interpolation
+ \item Signal and Image processing
+ \end{itemize}
+ \end{itemize}
+\end{frame}
\end{document}
- Numpy arrays (30 mins)
diff --git a/day2/session3.tex b/day2/session3.tex
index 8154c74..b1221e5 100644
--- a/day2/session3.tex
+++ b/day2/session3.tex
@@ -194,7 +194,7 @@
\section{Tools at your disposal}
-\subsection{Mayavi2.0}
+\subsection{Mayavi2}
\begin{frame}
\frametitle{Introduction to Mayavi}
diff --git a/day2/tda.tex b/day2/tda.tex
index ae39f4a..664eed3 100644
--- a/day2/tda.tex
+++ b/day2/tda.tex
@@ -261,7 +261,7 @@ def test_function_ignore_cases_words():
\begin{frame}[fragile]
\frametitle{Exercise}
- Based on Euclid's theorem:
+ Based on Euclid's algorithm:
$gcd(a,b)=gcd(b,b\%a)$\\
gcd function can be written as:
\begin{lstlisting}
@@ -269,14 +269,15 @@ def test_function_ignore_cases_words():
if a%b == 0: return b
return gcd(b, a%b)
\end{lstlisting}
+ \vspace*{-0.15in}
\begin{block}{Task}
- For given gcd implementation write
- at least two tests.
- \end{block}
- \begin{block}{Task}
- Write a non recursive implementation
+ \begin{itemize}
+ \item Write at least
+ two tests for above mentioned function.
+ \item Write a non recursive implementation
of gcd(), and test it using already
written tests.
+ \end{itemize}
\end{block}
\inctime{15}