\documentclass[a4paper,12pt]{article}

\usepackage[english]{babel}
\usepackage[latin1]{inputenc}
\usepackage[dvips]{graphicx}
\usepackage{url}
\usepackage{amsmath}

\parindent 0mm
\parskip 3mm

\pagestyle{empty}

\begin{document}

{\textbf{T-122.103 EXERCISE 6/2003}}

In T4 on 14 November 2003 at 12:15--14 o'clock. 

Recall the notation for the sets of variables: $ABC=\{A,B,C\}$ etc.

\begin{enumerate}

\item
Investigate the data set ``smallilmo'' to see if you can find any
fragments of order of length 3 from it.

\item
Given a 0/1 data set with $n$ rows and where the attributes are
independent and 1 with probability $p$, what is the expected number of
violations of a fragment $A<B<C$.

\item
We considered in the lectures the greedy approximation algorithm for
the set cover problem. What other types or additional heuristics
could one use for this task?


\end{enumerate}


\end{document}


