100 lines
2.3 KiB
TeX
100 lines
2.3 KiB
TeX
|
\documentclass[10pt]{classPres}
|
||
|
|
\usepackage{tkz-fct}
|
||
|
|
|
||
|
|
\author{}
|
||
|
|
\title{}
|
||
|
|
\date{}
|
||
|
|
|
||
|
|
\begin{document}
|
||
|
|
\begin{frame}{Questions flashs}
|
||
|
|
\begin{center}
|
||
|
|
\vfill
|
||
|
|
Terminale ES-L
|
||
|
|
\vfill
|
||
|
|
Un peu moins d'une minute par calcul
|
||
|
|
\vfill
|
||
|
|
\tiny \jobname
|
||
|
|
\end{center}
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}{Calcul 1}
|
||
|
|
Dériver
|
||
|
|
\[
|
||
|
|
(2x+1)(x-2) =
|
||
|
|
\]
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}{Calcul 2}
|
||
|
|
Calculer $P(E\cap \overline{F})$
|
||
|
|
\begin{center}
|
||
|
|
\begin{tikzpicture}[xscale=2, grow=right]
|
||
|
|
\node {.}
|
||
|
|
child {node {$F$}
|
||
|
|
child {node {$E$}
|
||
|
|
edge from parent
|
||
|
|
node[below] {0.8}
|
||
|
|
}
|
||
|
|
child {node {$\overline{E}$}
|
||
|
|
edge from parent
|
||
|
|
node[above] {0.2}
|
||
|
|
}
|
||
|
|
edge from parent
|
||
|
|
node[below] {0.3}
|
||
|
|
}
|
||
|
|
child[missing] {}
|
||
|
|
child { node {$\overline{F}$}
|
||
|
|
child {node {$E$}
|
||
|
|
edge from parent
|
||
|
|
node[below] {0.9}
|
||
|
|
}
|
||
|
|
child {node {$\overline{E}$}
|
||
|
|
edge from parent
|
||
|
|
node[above] {0.1}
|
||
|
|
}
|
||
|
|
edge from parent
|
||
|
|
node[above] {0.7}
|
||
|
|
} ;
|
||
|
|
\end{tikzpicture}
|
||
|
|
\end{center}
|
||
|
|
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}{Calcul 3}
|
||
|
|
Compléter le tableau de signe pour la fonction
|
||
|
|
\[
|
||
|
|
f(x) = x^2 + 2x - 3
|
||
|
|
\]
|
||
|
|
\begin{center}
|
||
|
|
\begin{tikzpicture}[baseline=(a.north)]
|
||
|
|
\tkzTabInit[lgt=2,espcl=2]{$x$/1,$f(x)$/1}{$-\infty$, $\cdots$, $\cdots$, $+\infty$}
|
||
|
|
\tkzTabLine{, + , z, -, z, +, }
|
||
|
|
\end{tikzpicture}
|
||
|
|
\end{center}
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}[fragile]{Calcul 4}
|
||
|
|
\begin{center}
|
||
|
|
\begin{minipage}{0.7\linewidth}
|
||
|
|
\begin{algorithm}[H]
|
||
|
|
\SetAlgoLined
|
||
|
|
$u \leftarrow 2$ \;
|
||
|
|
$n \leftarrow 0$ \;
|
||
|
|
\Tq{$u < 10$}{
|
||
|
|
$u \leftarrow u*2$ \;
|
||
|
|
$n \leftarrow n+1$ \;
|
||
|
|
}
|
||
|
|
\end{algorithm}
|
||
|
|
\end{minipage}
|
||
|
|
\end{center}
|
||
|
|
Combien vaut $n$ à la fin de cet algorithme?
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}{Fin}
|
||
|
|
\begin{center}
|
||
|
|
On retourne son papier.
|
||
|
|
\end{center}
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
|
||
|
|
\end{document}
|