Algorithms/main.tex at main · Concise-Works/Algorithms · GitHub

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
\documentclass{memoir}
\input{Configs/configs}

\title{\textbf{Computer Science Fundamentals:}\\
\Large{Intro to Algorithms, Systems, \& Data Structures}}
\author{Christian J. Rudder}
\date{October 2024}

\chapterstyle{dash} % Chapter style

\begin{document}

\maketitle
\setcounter{secnumdepth}{2}
\setcounter{tocdepth}{3}

\tableofcontents

% Intentionally left blank
\newpage
\thispagestyle{empty}
\mbox{}
\vfill
\begin{center}
    \textit{This page is left intentionally blank.}
\end{center}
\vfill
\newpage


\input{Sections/preface.tex}
\chapter*{Prerequisites}

\input{Sections/pre}


\chapter{Memory Management}
\input{Sections/cpu/cpu}
\input{Sections/stacks_heaps/stack_heaps}
\input{Sections/hash/hash}
\input{Sections/virt/virt}

\chapter{Complexity Theory}
\input{Sections/asymp}

\chapter{Computational Algorithms}
\input{Sections/comp/info/info}
\input{Sections/comp/info_effic/info_effic}
\input{Sections/comp/comp}
\input{Sections/comp/large}
\input{Sections/comp/effic}

\chapter{Circuits and Logic}
\input{Sections/circuits/circuits}
\input{Sections/circuits/cmos}
\input{Sections/circuits/comb/comb}
\input{Sections/circuits/state/state}

\chapter{Proving Algorithms}
\input{Sections/prove/prove}

\chapter{Graphs and Trees}
\input{Sections/graphs/graphs}
\input{Sections/graphs/bfs_dfs}
\input{Sections/graphs/search/search}
\input{Sections/graphs/dag/dag}


\chapter{Scheduling}
\input{Sections/sched/interval/interval}
\input{Sections/sched/priority/pq}
\input{Sections/sched/late/late}

\chapter{Greedy Algorithms}
\input{Sections/dstra/dstra}
\input{Sections/spanning/spanning}

\chapter{Evaluating Recursive Algorithms}
\input{Sections/recurs/eval}


\chapter {Dynamic Programming}
\input{Sections/dp/dp}
\input{Sections/dp/bford}

\chapter{Network Flow}
\input{Sections/net/net}

\chapter{Computational Hardness}
\input{Sections/hard/hard}

\chapter{Algorithms Cheat-Sheet}
\input{Sections/summary/summary}

\bibliographystyle{plain}
\bibliography{ref}
\end{document}