📄 ds_toc.html
字号:
<HTML><HEAD>
<TITLE>Data Structures and Algorithms: Table of Contents</TITLE>
<META name="description" content="Data Structures and Algorithms Course Notes,
PLDS210 University of Western Australia">
<META name="keywords" content="data structures,algorithms,abstract data types,
computer science,course notes,
searching,sorting,complexity,graph algorithms,
priority queues,red-black trees,huffman encoding,
optimal binary search tree,intractable problems,
travelling salesman,Bridges of Konigsberg,Eulerian path,
Hamiltonian path">
</HEAD>
<BODY BGCOLOR="#ffffff">
<TABLE BGCOLOR="#00c0f0" WIDTH="100%" CELLSPACING=0 CELLPADDING=0>
<TR BGCOLOR="#00f0f0"><TD ALIGN=right>
<FONT FACE=helvetica SIZE=+1><I>Data Structures and Algorithms</I></FONT>
</TD></TR>
<TR><TD><FONT FACE=helvetica SIZE=+2><B><I>Table of Contents</I></B></FONT>
</TD></TR>
</TABLE>
<P>
<A HREF="plds210.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/plds210.html">Course Outline</A>
<P>
<OL>
<LI><a href="introduction.html#Introduction" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/introduction.html#Introduction">Introduction</a>
<LI><a href="strategies.html#Strategies" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/strategies.html#Strategies">Programming Strategies</a>
<UL>
<LI><a href="objects.html#objects" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/objects.html#objects">2.1 Objects and ADTs</a>
<UL>
<LI><a href="objects.html#collections" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/objects.html#collections">2.1.1 An Example: Collections</a>
</UL>
<LI><a href="objects.html#constructors" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/objects.html#constructors">2.2 Constructors and destructors</a>
<LI><a href="objects.html#data_structure" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/objects.html#data_structure">2.3 Data Structure</a>
<LI><a href="objects.html#methods" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/objects.html#methods">2.4 Methods</a>
<LI><a href="objects.html#pre-conditions" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/objects.html#pre-conditions">2.5 Pre- and post-conditions</a>
<LI><A href="objects.html#conventions" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/objects.html#conventions">2.6 C conventions</a>
<LI><a href="errors.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/errors.html">2.7 Error Handling</a>
<LI><A HREF="prog_languages.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/prog_languages.html">2.8 Some Programming Language Notes</A>
</UL>
<LI><A HREF="arrays.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/arrays.html">Data Structures</A>
<UL>
<LI><a href="arrays.html#arrays" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/arrays.html#arrays">3.1 Arrays</a>
<LI><a href="lists.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/lists.html">3.2 Lists</a>
<LI><a href="stacks.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/stacks.html">3.3 Stacks</a>
<UL>
<LI><a href="stacks.html#stack-frames" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/stacks.html#stack-frames">3.3.1 Stack Frames</a>
</UL>
<LI><a href="recursion.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/recursion.html">3.4 Recursion</a>
<UL>
<LI><a href="recursion.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/recursion.html">3.4.1 Recursive Functions</a>
<LI><a href="recursion.html#factorial" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/recursion.html#factorial">3.4.2 Example: Factorial</a>
</UL>
</UL>
<LI><a href="searching.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/searching.html">Searching</a>
<UL>
<LI><a href="searching.html#seq-search" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/searching.html#seq-search">4.1 Sequential Searches</a>
<LI><a href="searching.html#binary-search" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/searching.html#binary-search">4.2 Binary Search</a>
<LI><a href="trees.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/trees.html">4.3 Trees</a>
</UL>
<LI><a href="complexity.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/complexity.html">Complexity</a>
<UL><LI><a href="complexity.ps" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/latex/complexity.ps">5. Complexity (PS)</a></UL>
<LI><a href="queues.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/queues.html">Queues</a>
<UL>
<LI><a href="queues.html#priority" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/queues.html#priority">6.1 Priority Queues</a>
<LI><a href="heaps.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/heaps.html">6.2 Heaps</a>
</UL>
<LI><a href="sorting.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/sorting.html">Sorting</a>
<UL>
<LI><a href="sorting.html#bubble" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/sorting.html#bubble">7.1 Bubble</a>
<LI><a href="heapsort.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/heapsort.html">7.2 Heap</a>
<LI><a href="qsort.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/qsort.html">7.3 Quick</a>
<LI><a href="binsort.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/binsort.html">7.4 Bin</a>
<LI><a href="radixsort.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/radixsort.html">7.5 Radix</a>
</UL>
<LI><a href="search_trees.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/search_trees.html">Searching Revisited</a>
<UL>
<LI><a href="red_black.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/red_black.html">8.1 Red-Black trees</a>
<LI><a href="AVL.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/AVL.html">8.1.1 AVL trees</a>
<LI><a href="n_ary_trees.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/n_ary_trees.html">8.2 General n-ary trees</a>
<LI><a href="hash_tables.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/hash_tables.html">8.3 Hash Tables</a>
</UL>
<LI><A HREF="dynamic.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/dynamic.html">Dynamic Algorithms</A>
<UL>
<LI><a href="dynamic.html#fibonacci" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/dynamic.html#fibonacci">9.1 Fibonacci Numbers</a>
<LI><a href="binom.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/binom.html">9.2 Binomial Coefficients</a>
<LI><a href="opt_bin.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/opt_bin.html">9.3 Optimal Binary Search Trees</a>
<LI><a href="mat_chain.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/mat_chain.html">9.4 Matrix Chain Multiplication</a>
<LI><a href="lcom_subseq.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/lcom_subseq.html">9.5 Longest Common Subsequence</a>
<LI><a href="opt_tri.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/opt_tri.html">9.6 Optimal Triangulation</a>
</UL>
<LI><a href="mst.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/mst.html">Graphs</a>
<UL>
<LI><a href="mst.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/mst.html">10.1 Minimum Spanning Tree</a>
<LI><a href="dijkstra.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/dijkstra.html">10.2 Dijkstra's Algorithm</a>
</UL>
<LI><a href="huffman.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/huffman.html">Huffman Encoding</a>
<LI><a href="fft.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/fft.html">FFT</a>
<LI><a href="hard.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/hard.html">Hard or Intractable Problems</a>
<UL>
<LI><a href="hard.html#euler" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/hard.html#euler">13.1 Eulerian or Hamiltonian Paths</a>
<LI><a href="hard.html#TSP" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/hard.html#TSP">13.2 Travelling Salesman's Problem</a>
</UL>
<LI><A HREF="games.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/games.html">Games</A>
</UL>
<H3>Appendices</H3>
<OL TYPE=A>
<LI><A HREF="ANSI_C.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/ANSI_C.html">ANSI C</A>
<LI><A HREF="listings.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/listings.html">Source code listings</A>
<LI><A HREF="avail.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/avail.html">Getting these notes</A>
</OL>
<H3>Slides</H3>
<UL>
<A HREF="index.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/ppt/index.html">Slides</A> from 1998 lectures (PowerPoint).
</UL>
<H3><A HREF="timetable.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/timetable.html">Course Management</A></H3>
<UL>
<LI>Key Points from Lectures
<LI>Workshops
<LI>Past Exams
<LI>Tutorials
</UL>
<H2>Texts</H2>
<A HREF="texts.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/texts.html">Texts available in UWA library</A><BR>
<A HREF="www_ds.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/www_ds.html">Other on-line courses and texts</A><BR>
<A HREF="alg_anim.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/alg_anim.html">Algorithm Animations</A><BR>
<P>
<SMALL>
© <A HREF=mailto:morris@ee.uwa.edu.au>John Morris</A>, 1998
</SMALL>
</BODY>
</HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -