/
disposition.tex
116 lines (93 loc) · 3.12 KB
/
disposition.tex
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
%
% disposition.tex
%
% This document provides a summary of all of the exam question topics for
% the algorithms and datastructures course at the university of copenhagen
% department of computer science. It was written to serve as an excellent
% asset for the oral exam preparation, with most of the subtopics covered
% for any given exam topic in a concise and easily understandable format.
%
\documentclass[11pt,english]{book}
\usepackage{appendix} % appendices
\usepackage[linesnumbered]{algorithm2e} % algorithm pseudo-code
\usepackage{amsthm,amsmath,amssymb} % mathematical notation
\usepackage{fancyhdr} % page styling
\usepackage{float} % for floating figures
\usepackage{hyperref} % for making links
\usepackage{sectsty} % section styling
\usepackage{tikz} % for graphs
%\usepackage{authblk} % for authors
%========== meta data ==========%
\title
{
Algorithms \& Datastructures\\
\huge Disposition
}
\author
{
Casper B. Hansen
\thanks{Thanks to Mads Torhus and Adam Honor\'e for their contribution.} \\
Department of Computer Science \\
University of Copenhagen \\
\href{mailto:fvx507@alumni.ku.dk}{fvx507@alumni.ku.dk}
% \and
% Mads Torhus \\
% Department of Computer Science \\
% University of Copenhagen \\
% \href{mailto:abc123@alumni.ku.dk}{abc123@alumni.ku.dk}
% \and
% Adam Honore \\
% Department of Computer Science \\
% University of Copenhagen \\
% \href{mailto:qgf142@alumni.ku.dk}{qgf142@alumni.ku.dk}
}
\date{Version 1.0a\\last revision \today}
%========== settings ==========%
\setlength{\headheight}{15pt}
\sectionfont{\Large}
%========== macros ==========%
\newcommand{\sethead}[3]{\lhead{#1}\chead{#2}\rhead{#3}}
\newcommand{\setfeet}[3]{\lfoot{#1}\cfoot{#2}\rfoot{#3}}
\newtheorem{theorem}{Theorem}[section]
\newtheorem{lemma}[theorem]{Lemma}
\newtheorem{proposition}[theorem]{Proposition}
\newtheorem{corollary}[theorem]{Corollary}
% \newenvironment{proof}[1][Proof]{\begin{trivlist}
% \item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}}
\newenvironment{definition}[1][Definition]{\begin{trivlist}
\item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}}
\newenvironment{example}[1][Example]{\begin{trivlist}
\item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}}
\newenvironment{remark}[1][Remark]{\begin{trivlist}
\item[\hskip \labelsep {\bfseries #1}]}{\end{trivlist}}
% \newcommand{\qed}{\nobreak \ifvmode \relax \else
% \ifdim\lastskip<1.5em \hskip-\lastskip
% \hskip1.5em plus0em minus0.5em \fi \nobreak
% \vrule height0.75em width0.5em depth0.25em\fi}
%========== document ==========%
\begin{document}
\frontmatter
\maketitle
\thispagestyle{empty}
\tableofcontents
\newpage
\thispagestyle{empty}
% put citation here
\include{preamble}
\mainmatter
\include{divideandconquer}
\include{heaps}
\include{balancedbinarysearchtrees}
\include{dynamicprogramming}
\include{greedyalgorithms}
\include{amortizedcomplexity}
\include{minimumspanningtrees}
\include{shortestpathsalgorithms}
\appendix
\include{appendix/assignments}
\include{appendix/asymptoticnotation}
\include{appendix/proofs}
\include{appendix/equations}
\backmatter
\include{bibliography}
\end{document}