Differences

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

teaching:csci2100b:2012 [2013/09/02 23:12]
admin created
teaching:csci2100b:2012 [2015/01/24 13:11] (current)
hyzhang
Line 75: Line 75:
|  3     |  28/1, 29/1  |  1.**Recurrence Relations**\\ 2. **List, Stacks, and Queues**\\ \\  {{:teaching:csci2100b:csci2100b-2013-02.1-recurrence.pdf|Recurrence.pdf}}       |    I/O Issues in C    |   {{:teaching:csci2100b:specifications_for_hw1.pdf|Specifications for Homework 1}}   |  TBD  | |  3     |  28/1, 29/1  |  1.**Recurrence Relations**\\ 2. **List, Stacks, and Queues**\\ \\  {{:teaching:csci2100b:csci2100b-2013-02.1-recurrence.pdf|Recurrence.pdf}}       |    I/O Issues in C    |   {{:teaching:csci2100b:specifications_for_hw1.pdf|Specifications for Homework 1}}   |  TBD  |
|  4     |  4/2, 5/2  |  **List, Stacks, and Queues**\\  \\ {{:teaching:csci2100b:csci2100b-2013-03-lsq.pdf|LSQ.pdf}}   |  List, Stacks, and Queues in C  |   TBD   |   TBD   | |  4     |  4/2, 5/2  |  **List, Stacks, and Queues**\\  \\ {{:teaching:csci2100b:csci2100b-2013-03-lsq.pdf|LSQ.pdf}}   |  List, Stacks, and Queues in C  |   TBD   |   TBD   |
-|  5     |  11/2, 12/2    |  **<hi yellow>CHINESE NEW YEAR HOLIDAY</hi>**   |     **<hi yellow>NO TUTORIALS</hi>**     |  {{:teaching:csci2100b:solutions_wa_1_updated.pdf|Solutions for HW #1}} \\ <hi yellow>(Updated)</hi> |   TBD   |+|  5     |  11/2, 12/2    |  **<hi yellow>CHINESE NEW YEAR HOLIDAY</hi>**   |     **<hi yellow>NO TUTORIALS</hi>**     |  Solutions for HW #1  |   TBD   |
|  6     |  18/2, 19/2  |   **List, Stacks, and Queues**   |  Homework #1 Solutions  |   {{:teaching:csci2100b:hw_2.pdf|HW #2}} (All Programming: 2.4, 2.16, 2.17) \\ <hi yellow>(Begin at 00:00 am, Monday, February 25, 2013; Due on or before 11:59 pm, Sunday, March 3, 2013)</hi>   |  TBD   | |  6     |  18/2, 19/2  |   **List, Stacks, and Queues**   |  Homework #1 Solutions  |   {{:teaching:csci2100b:hw_2.pdf|HW #2}} (All Programming: 2.4, 2.16, 2.17) \\ <hi yellow>(Begin at 00:00 am, Monday, February 25, 2013; Due on or before 11:59 pm, Sunday, March 3, 2013)</hi>   |  TBD   |
|  7     |  25/2, 26/2  |    **Tree Data Structures and Algorithms** \\   \\  {{:teaching:csci2100b:csci2100b-2013-04-tree.pdf|Tree.pdf}}  |     Binary and AVL Tree in C     |  {{:teaching:csci2100b:extra.pdf|Extra Credit Problem}} \\ <hi yellow>(Due on or before the last day of this semester)</hi>  |  TBD  | |  7     |  25/2, 26/2  |    **Tree Data Structures and Algorithms** \\   \\  {{:teaching:csci2100b:csci2100b-2013-04-tree.pdf|Tree.pdf}}  |     Binary and AVL Tree in C     |  {{:teaching:csci2100b:extra.pdf|Extra Credit Problem}} \\ <hi yellow>(Due on or before the last day of this semester)</hi>  |  TBD  |
|  8     |  4/3, 5/3  |   **Tree Data Structures and Algorithms**     |     More issues on Tree     |  * HW #3 {{:teaching:csci2100b:hw114_2.pdf|(Version 1.14)}} \\  * Written Assignment (<hi yellow>Due on or before 5:00 pm, Friday, March 15, 2013</hi>)\\  * <hi lightblue>3.1(3); 3.2(3); 3.3(3); 3.4; 3.6(3); 3.7; 3.10; 3.11; 3.12(3); 3.13(3)\\ 5 points each, 50 points in total</hi>\\  \\  * Programming Assignment (<hi yellow>Begins at 00:00 am, Monday, March 18, 2013, ends at 11:59 pm, Sunday, March 24</hi>) \\ <hi lightblue>3.24; 3.29</hi>   |  TBD  | |  8     |  4/3, 5/3  |   **Tree Data Structures and Algorithms**     |     More issues on Tree     |  * HW #3 {{:teaching:csci2100b:hw114_2.pdf|(Version 1.14)}} \\  * Written Assignment (<hi yellow>Due on or before 5:00 pm, Friday, March 15, 2013</hi>)\\  * <hi lightblue>3.1(3); 3.2(3); 3.3(3); 3.4; 3.6(3); 3.7; 3.10; 3.11; 3.12(3); 3.13(3)\\ 5 points each, 50 points in total</hi>\\  \\  * Programming Assignment (<hi yellow>Begins at 00:00 am, Monday, March 18, 2013, ends at 11:59 pm, Sunday, March 24</hi>) \\ <hi lightblue>3.24; 3.29</hi>   |  TBD  |
|  9     |  11/3, 12/3    |   **<hi yellow>NO CLASS</hi>**\\   |       **<hi yellow>NO TUTORIALS</hi>**     |   TBD   |  TBD  | |  9     |  11/3, 12/3    |   **<hi yellow>NO CLASS</hi>**\\   |       **<hi yellow>NO TUTORIALS</hi>**     |   TBD   |  TBD  |
-|  10     |  18/3, 19/3  |   1. **Hash Functions**\\  2. **Heaps**\\   \\ {{:teaching:csci2100b:csci2100b-2013-05-hash.pdf|Hash.pdf}}  \\  {{:teaching:csci2100b:csci2100b-2013-06-heaps.pdf|Heaps.pdf}}  |       Homework #3 Solutions     |    {{:teaching:csci2100b:2013:solutions_hw_3_updated.pdf|Solutions for HW #3}}   |  TBD  |+|  10     |  18/3, 19/3  |   1. **Hash Functions**\\  2. **Heaps**\\   \\ {{:teaching:csci2100b:csci2100b-2013-05-hash.pdf|Hash.pdf}}  \\  {{:teaching:csci2100b:csci2100b-2013-06-heaps.pdf|Heaps.pdf}}  |       Homework #3 Solutions     |    Solutions for HW #3    |  TBD  |
|  11     |  25/3, 26/3  |   **Sorting Algorithms**  \\ \\   {{:teaching:csci2100b:csci2100b-2013-07-sort.pdf|Sort.pdf}}  |       Hash in C     |   TBD   |  TBD   | |  11     |  25/3, 26/3  |   **Sorting Algorithms**  \\ \\   {{:teaching:csci2100b:csci2100b-2013-07-sort.pdf|Sort.pdf}}  |       Hash in C     |   TBD   |  TBD   |
|  12     |  1/4, 2/4  |    **<hi yellow>EASTER HOLIDAY</hi>**\\ **Sorting Algorithms**     |      Written Midterm Review      |  TBD  |     TBD      | |  12     |  1/4, 2/4  |    **<hi yellow>EASTER HOLIDAY</hi>**\\ **Sorting Algorithms**     |      Written Midterm Review      |  TBD  |     TBD      |
-|  13     |  8/4, 9/4  |    **<hi yellow>WRITTEN MIDTERM EXAMINATION</hi>** \\ \\ **Sorting Algorithms** \\ \\  **<hi yellow>PROGRAMMING MIDTERM EXAMINATION</hi>**\\   \\  {{:teaching:csci2100b:csci2100b-2013-exams.pdf|Exams.pdf}}  |       Midterm Tips and PC2 Tutorial     |  {{:teaching:csci2100b:midterm_2013.pdf|Written Midterm Paper}} \\ {{:teaching:csci2100b:written_midterm_solutions.pdf|Selected Written Midterm Solutions}} \\ {{:teaching:csci2100b:summary_-_programming_contest.pdf|Programming Midterm Results}} \\ {{:teaching:csci2100b:midterm_review.ppt|Programming Midterm Review}} \\ **Champion** CHAN, Pak Hay (1155029810) \\ **1st Runner-up** LAM, Ka Ho (1155031192) \\ **2nd Runner-up** YU, Chun Lung (1155029407) \\ **Best Female Coder** CHU, Wing Yin (1155030760) \\ **Best Non-CSE Coder** LAM, Ka Ho (1155031192) \\ **Most Effective Coder** PANG, Yui Tik (1155030526) \\ **Honorable Mention** WAN, Ka Ki (1155030851) \\    DERMAWAN, Teresa (1009637094)    |   TBD   |+|  13     |  8/4, 9/4  |    **<hi yellow>WRITTEN MIDTERM EXAMINATION</hi>** \\ \\ **Sorting Algorithms** \\ \\  **<hi yellow>PROGRAMMING MIDTERM EXAMINATION</hi>**\\   \\  {{:teaching:csci2100b:csci2100b-2013-exams.pdf|Exams.pdf}}  |       Midterm Tips and PC2 Tutorial     |  Written Midterm Paper \\ Selected Written Midterm Solutions \\ {{:teaching:csci2100b:summary_-_programming_contest.pdf|Programming Midterm Results}} \\ {{:teaching:csci2100b:midterm_review.ppt|Programming Midterm Review}} \\ **Champion** CHAN, Pak Hay (1155029810) \\ **1st Runner-up** LAM, Ka Ho (1155031192) \\ **2nd Runner-up** YU, Chun Lung (1155029407) \\ **Best Female Coder** CHU, Wing Yin (1155030760) \\ **Best Non-CSE Coder** LAM, Ka Ho (1155031192) \\ **Most Effective Coder** PANG, Yui Tik (1155030526) \\ **Honorable Mention** WAN, Ka Ki (1155030851) \\    DERMAWAN, Teresa (1009637094)    |   TBD   |
|  14     |  15/4, 16/4    |  **Graph Data Structures and Algorithms**   \\ \\  {{:teaching:csci2100b:csci2100b-2013-08-graphs.pdf|Graphs.pdf}}  |  Quick Sort and Merge Sort  |  * HW #4 {{:teaching:csci2100b:hw114_2.pdf|(Version 1.14)}} \\  * Written Assignment (<hi yellow>Due on or before 5:00 pm, Monday, April 29, 2013</hi>)\\  *  <hi lightblue>4.1; 4.14; 4.15; 5.1; 5.2; 6.1; 6.2; 6.3; 6.6(2); 7.1; 7.3(1); 7.4; 7.5\\ (for the answers of all graph problems except 7.4, only table is needed (no figures); for 7.4, only figure is needed.</hi>  |  TBD   | |  14     |  15/4, 16/4    |  **Graph Data Structures and Algorithms**   \\ \\  {{:teaching:csci2100b:csci2100b-2013-08-graphs.pdf|Graphs.pdf}}  |  Quick Sort and Merge Sort  |  * HW #4 {{:teaching:csci2100b:hw114_2.pdf|(Version 1.14)}} \\  * Written Assignment (<hi yellow>Due on or before 5:00 pm, Monday, April 29, 2013</hi>)\\  *  <hi lightblue>4.1; 4.14; 4.15; 5.1; 5.2; 6.1; 6.2; 6.3; 6.6(2); 7.1; 7.3(1); 7.4; 7.5\\ (for the answers of all graph problems except 7.4, only table is needed (no figures); for 7.4, only figure is needed.</hi>  |  TBD   |
-|  15     |  22/4, 23/4    |   1. **Graph Data Structures and Algorithms** \\ 2. **Course summary** \\   |       Graph Revisited     |   {{:teaching:csci2100b:hw_4_sol.pdf|Solutions for HW #4}} \\ {{:teaching:csci2100b:hw4_solutions.pdf|Solutions for HW#4 (Part 2)}}  |  TBD   |+|  15     |  22/4, 23/4    |   1. **Graph Data Structures and Algorithms** \\ 2. **Course summary** \\   |       Graph Revisited     |   Solutions for HW #4 \\ Solutions for HW#4 (Part 2)   |  TBD   |
<box 90% round red | **Tutorial Page**> <box 90% round red | **Tutorial Page**>
 
teaching/csci2100b/2012.1378134765.txt.gz · Last modified: 2013/09/02 23:12 (external edit)     Back to top