From 4c06235f929b7150d33363bdbf2274a64d2fa23f Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Sat, 9 Mar 2019 10:48:46 +0100
Subject: [PATCH] Intro renamed to Preliminaries
---
{01-intro => 01-prelim}/Makefile | 0
01-intro/intro.tex => 01-prelim/prelim.tex | 6 +++---
2 files changed, 3 insertions(+), 3 deletions(-)
rename {01-intro => 01-prelim}/Makefile (100%)
rename 01-intro/intro.tex => 01-prelim/prelim.tex (99%)
diff --git a/01-intro/Makefile b/01-prelim/Makefile
similarity index 100%
rename from 01-intro/Makefile
rename to 01-prelim/Makefile
diff --git a/01-intro/intro.tex b/01-prelim/prelim.tex
similarity index 99%
rename from 01-intro/intro.tex
rename to 01-prelim/prelim.tex
index 978cbd9..59856ad 100644
--- a/01-intro/intro.tex
+++ b/01-prelim/prelim.tex
@@ -11,9 +11,7 @@
\noalign{\vskip-\smallskipamount}
}}$$}
-\chapter[intro]{Introduction}
-
-\section{Examples of data structures}
+\chapter[prelim]{Preliminaries}
Generally, a~data structure is a~``black box'', which contains some data and
allows \df{operations} on the data. Some operations are \em{queries} on the current
@@ -27,6 +25,8 @@ We usually separate the \df{interface} of the structure (i.e., the set of operat
supported and their semantics) from its \df{implementation} (i.e., the layout of data
in memory and procedures handling the operations).
+\section{Examples of data structures}
+
\subsection{Queues and stacks}
A~\df{queue} is a~sequence of items, which supports the following
--
GitLab