Differences

This shows you the differences between two versions of the page.

--- course_outline [2016/08/03 04:04] – navid
+++ course_outline [2016/08/03 04:07] (current) – navid
@@ Line 210: / Line 210: @@
 [[http://www.eecs.yorku.ca/course_archive/2015-16/F/2030/slides/12_Implementing_Binary_Trees.pdf|Notes]].
-[[http://www.eecs.yorku.ca/course_archive/2015-16/F/2030/code/BinarySearchTree.java|Here]] is a simple sample code for a binary search tree discussed in the class.
+[[http://www.eecs.yorku.ca/course_archive/2015-16/S/2030/000examples.tar.gz|Here]] is a simple sample code for a binary search tree discussed in the class (listed under BSTAndMergeSort folder).
 In case you want to know more about basics of Graphs, read the first few slides of Jeff and Andy's notes [[http://www.eecs.yorku.ca/~jeff/courses/2011/syllabus/2011-08-Graphs.pptx|here]]
@@ Line 248: / Line 248: @@
 ====== July 28 ======
-Quiz 4, will be held __**in the PRISM lab during the class hours**__ on July 28th (this is for both sections).
+Quiz 4, will be held in the PRISM lab during the class hours on July 28th (this is for both sections).
 [[http://www.eecs.yorku.ca/course_archive/2015-16/S/2030/000examples.tar.gz|Here]] is the updated examples including BSTAndMergeSort.