Differences

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

--- course_outline [2016/07/25 14:42] – 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 243: / Line 243: @@
 Please note this is a review session and not mandatory to attend. Folks how had assignment 3, please attend that we can cover A3 as well. We will go over the material in the course and discuss the final exam.
+Quiz 4, will be held in the PRISM lab during the class hours on July 28th (this is for both sections).
 ====== July 28 ======
+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.
+\\
+\\
+\\
+\\
+----
 ** Notes are taken from Dr. Ma and Dr. Castellucci classes.