Differences

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

teaching:csci2100:2014 [2015/03/30 13:55]
hyzhang
teaching:csci2100:2014 [2017/03/09 19:22] (current)
jnzhang
Line 2: Line 2:
==== Breaking News ==== ==== Breaking News ====
 +  - <hi yellow>** 19 April 2015**</hi>. The last tutorial will be given at 5:30 pm, 20 April in ERB 407.
 +  - <hi yellow>** 15 April 2015**</hi>. <hi red>**IMPORTANT & URGENT**</hi> The schedule of make-up exam for students who did not solve any problems during programming midterm is out. It will be held between 6:30 pm - 8:00 pm, April 17, Friday, 2015 in SHB 924. We will provide three straightforward problems and you only need to solve one of your choice to pass the exam. The details are sent to your email (s11550XXXXX@mailserv.cuhk.edu.hk). If you have time conflict or other issues, please contact Mr. ZHANG Hongyi or Mr. HUANG Xin as soon as possible. We will try our best to make proper arrangement for you. Thanks.
 +  - <hi yellow>** 8 April 2015**</hi>. 1) The deadline for HW5 is postponed to next Friday, April 17, 2015. 2) The tutorial on April 15 is canceled. The content of tutorial of next Monday will be the same as this Wed, i.e., April 8.
  - <hi yellow>** 29 March 2015**</hi>. We've prepared an archive of sample code for almost all the data structures you've learnt by now. Please download it from the syllabus frame. We recommend you print it and bring it to the midterm exam. You can find the original files [[http://users.cis.fiu.edu/~weiss/dsaa_c2e/files.html|here]]. We've combined each data structure into one single file for your convenience.   - <hi yellow>** 29 March 2015**</hi>. We've prepared an archive of sample code for almost all the data structures you've learnt by now. Please download it from the syllabus frame. We recommend you print it and bring it to the midterm exam. You can find the original files [[http://users.cis.fiu.edu/~weiss/dsaa_c2e/files.html|here]]. We've combined each data structure into one single file for your convenience.
  - <hi yellow>** 26 March 2015**</hi>. In WA4, Problem 6.6(2), note that median of three, we take the median of first, middle and last element as the pivot, then swap the first and pivot, after this, the partition is the same as the code in the lecture notes. The code in lecture notes (Slide 65) will split the array into three parts, left part less or equal to pivot, pivot and right part larger than pivot. Please note that the goal in Slide 66 is not corresponding to the code in Slide 65, the goal should be < =p, p, >p which is corresponding to the code in Slide 65.   - <hi yellow>** 26 March 2015**</hi>. In WA4, Problem 6.6(2), note that median of three, we take the median of first, middle and last element as the pivot, then swap the first and pivot, after this, the partition is the same as the code in the lecture notes. The code in lecture notes (Slide 65) will split the array into three parts, left part less or equal to pivot, pivot and right part larger than pivot. Please note that the goal in Slide 66 is not corresponding to the code in Slide 65, the goal should be < =p, p, >p which is corresponding to the code in Slide 65.
Line 93: Line 96:
|  4     |  26/1  |  1. **Lists, Stacks and Queues** \\  2. **Tree Data Structures and Algorithms**\\  \\  [[https://www.dropbox.com/s/4ydr757z8slf83m/CSCI2100-04-Trees.pdf?dl=0|04-Trees.pdf]]  |  Lists, Stacks and Queues in C  |   * **Reading assignment**: Chapter 3 of Weiss'97\\  \\  * **PA #2**\\ <hi yellow>**From 12:00 am, Monday, Feb 2, 2015 to 11:59 pm, Sunday, Feb 8, 2015**</hi>\\ <hi lightblue>** 2.16 (Problem 1),  2.18 (Problem 2, a small one, n< =1,000), 2.18 (Problem 3, a large one, n< =1,000,000, use "long long" and "%lld", see announcement for details)**</hi>   |  TBA   | |  4     |  26/1  |  1. **Lists, Stacks and Queues** \\  2. **Tree Data Structures and Algorithms**\\  \\  [[https://www.dropbox.com/s/4ydr757z8slf83m/CSCI2100-04-Trees.pdf?dl=0|04-Trees.pdf]]  |  Lists, Stacks and Queues in C  |   * **Reading assignment**: Chapter 3 of Weiss'97\\  \\  * **PA #2**\\ <hi yellow>**From 12:00 am, Monday, Feb 2, 2015 to 11:59 pm, Sunday, Feb 8, 2015**</hi>\\ <hi lightblue>** 2.16 (Problem 1),  2.18 (Problem 2, a small one, n< =1,000), 2.18 (Problem 3, a large one, n< =1,000,000, use "long long" and "%lld", see announcement for details)**</hi>   |  TBA   |
|  5     |  2/2  |  **Tree Data Structures and Algorithms**   |  Queues and Trees in C  |   * **Reading assignment**: Chapter 4 of Weiss'97\\  \\  * **WA #3** {{:teaching:csci2100:hw_1.19.pdf|Version 1.19}}\\ <hi yellow>**Due on or before 5:00 pm, Tuesday, Feb 17, 2015** </hi>  \\ * <hi lightblue>**3.3 (2); 3.9; 3.10; 3.11; 3.18; 5.1; 5.2;** </hi>\\   |  TBA   | |  5     |  2/2  |  **Tree Data Structures and Algorithms**   |  Queues and Trees in C  |   * **Reading assignment**: Chapter 4 of Weiss'97\\  \\  * **WA #3** {{:teaching:csci2100:hw_1.19.pdf|Version 1.19}}\\ <hi yellow>**Due on or before 5:00 pm, Tuesday, Feb 17, 2015** </hi>  \\ * <hi lightblue>**3.3 (2); 3.9; 3.10; 3.11; 3.18; 5.1; 5.2;** </hi>\\   |  TBA   |
-|  6     |  9/2  |  1.  **Tree Data Structures and Algorithms**\\  2.  **Heaps**\\  \\ {{https://www.dropbox.com/s/luwx9r50st2pmum/CSCI2100-06-Heaps.pdf?dl=0|06-Heaps.pdf}}   |  Binary and AVL Tree in C  |   * **Reading assignment**: Chapter 6 of Weiss'97\\  \\  * **PA #3**\\ <hi yellow>**From 12:00 am, Wednesday, Feb 25, 2015 to 11:59 pm, Sunday, Mar 1, 2015**</hi>\\ <hi lightblue>** 3.24 (Problem 1),  3.35 (Problem 2)**</hi>   |  {{:teaching:csci2100:solutions_pa_1.pdf|PA#1 solutions}} \\ {{:teaching:csci2100:solutions_pa_2.pdf|PA#2 solutions}}   |+|  6     |  9/2  |  1.  **Tree Data Structures and Algorithms**\\  2.  **Heaps**\\  \\ {{https://www.dropbox.com/s/luwx9r50st2pmum/CSCI2100-06-Heaps.pdf?dl=0|06-Heaps.pdf}}   |  Binary and AVL Tree in C  |   * **Reading assignment**: Chapter 6 of Weiss'97\\  \\  * **PA #3**\\ <hi yellow>**From 12:00 am, Wednesday, Feb 25, 2015 to 11:59 pm, Sunday, Mar 1, 2015**</hi>\\ <hi lightblue>** 3.24 (Problem 1),  3.35 (Problem 2)**</hi>   |     |
|  7     |  16/2  |  **Heaps**  \\  Public Holiday (Wednesday)  |  Heaps in C  |   TBA   |  TBA   | |  7     |  16/2  |  **Heaps**  \\  Public Holiday (Wednesday)  |  Heaps in C  |   TBA   |  TBA   |
|  8     |  23/2  |  Public Holiday (Monday)\\  **Hash Functions**\\ \\ {{https://www.dropbox.com/s/o9b5swuy87zseyh/CSCI2100-05-Hash.pdf?dl=0|05-Hash.pdf}}   |  Heaps in C  |  * **Reading assignment**: Chapter 5 of Weiss'97\\  \\    |  TBA  | |  8     |  23/2  |  Public Holiday (Monday)\\  **Hash Functions**\\ \\ {{https://www.dropbox.com/s/o9b5swuy87zseyh/CSCI2100-05-Hash.pdf?dl=0|05-Hash.pdf}}   |  Heaps in C  |  * **Reading assignment**: Chapter 5 of Weiss'97\\  \\    |  TBA  |
-|  9     |  2/3  |  **Midterm Written Exam**  |  TBA |  TBA  |  TBA  | +|  9     |  2/3  |  **Midterm Written Exam**  |  No Tutorials |  TBA  |  TBA  | 
-|  10     |  9/3  |  **Sorting Algorithms**\\ \\ {{https://www.dropbox.com/s/r9eve9kega2nhh5/CSCI2100-07-Sorting.pdf?dl=0|07-Sorting.pdf}}  |  Written Mid-term Answers  |  * **Reading assignment**: Chapter 7 of Weiss'97\\  \\ * **WA #4** {{:teaching:csci2100:hw_1.19.pdf|Version 1.19}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, Mar 20, 2015** </hi>  \\ * <hi lightblue>**4.1; 4.14; 6.1; 6.2; 6.6(2) ** </hi>\\   | TBA  +|  10     |  9/3  |  **Sorting Algorithms**\\ \\ {{https://www.dropbox.com/s/r9eve9kega2nhh5/CSCI2100-07-Sorting.pdf?dl=0|07-Sorting.pdf}}  |  Written Mid-term Answers  |  * **Reading assignment**: Chapter 7 of Weiss'97\\  \\ * **WA #4** {{:teaching:csci2100:hw_1.19.pdf|Version 1.19}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, Mar 20, 2015** </hi>  \\ * <hi lightblue>**4.1; 4.14; 6.1; 6.2; 6.6(2) ** </hi>\\   |  
-|  11     |  16/3  |  **Sorting Algorithms**  |  Hash  |  * **PA #4** {{:teaching:csci2100:hw120_revised.pdf|Version 1.20 (Revised)}}\\ <hi yellow>**From 12:00 am, Wednesday, Mar 23, 2015 to 11:59 pm, Sunday, Mar 29, 2015**</hi>\\ <hi lightblue>** 4.17 (Problem 1),  5.12 (Problem 2), and 6.10 (Problem 3)**</hi>  |  TBA  | +|  11     |  16/3  |  **Sorting Algorithms**  |  Hash  |  * **PA #4**  |  TBA  | 
-|  12     |  23/3  |   **Graph Data Structures and Algorithms**\\ \\ {{https://www.dropbox.com/s/nvlf7srlgb3kddw/CSCI2100-08-Graphs.pdf?dl=0|08-Graphs.pdf}}  |  Quicksort and Mergesort  |  {{:teaching:csci2100:programming_midterm.pdf|Programming Midterm Tips}} \\ {{:teaching:csci2100:midterm_programming_2014.pdf|Programming midterm paper 2013 Term 1}} \\ {{:teaching:csci2100:sample_code_in_weiss_s.zip|Sample code in Weiss's}}   |  {{:teaching:csci2100:solutions_pa_3.pdf|PA#3 solutions}}   | +|  12     |  23/3  |   **Graph Data Structures and Algorithms**\\ \\ {{https://www.dropbox.com/s/nvlf7srlgb3kddw/CSCI2100-08-Graphs.pdf?dl=0|08-Graphs.pdf}}  |  Quicksort and Mergesort  |  {{:teaching:csci2100:programming_midterm.pdf|Programming Midterm Tips}} \\ {{:teaching:csci2100:midterm_programming_2014.pdf|Programming midterm paper 2013 Term 1}} }   | 
-|  13     |  30/3  |   **Graph Data Structures and Algorithms**\\ \\ **Programming Midterm**   |  No Tutorials  |  * **WA #5** {{:teaching:csci2100:hw120_revised.pdf|Version 1.20}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, April 10, 2015** </hi>  \\ * <hi lightblue>**7.1; 7.3; 7.4; 7.5 (1); ** </hi>   |  {{:teaching:csci2100:solutions_pa_4.pdf|PA#4 solutions}}  |+|  13     |  30/3  |   **Graph Data Structures and Algorithms**\\ \\ **Programming Midterm**   |  No Tutorials  |  * **WA #5** {{:teaching:csci2100:hw120_revised.pdf|Version 1.20}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, April 17, 2015** </hi>  \\ * <hi lightblue>**7.1; 7.3; 7.4; 7.5 (1); ** </hi>   |   |
|  14     |  6/4  |  Public Holiday (Monday)\\ **Graph Data Structures and Algorithms**   |  TBA  |  TBA  |  TBA   | |  14     |  6/4  |  Public Holiday (Monday)\\ **Graph Data Structures and Algorithms**   |  TBA  |  TBA  |  TBA   |
-|  15     |  13/4  |  1.  **Advanced Topics**\\  2. **Course Summary**  | TBA |  TBA  | TBA   |+|  15     |  13/4  |  1.  **Advanced Topics**\\  2. **Course Summary**  \\ \\  {{https://www.dropbox.com/s/bg0esj9puekdkrp/11_Final.pdf?dl=0|Courser Summary.pdf}}   |  TBA  |  TBA   |     |
<box 90% round red | **Tutorial Page**> <box 90% round red | **Tutorial Page**>
Line 274: Line 277:
  -[[http://www.cs.oswego.edu/~birgit/html/diplom/links.html |Algorithm Animation Links]]   -[[http://www.cs.oswego.edu/~birgit/html/diplom/links.html |Algorithm Animation Links]]
  -[[http://www.alistapart.com/articles/pickle/|The Pickle Story]]   -[[http://www.alistapart.com/articles/pickle/|The Pickle Story]]
 +
 +
 
teaching/csci2100/2014.1427694931.txt.gz · Last modified: 2015/03/30 13:55 by hyzhang     Back to top