Skip to content
Snippets Groups Projects
Commit 4c06235f authored by Martin Mareš's avatar Martin Mareš
Browse files

Intro renamed to Preliminaries

parent b6236e9a
No related branches found
No related tags found
No related merge requests found
File moved
...@@ -11,9 +11,7 @@ ...@@ -11,9 +11,7 @@
\noalign{\vskip-\smallskipamount} \noalign{\vskip-\smallskipamount}
}}$$} }}$$}
\chapter[intro]{Introduction} \chapter[prelim]{Preliminaries}
\section{Examples of data structures}
Generally, a~data structure is a~``black box'', which contains some data and 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 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 ...@@ -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 supported and their semantics) from its \df{implementation} (i.e., the layout of data
in memory and procedures handling the operations). in memory and procedures handling the operations).
\section{Examples of data structures}
\subsection{Queues and stacks} \subsection{Queues and stacks}
A~\df{queue} is a~sequence of items, which supports the following A~\df{queue} is a~sequence of items, which supports the following
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment