1 \documentclass{article} |
1 \documentclass{article} |
2 \usepackage{charter} |
2 \usepackage{charter} |
3 \usepackage{hyperref} |
3 \usepackage{hyperref} |
|
4 \usepackage{amssymb} |
4 |
5 |
5 \begin{document} |
6 \begin{document} |
6 |
7 |
7 \section*{Homework 1} |
8 \section*{Homework 1} |
8 |
9 |
9 \begin{enumerate} |
10 \begin{enumerate} |
10 \item {\bf (Optional)} If you want to look at code presented in the lectures, install Scala available from |
11 \item {\bf (Optional)} If you want to look at code presented in the lectures, install the |
|
12 Scala programming language available (for free) from |
11 \begin{center} |
13 \begin{center} |
12 \url{http://www.scala-lang.org} |
14 \url{http://www.scala-lang.org} |
13 \end{center} |
15 \end{center} |
14 |
16 |
15 \noindent |
17 \item {\bf (Optional)} Have a look at the crawler programs. |
16 The web-applications were written in Scala using the Play Framework available from |
18 Can you find a usage for them in your daily programming life? |
17 \begin{center} |
|
18 \url{http://www.playframework.org} |
|
19 \end{center} |
|
20 |
19 |
21 \item Practice thinking like an attacker. Assume the following situation: |
20 \item In the context of the course, what is meant by the term \emph{language}? |
22 \begin{quote}\it |
|
23 Prof.~V.~Nasty gives the following final exam question (closed books, closed notes):\bigskip |
|
24 |
21 |
25 \noindent |
22 \item Give the definition for regular expressions. What is the meaning of a |
26 \begin{tabular}{@ {}l} |
23 regular expression? |
27 Write the first 100 digits of pi:\\ |
|
28 3.\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_ |
|
29 \end{tabular} |
|
30 \end{quote} |
|
31 |
24 |
32 \noindent |
25 \item Assume the concatenation operation of two strings is written as $s_1 @ s_2$. |
33 Think of ways how you can cheat in this exam? |
26 Define the operation of \emph{concatenating} two sets of strings. |
34 |
27 |
35 \item Explain what hashes and salts are. Describe how they can be used for ensuring data integrity and |
28 \item How is the power of a language defined? (Hint: There are two rules, one for $\_\!\_^0$ and |
36 storing password information. |
29 one for $\_\!\_^{n+1}$.) |
37 |
30 |
38 \item What are good uses of cookies (browser cookies)? |
31 \item Given the regular expressions $r_1 = \epsilon$ and $r_2 = \varnothing$ and $r_3 = a$. |
|
32 How many strings can the regular expressions $r_1^*$, $r_2^*$ and $r_3^*$ each match? |
39 |
33 |
40 \end{enumerate} |
34 \end{enumerate} |
41 |
35 |
42 \end{document} |
36 \end{document} |
43 |
37 |