Changed layout for more manageable volumes

1 files changed, 0 insertions, 387 deletions

diff --git a/2.4.lyx b/2.4.lyx
deleted file mode 100644
index 24255ac..0000000
--- a/2.4.lyx
+++ /dev/null
@@ -1,387 +0,0 @@
-#LyX 2.4 created this file. For more info see https://www.lyx.org/
-\lyxformat 620
-\begin_document
-\begin_header
-\save_transient_properties true
-\origin unavailable
-\textclass book
-\begin_preamble
-\input defs
-\end_preamble
-\use_default_options true
-\maintain_unincluded_children no
-\language english
-\language_package default
-\inputencoding utf8
-\fontencoding auto
-\font_roman "default" "default"
-\font_sans "default" "default"
-\font_typewriter "default" "default"
-\font_math "auto" "auto"
-\font_default_family default
-\use_non_tex_fonts false
-\font_sc false
-\font_roman_osf false
-\font_sans_osf false
-\font_typewriter_osf false
-\font_sf_scale 100 100
-\font_tt_scale 100 100
-\use_microtype false
-\use_dash_ligatures true
-\graphics default
-\default_output_format default
-\output_sync 0
-\bibtex_command default
-\index_command default
-\float_placement class
-\float_alignment class
-\paperfontsize default
-\spacing single
-\use_hyperref false
-\papersize default
-\use_geometry false
-\use_package amsmath 1
-\use_package amssymb 1
-\use_package cancel 1
-\use_package esint 1
-\use_package mathdots 1
-\use_package mathtools 1
-\use_package mhchem 1
-\use_package stackrel 1
-\use_package stmaryrd 1
-\use_package undertilde 1
-\cite_engine basic
-\cite_engine_type default
-\biblio_style plain
-\use_bibtopic false
-\use_indices false
-\paperorientation portrait
-\suppress_date false
-\justification true
-\use_refstyle 1
-\use_formatted_ref 0
-\use_minted 0
-\use_lineno 0
-\index Index
-\shortcut idx
-\color #008000
-\end_index
-\secnumdepth 3
-\tocdepth 3
-\paragraph_separation indent
-\paragraph_indentation default
-\is_math_indent 0
-\math_numbering_side default
-\quotes_style english
-\dynamic_quotes 0
-\papercolumns 1
-\papersides 1
-\paperpagestyle default
-\tablestyle default
-\tracking_changes false
-\output_changes false
-\change_bars false
-\postpone_fragile_content false
-\html_math_output 0
-\html_css_as_file 0
-\html_be_strict false
-\docbook_table_output 0
-\docbook_mathml_prefix 1
-\end_header
-
-\begin_body
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-exerc1[00]
-\end_layout
-
-\end_inset
-
-Considering COBOL data configurations as tree structures,
- are the data items listed by a COBOL programmer in preorder,
- postorder,
- or neither of these orders?
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-answer 
-\end_layout
-
-\end_inset
-
-They are in preorder.
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-exerc2[10]
-\end_layout
-
-\end_inset
-
-Comment about the running time of Algorithm A.
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-answer 
-\end_layout
-
-\end_inset
-
-It takes a constant amount of time for each data item read (assuming that accessing the symbol table takes constant time).
- There is also a loop to get out of a nested record,
- but each iteration of the loop takes out an item from the stack so we may consider that as part of processing such item.
- Therefore the running time is proportional to the number of data items in the input.
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-exerc8[10]
-\end_layout
-
-\end_inset
-
-Under what circumstances is 
-\begin_inset Quotes eld
-\end_inset
-
-
-\family typewriter
-MOVE CORRESPONDING 
-\begin_inset Formula $\alpha$
-\end_inset
-
- TO 
-\begin_inset Formula $\beta$
-\end_inset
-
-
-\family default
-
-\begin_inset Quotes erd
-\end_inset
-
- exactly the same as 
-\begin_inset Quotes eld
-\end_inset
-
-
-\family typewriter
-MOVE 
-\begin_inset Formula $\alpha$
-\end_inset
-
- TO 
-\begin_inset Formula $\beta$
-\end_inset
-
-
-\family default
-
-\begin_inset Quotes erd
-\end_inset
-
-,
- according to the definition in the text?
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-answer 
-\end_layout
-
-\end_inset
-
-When 
-\begin_inset Formula $\alpha$
-\end_inset
-
- or 
-\begin_inset Formula $\beta$
-\end_inset
-
- is an elementary item.
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-rexerc11[23]
-\end_layout
-
-\end_inset
-
-What additional links or changes in the strategy of the algorithms of the text could make Algorithm B or Algorithm C faster?
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-answer 
-\end_layout
-
-\end_inset
-
-
-\begin_inset Note Greyedout
-status open
-
-\begin_layout Plain Layout
-(I had to look up the solution.)
-\end_layout
-
-\end_inset
-
- One could make Algorithm C faster by storing sibling nodes in the table in lexicographical order,
- so step C3 would have a linear rather than quadratic complexity.
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-rexerc13[24]
-\end_layout
-
-\end_inset
-
-Give an algorithm to substitute for Algorithm A when the Data Table is to have the format shown in exercise 12.
-\end_layout
-
-\begin_layout Standard
-\begin_inset ERT
-status open
-
-\begin_layout Plain Layout
-
-
-\backslash
-answer 
-\end_layout
-
-\end_inset
-
-We remove the instructions that set 
-\family typewriter
-PARENT
-\family default
-,
- 
-\family typewriter
-CHILD
-\family default
-,
- 
-\family typewriter
-SIB
-\family default
-,
- and 
-\family typewriter
-NAME
-\family default
-,
- as those fields do not exist now (in particular,
- A6 disappears),
- and we implement 
-\begin_inset Formula $\mathtt{Q}\Leftarrow\mathtt{AVAIL}$
-\end_inset
-
- in step A2 by sequential allocation.
- We set the 
-\begin_inset Formula $\mathtt{SCOPE}$
-\end_inset
-
- of an entry when we remove the corresponding item from the stack in step A5.
- (Note that we do the same in A5 when 
-\begin_inset Formula $\mathtt{L1}=\mathtt{L}$
-\end_inset
-
- as when 
-\begin_inset Formula $\mathtt{L1}>\mathtt{L}$
-\end_inset
-
-,
- so we could just do those instructions unconditionally,
- then after removing the current stack item and before loading the next one we check if 
-\begin_inset Formula $\mathtt{L1}=\mathtt{L}$
-\end_inset
-
- and if so we go to A7,
- then if 
-\begin_inset Formula $\mathtt{L1}\geq\mathtt{L}$
-\end_inset
-
- we repeat,
- otherwise we report the error.)
-\end_layout
-
-\begin_layout Standard
-For this to work,
- we have to get the stack empty by the time the algorithm finishes,
- which we can do by setting 
-\begin_inset Formula $\mathtt{L}\gets0$
-\end_inset
-
- when the input is exhausted in step A2 and then terminate in step A7 when 
-\begin_inset Formula $\mathtt{L}=0$
-\end_inset
-
-.
-\end_layout
-
-\end_body
-\end_document