Differences
This shows you the differences between two versions of the page.
|
teaching:csci2100:2014 [2017/01/11 13:58] jnzhang |
teaching:csci2100:2014 [2017/03/09 19:22] (current) jnzhang |
||
|---|---|---|---|
| Line 101: | Line 101: | ||
| | 9 | 2/3 | **Midterm Written Exam** | No Tutorials | 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>\\ | | | | 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}} } | | | 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 17, 2015** </hi> \\ * <hi lightblue>**7.1; 7.3; 7.4; 7.5 (1); ** </hi> | | | | 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> | | | ||
