📄 timetable.html

📁 Data Structure Ebook
💻 HTML
字号:
<HTML><HEAD>
<TITLE>Data Structures and Algorithms: Timetable</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">
</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>Course Management</I></B></FONT>
</TD></TR>
</TABLE>
<P>

<H2>Workshops</H2>

Before starting on the assignment exercises,
it's worthwhile to consider the
<A HREF="exp_design.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/exp_design.html">design of experiments</A> first.
<P>
<H3>1999 Workshops</H3>
<UL>
<LI><A HREF="labs_1999.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/labs_1999.html">Lab Schedule 1999</A><BR>
<LI>There is <B>no</B> assignment 2. 
<LI><A HREF="a34_1999.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/a34_1999.html">Assignments 3 & 4 - 1999</A><BR>
<LI><a href="submit.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/submit.html">Submission instructions</a><BR>
</UL>

<H3>1998 Workshops</H3>
You might find that browsing through previous years' workshops and
the feedback notes helps you to determine what is expected!
<UL>
<A HREF="w1_1998.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/w1_1998.html">Workshop/Assignment 1 - 1998</A><BR>
<A HREF="w2_1998.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/w2_1998.html">Workshop/Assignment 2 - 1998</A><BR>
<A HREF="a34_1998.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/a34_1998.html">Assignments 3 & 4 - 1998</A><BR>
</UL>

<H3>1997 Workshops</H3>
<UL>
<LI><a href="w1_1997.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/w1_1997.html">Workshop 1 - Collections</a><BR>
<LI><a href="workshop2.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/workshop2.html">Workshop 2 - Searching</a><BR>
<LI><a href="w3_1997.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/w3_1997.html">Workshop 3 - QuickSort vs RadixSort</a><BR>
<LI><a href="w3_1997.html#workshop4" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/w3_1997.html#workshop4">Workshop 4 - Red-Black Trees</a><BR>
</UL>

<H3>1996 Workshops</H3>
<UL>
<LI><a href="workshop1.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/workshop1.html">Workshop 1 - Collections</a><BR>
<LI><a href="feedback1.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/feedback1.html">Workshop 1 - Feedback</a><BR>
<LI><a href="workshop2.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/workshop2.html">Workshop 2 - Searching</a><BR>
<LI><a href="feedback2.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/feedback2.html">Workshop 2 - Feedback</a><BR>
<LI><a href="workshop3.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/workshop3.html">Workshop 3 - Minimum Spanning Trees</a><BR>
<LI><a href="feedback3.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/feedback3.html">Workshop 3 - Feedback</a><BR>
<LI><a href="workshop3.html#w4" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/workshop3.html#w4">Workshop 4 - Minimum Spanning Trees</a><BR>
<LI><a href="feedback4.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Labs/feedback4.html">Workshop 4 - Feedback</a><BR>
</UL>

<H2>Past Exams</H2>
<A HREF="index-1.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Exams/index.html">1997</A><BR>

<H2>Tutorial Exercises</H2>
<OL>
 <LI> <A HREF="tutorials.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Tutorials/tutorials.html">Arrays or Linked Lists? Overheads, Complexity</A>
 <LI> <A HREF="tut2.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Tutorials/tut2.html">Asymptotic behaviour, ADT Design </A>
 <LI> <A HREF="tut3.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Tutorials/tut3.html">Sheet 3</A>
        <UL><LI>B+ trees
				<LI>stable sorting,
				<LI>a puzzle,
				<LI>AVL trees,
				<LI>dynamic memory allocation,
				<LI>equivalence classes
				</UL>
 <LI> <A HREF="tut4.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Tutorials/tut4.html">Sheet 4</A>
				<UL><LI>Heap Sort,
				<LI>Quick Sort,
				<LI>Radix Sort,
				<LI>Hash Tables,
				<LI>Search Trees
				</UL>
<LI> <A HREF="tut5.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Tutorials/tut5.html">Sheet 5</A>
							 <UL><LI>MST,
							</UL>
<LI> <A HREF="tut6.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/Tutorials/tut6.html">Sheet 6</A>
							 <UL><LI>Hard problems
							</UL>
</OL>


<P>

<TABLE CELLPADDING=5 WIDTH="100%" BGCOLOR="#00f0f0" CELLSPACING=4>
<TR>
<TD>Back to the <A HREF="ds_ToC.html" tppabs="http://www.ee.uwa.edu.au/~plsd210/ds/ds_ToC.html">Table of Contents</A>
</TD></TR></TABLE>
<SMALL>
&copy; <A HREF=mailto:morris@ee.uwa.edu.au>John Morris</A>, 1998
</SMALL>
</BODY>
</HTML>




<SMALL>
&copy; <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 + -