Differences

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

teaching:csci2100:2016 [2017/05/03 13:45]
syhu
teaching:csci2100:2016 [2019/01/23 19:43] (current)
wchen
Line 7: Line 7:
===== Breaking News ===== ===== Breaking News =====
  - <hi yellow>**3 May 2017**</hi> The solutions of WA5 have been released.   - <hi yellow>**3 May 2017**</hi> The solutions of WA5 have been released.
-  - <hi yellow>**2 May 2017**</hi> Please check your {{:teaching:csci2100:mark_forstudent_new_all.xlsx|scores of all the WAs and PAs}}. If there is any mistake, please contact TA as soon as possible. And you can come to SHB1024 to take back your WA1-WA5. +  - <hi yellow>**2 May 2017**</hi> Please check your scores of all the WAs and PAs. If there is any mistake, please contact TA as soon as possible. And you can come to SHB1024 to take back your WA1-WA5.
  - <hi yellow>**2 May 2017**</hi> The solutions of PA4 and PA5 have been released.   - <hi yellow>**2 May 2017**</hi> The solutions of PA4 and PA5 have been released.
  - <hi yellow>**18 April 2017**</hi>. PA5 was released. The reward vectors for Problem 1 & 2 are (5,4,4,3,2,1,0) and (5,4,4,3,2,1,0), respectively.   - <hi yellow>**18 April 2017**</hi>. PA5 was released. The reward vectors for Problem 1 & 2 are (5,4,4,3,2,1,0) and (5,4,4,3,2,1,0), respectively.
  - <hi yellow>**11 April 2017**</hi>. You can come to SHB 1024 to check your midterm examination paper if needed.   - <hi yellow>**11 April 2017**</hi>. You can come to SHB 1024 to check your midterm examination paper if needed.
-  - <hi yellow>**30 March 2017**</hi>. Please check your {{:teaching:csci2100:mark_forstudent_new2.xlsx|score of PA4}}. If there is any mistake, please contact TA as soon as possible.+  - <hi yellow>**30 March 2017**</hi>. Please check your score of PA4. If there is any mistake, please contact TA as soon as possible.
  - <hi yellow>**28 March 2017**</hi> The solutions of WA3 have been updated.   - <hi yellow>**28 March 2017**</hi> The solutions of WA3 have been updated.
  - <hi yellow>**27 March 2017**</hi> The solutions of WA1 and WA2 have been released.   - <hi yellow>**27 March 2017**</hi> The solutions of WA1 and WA2 have been released.
Line 23: Line 23:
   - <hi yellow>**19 March 2017**</hi>. The solutions of PA1-PA3 have been released.    - <hi yellow>**19 March 2017**</hi>. The solutions of PA1-PA3 have been released.
   - <hi yellow>**17 March 2017**</hi>.  We have received WA3 from students listed in the attachment: {{:teaching:csci2100:wa3.pdf|WA3}}. If you have submitted your homework but have not been included in the list, please contact TA as soon as possible.    - <hi yellow>**17 March 2017**</hi>.  We have received WA3 from students listed in the attachment: {{:teaching:csci2100:wa3.pdf|WA3}}. If you have submitted your homework but have not been included in the list, please contact TA as soon as possible.
-   - <hi yellow>**13 March 2017**</hi>. Please check your {{:teaching:csci2100:mark_forstudent_new.xlsx|score of PA 1, PA2, PA3, WA1, WA2}}. If there is any mistake, please contact TA as soon as possible.+   - <hi yellow>**13 March 2017**</hi>. Please check your score of PA 1, PA2, PA3, WA1, WA2. If there is any mistake, please contact TA as soon as possible.
   - <hi yellow>**9 March 2017**</hi>. PA4 was released. The reward vectors for Problem 1 & 2 are (3,2,2,2,1,1,0) and (3,2,2,2,1,1,0), respectively.    - <hi yellow>**9 March 2017**</hi>. PA4 was released. The reward vectors for Problem 1 & 2 are (3,2,2,2,1,1,0) and (3,2,2,2,1,1,0), respectively.
   - <hi yellow>**8 March 2017**</hi>. Mistakes in tutorial:  'HashVal << 5' is equivalent to a multiplication by 32.    - <hi yellow>**8 March 2017**</hi>. Mistakes in tutorial:  'HashVal << 5' is equivalent to a multiplication by 32.
Line 108: Line 108:
^ Week   ^    Date     ^  Lecture Topics\\ and Notes  ^   Tutorial Topics   ^  Homework Assignments \\  and Events  ^  Resources  ^   ^ Week   ^    Date     ^  Lecture Topics\\ and Notes  ^   Tutorial Topics   ^  Homework Assignments \\  and Events  ^  Resources  ^  
-|  1  |  9/1  |  **Introduction**   \\  \\  {{https://www.dropbox.com/s/7yh7hzu7vgyjdha/CSCI2100-01-Introduction.pdf?dl=0|Introduction}}  \\  {{https://www.dropbox.com/s/r7lpfyuedj6304j/Slide%20for%20First%20Lecture-01.pdf?dl=0|First Lecture}}  \\  {{https://www.dropbox.com/s/gdyl2u9b3df0nlt/KEEPAttendance%203-Step%20Slides.pdf?dl=0|KEEPAttendance}}  |   Introduction to C  \\  \\  [[https://www.youtube.com/watch?v=2NWeucMKrLI&index=1&list=PL6gx4Cwl9DGAKIXv8Yr6nhGJ9Vlcjyymq|C programming tutorial 1]]  \\ [[https://www.youtube.com/watch?v=iXEw_0hlM9A&list=PL_RGaFnxSHWoGzOXqtKeM71OLpvZbuU0P&index=1|C programming tutorial 2 ]]  |  * **WA #1** {{:teaching:csci2100:hw_1.15.pdf|hw_1.19.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Thursday, Jan 26, 2017** </hi>  \\ * <hi lightblue>**1.1 (1), (9), and (13); 1.3 (4) and (8); 1.4 (2) and (6) ** </hi> \\  {{:teaching:csci2100:wa1_sample_solution.pdf|WA1 solution}} |  * Chapter 1 of Weiss'97\\ * Chapter 1 of Cormen et al.'90 \\   | +|  1  |  9/1  |  **Introduction**   \\  \\  {{https://www.dropbox.com/s/7yh7hzu7vgyjdha/CSCI2100-01-Introduction.pdf?dl=0|Introduction}}  \\  {{https://www.dropbox.com/s/r7lpfyuedj6304j/Slide%20for%20First%20Lecture-01.pdf?dl=0|First Lecture}}  \\  {{https://www.dropbox.com/s/gdyl2u9b3df0nlt/KEEPAttendance%203-Step%20Slides.pdf?dl=0|KEEPAttendance}}  |   Introduction to C  \\  \\  [[https://www.youtube.com/watch?v=2NWeucMKrLI&index=1&list=PL6gx4Cwl9DGAKIXv8Yr6nhGJ9Vlcjyymq|C programming tutorial 1]]  \\ [[https://www.youtube.com/watch?v=iXEw_0hlM9A&list=PL_RGaFnxSHWoGzOXqtKeM71OLpvZbuU0P&index=1|C programming tutorial 2 ]]  |  * **WA #1** {{:teaching:csci2100:hw_1.15.pdf|hw_1.19.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Thursday, Jan 26, 2017** </hi>  \\ * <hi lightblue>**1.1 (1), (9), and (13); 1.3 (4) and (8); 1.4 (2) and (6) ** </hi>  |  * Chapter 1 of Weiss'97\\ * Chapter 1 of Cormen et al.'90 \\   | 
-|  2  |  16/1  |  **Algorithm Analysis**\\    \\  {{https://www.dropbox.com/s/4m1dlzop814lznk/CSCI2100-02-Analysis.pdf?dl=0|Analysis (updated)}}   |  Online Judge System  |  * **PA #1** {{:teaching:csci2100:hw125.pdf|hw_1.25.pdf}}  \\  <hi yellow>**From 00:00 am, Monday, Feb 06, 2017 to 11:59 pm, Sunday, Feb 12, 2017** </hi>  \\  * <hi lightblue>**1.23(Problem 1);1.24(Problem 2)** </hi> \\ {{:teaching:csci2100:123.zip|1.23 solution}} {{:teaching:csci2100:124.zip|1.24 solution}} |  * Chapter 2 of Weiss'97\\   | +|  2  |  16/1  |  **Algorithm Analysis**\\    \\  {{https://www.dropbox.com/s/4m1dlzop814lznk/CSCI2100-02-Analysis.pdf?dl=0|Analysis (updated)}}   |  Online Judge System  |  * **PA #1** {{:teaching:csci2100:hw125.pdf|hw_1.25.pdf}}  \\  <hi yellow>**From 00:00 am, Monday, Feb 06, 2017 to 11:59 pm, Sunday, Feb 12, 2017** </hi>  \\  * <hi lightblue>**1.23(Problem 1);1.24(Problem 2)** </hi>  |  * Chapter 2 of Weiss'97\\   | 
-|  3  |  23/1  |  1. **Algorithm Analysis**\\ 2. **Lists, Stacks and Queues**  \\  \\ {{https://www.dropbox.com/s/ms0b5834kjm4f2y/CSCI2100-02.1-Recurrence.pdf?dl=0|Recurrence}}\\  {{https://www.dropbox.com/s/g7n7gtt1ldyi9wf/CSCI2100-03-LSQ.pdf?dl=0|LSQ}}    |  Linux commands and vim  |   * **WA #2** {{:teaching:csci2100:hw_1.15.pdf|hw_1.25.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, Feb 10, 2017** </hi>  \\ * <hi lightblue>**1.6 (1), (2), and (6); 1.8 (3); 1.9 (2) and (3) ** </hi> \\  {{:teaching:csci2100:wa2_sample_solution.pdf|WA2 solution}} |  * Chapter 2 of Weiss'97\\ * Chapter 3 of Weiss'97\\   |+|  3  |  23/1  |  1. **Algorithm Analysis**\\ 2. **Lists, Stacks and Queues**  \\  \\ {{https://www.dropbox.com/s/ms0b5834kjm4f2y/CSCI2100-02.1-Recurrence.pdf?dl=0|Recurrence}}\\  {{https://www.dropbox.com/s/g7n7gtt1ldyi9wf/CSCI2100-03-LSQ.pdf?dl=0|LSQ}}    |  Linux commands and vim  |   * **WA #2** {{:teaching:csci2100:hw_1.15.pdf|hw_1.25.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, Feb 10, 2017** </hi>  \\ * <hi lightblue>**1.6 (1), (2), and (6); 1.8 (3); 1.9 (2) and (3) ** </hi>  |  * Chapter 2 of Weiss'97\\ * Chapter 3 of Weiss'97\\   |
|  4  |  30/1  |   <color red>**Chinese New Year Holiday**</color>\\   | | | | |  4  |  30/1  |   <color red>**Chinese New Year Holiday**</color>\\   | | | |
-|  5  |  6/2  |   1.**Lists, Stacks and Queues**\\  2.**Tree Data Structures and Algorithms**\\   \\  {{https://www.dropbox.com/s/14dpx8fxnab4u21/CSCI2100-04-Trees.pdf?dl=0|Trees}}  |  I/O issues in C  |  * **PA #2** {{:teaching:csci2100:hw126.pdf|hw_1.26.pdf}}  \\  <hi yellow>**From 00:00 am, Friday, Feb 17, 2017 to 11:59 pm, Thursday, Feb 23, 2017** </hi>  \\  * <hi lightblue>**2.20(Problem 1);2.21(Problem 2)** </hi> \\ {{:teaching:csci2100:220.zip|2.20 solution}} {{:teaching:csci2100:221.zip|2.21 solution}}  |  * Chapter 3 of Weiss'97\\   | +|  5  |  6/2  |   1.**Lists, Stacks and Queues**\\  2.**Tree Data Structures and Algorithms**\\   \\  {{https://www.dropbox.com/s/14dpx8fxnab4u21/CSCI2100-04-Trees.pdf?dl=0|Trees}}  |  I/O issues in C  |  * **PA #2** {{:teaching:csci2100:hw126.pdf|hw_1.26.pdf}}  \\  <hi yellow>**From 00:00 am, Friday, Feb 17, 2017 to 11:59 pm, Thursday, Feb 23, 2017** </hi>  \\  * <hi lightblue>**2.20(Problem 1);2.21(Problem 2)** </hi>   |  * Chapter 3 of Weiss'97\\   | 
-|  6  |  13/2  |  **Tree Data Structures and Algorithms**  \\   |  Lists, Stacks,Queues  |  * **WA #3** {{:teaching:csci2100:hw126.pdf|hw_1.26.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, Mar 3, 2017** </hi>  \\ * <hi lightblue>**3.3 (3); 3.9; 3.11; 3.18; 5.1; 5.2; 5.6 ** </hi> \\ {{:teaching:csci2100:wa3sol_new.pdf|WA3 solution}}    |  * Chapter 4 of Weiss'97\\   |  +|  6  |  13/2  |  **Tree Data Structures and Algorithms**  \\   |  Lists, Stacks,Queues  |  * **WA #3** {{:teaching:csci2100:hw126.pdf|hw_1.26.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, Mar 3, 2017** </hi>  \\ * <hi lightblue>**3.3 (3); 3.9; 3.11; 3.18; 5.1; 5.2; 5.6 ** </hi>    |  * Chapter 4 of Weiss'97\\   |  
-|  7  |  20/2  |   1. **Tree Data Structures and Algorithms**   \\ 2. **Heaps**  \\   \\  {{https://www.dropbox.com/s/m03o66r3gbltsmj/CSCI2100-04.2-Trie.pdf?dl=0|Trie}}  \\  {{https://www.dropbox.com/s/r42mvhr8t4eo9si/CSCI2100-06-Heaps.pdf?dl=0|Heap}}  |  Binary and AVL Trees in C  |  * **PA #3** {{:teaching:csci2100:hw127_wchen.pdf|hw_1.27.pdf}}  \\  <hi yellow>**From 00:00 am, Friday, March 03, 2017 to 11:59 pm, Thursday, March 09, 2017** </hi>  \\  * <hi lightblue>**3.32(Problem 1);3.35(Problem 2);3.37(Problem 3) <choose 2>** </hi> \\ {{:teaching:csci2100:332_cprj2727.zip|3.32 solution}} {{:teaching:csci2100:335_cprj2727.zip|3.35 solution}} {{:teaching:csci2100:337_cprj2727.zip|3.37 solution}} |  * Chapter 4 of Weiss'97\\   | +|  7  |  20/2  |   1. **Tree Data Structures and Algorithms**   \\ 2. **Heaps**  \\   \\  {{https://www.dropbox.com/s/m03o66r3gbltsmj/CSCI2100-04.2-Trie.pdf?dl=0|Trie}}  \\  {{https://www.dropbox.com/s/r42mvhr8t4eo9si/CSCI2100-06-Heaps.pdf?dl=0|Heap}}  |  Binary and AVL Trees in C  |  * **PA #3** {{:teaching:csci2100:hw127_wchen.pdf|hw_1.27.pdf}}  \\  <hi yellow>**From 00:00 am, Friday, March 03, 2017 to 11:59 pm, Thursday, March 09, 2017** </hi>  \\  * <hi lightblue>**3.32(Problem 1);3.35(Problem 2);3.37(Problem 3) <choose 2>** </hi>  |  * Chapter 4 of Weiss'97\\   | 
-|  8  |  27/2  |  1. **Heaps**  \\  2. **Hash Functions**  \\  \\  {{https://www.dropbox.com/s/o6fg0clda1yysxz/CSCI2100-05-Hash.pdf?dl=0|Hash}}  |  Heaps in C  |   * **WA #4** {{:teaching:csci2100:hw127_wchen.pdf|hw_1.27.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, Mar 17, 2017** </hi>  \\ * <hi lightblue>**4.1; 4.15; 6.1; 6.4; 6.6 (1)  ** </hi> \\ {{:teaching:csci2100:wa4sol_1.pdf|WA4 solution}}  |  * Chapter 6 of Weiss'97\\ * Chapter 5 of Weiss'97\\   | +|  8  |  27/2  |  1. **Heaps**  \\  2. **Hash Functions**  \\  \\  {{https://www.dropbox.com/s/o6fg0clda1yysxz/CSCI2100-05-Hash.pdf?dl=0|Hash}}  |  Heaps in C  |   * **WA #4** {{:teaching:csci2100:hw127_wchen.pdf|hw_1.27.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, Mar 17, 2017** </hi>  \\ * <hi lightblue>**4.1; 4.15; 6.1; 6.4; 6.6 (1)  ** </hi>  |  * Chapter 6 of Weiss'97\\ * Chapter 5 of Weiss'97\\   | 
-|  9  |  6/3  |   1. **Hash Functions**  \\  2.  **Sorting Algorithm**  \\  \\  {{https://www.dropbox.com/s/ilz5sw5umkxutcg/CSCI2100-04.3-B-Tree.pdf?dl=0|B-tree}}  \\  {{https://www.dropbox.com/s/cxsjywd0jdytp7k/CSCI2100-07-Sorting.pdf?dl=0|Sorting}}  |  Hashing in C  |  * **PA #4**{{:teaching:csci2100:hw128_wchen.pdf| hw_1.28.pdf}}  \\  <hi yellow>**From 00:00 am, Friday, March 17, 2017 to 11:59 pm, Thursday, March 23, 2017** </hi> \\  * <hi lightblue>**4.18(Problem 1);5.12(Problem 2)** </hi> \\ {{:teaching:csci2100:418.zip|4.18 solution}} {{:teaching:csci2100:512.zip|5.12 solution}} |  * Chapter 5 of Weiss'97\\   |+|  9  |  6/3  |   1. **Hash Functions**  \\  2.  **Sorting Algorithm**  \\  \\  {{https://www.dropbox.com/s/ilz5sw5umkxutcg/CSCI2100-04.3-B-Tree.pdf?dl=0|B-tree}}  \\  {{https://www.dropbox.com/s/cxsjywd0jdytp7k/CSCI2100-07-Sorting.pdf?dl=0|Sorting}}  |  Hashing in C  |  * **PA #4**{{:teaching:csci2100:hw128_wchen.pdf| hw_1.28.pdf}}  \\  <hi yellow>**From 00:00 am, Friday, March 17, 2017 to 11:59 pm, Thursday, March 23, 2017** </hi> \\  * <hi lightblue>**4.18(Problem 1);5.12(Problem 2)** </hi>  |  * Chapter 5 of Weiss'97\\   |
|  10  |  13/3  |  **Sorting Algorithms**  \\   |  Pointer in C  |  No assignment  |  * Chapter 7 of Weiss'97\\   | |  10  |  13/3  |  **Sorting Algorithms**  \\   |  Pointer in C  |  No assignment  |  * Chapter 7 of Weiss'97\\   |
|  11  |  20/3  |  1. **Sorting Algorithms**  \\  2. **Graphs**  \\ \\  {{https://www.dropbox.com/s/sue7bh1s7o8f5pj/CSCI2100-08-Graphs.pdf?dl=0|Graphs}}   |  Programming Midterm Preview  |  No assignment  |  * Chapter 7 of Weiss'97\\   | |  11  |  20/3  |  1. **Sorting Algorithms**  \\  2. **Graphs**  \\ \\  {{https://www.dropbox.com/s/sue7bh1s7o8f5pj/CSCI2100-08-Graphs.pdf?dl=0|Graphs}}   |  Programming Midterm Preview  |  No assignment  |  * Chapter 7 of Weiss'97\\   |
|  12  |  27/3  |  1. **Graph Data Structures and Algorithms** \\ <color red> **28/3  Midterm Written Exam**</color>\\ <color red> **31/3  Midterm Programming Exam**</color>\\   |  No Tutorial  |   |  {{:teaching:csci2100:sample_code.zip|Sample Code}}  | |  12  |  27/3  |  1. **Graph Data Structures and Algorithms** \\ <color red> **28/3  Midterm Written Exam**</color>\\ <color red> **31/3  Midterm Programming Exam**</color>\\   |  No Tutorial  |   |  {{:teaching:csci2100:sample_code.zip|Sample Code}}  |
|  13  |  3/4  |   <color red>**3/4 No class**</color>\\   <color red>**4/4 Ching Ming Festival**</color>  |   |    |  * Chapter 9 of Weiss'97\\   | |  13  |  3/4  |   <color red>**3/4 No class**</color>\\   <color red>**4/4 Ching Ming Festival**</color>  |   |    |  * Chapter 9 of Weiss'97\\   |
-|  14  |  10/4  |   **Graph Data Structures and Algorithms** \\   |   |     * **WA #5** {{:teaching:csci2100:hw128_wchen.pdf|hw_1.28.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, April 28, 2017** </hi>  \\ * <hi lightblue>**7.1; 7.3; 7.4; 7.5 (1) ** </hi> \\  {{:teaching:csci2100:wa5.pdf|WA5 solution}} |  * Chapter 9 of Weiss'97\\   | +|  14  |  10/4  |   **Graph Data Structures and Algorithms** \\   |   |     * **WA #5** {{:teaching:csci2100:hw128_wchen.pdf|hw_1.28.pdf}}\\ <hi yellow>**Due on or before 5:00 pm, Friday, April 28, 2017** </hi>  \\ * <hi lightblue>**7.1; 7.3; 7.4; 7.5 (1) ** </hi>  |  * Chapter 9 of Weiss'97\\   | 
-|  15  |  17/4  |  <color red>**17/4 Easter**</color> \\  1. **Graph Data Structures and Algorithms** \\  2. **Course Summary**\\  \\  {{https://www.dropbox.com/s/f2igmb9o1b1jt0y/CSCI2100-Final.pdf?dl=0|Final Summary}}  |   |  * **PA #5** {{:teaching:csci2100:hw129.pdf|hw_1.29.pdf}}  \\  <hi yellow>**From 00:00 am, Monday, April 24, 2017 to 11:59 pm, Sunday, April 30, 2017** </hi> \\  * <hi lightblue>**6.12(Problem 1);7.8(Problem 2)** </hi> \\ {{:teaching:csci2100:612.zip|6.12 solution}} {{:teaching:csci2100:708.zip|7.8 solution}} |    |+|  15  |  17/4  |  <color red>**17/4 Easter**</color> \\  1. **Graph Data Structures and Algorithms** \\  2. **Course Summary**\\  \\  {{https://www.dropbox.com/s/f2igmb9o1b1jt0y/CSCI2100-Final.pdf?dl=0|Final Summary}}  |   |  * **PA #5** {{:teaching:csci2100:hw129.pdf|hw_1.29.pdf}}  \\  <hi yellow>**From 00:00 am, Monday, April 24, 2017 to 11:59 pm, Sunday, April 30, 2017** </hi> \\  * <hi lightblue>**6.12(Problem 1);7.8(Problem 2)** </hi>  |    |
<box 90% round red | **Tutorial Page**> <box 90% round red | **Tutorial Page**>
Line 255: Line 255:
====== FAQ ====== ====== FAQ ======
 +  - **Q: What is departmental guideline for grade appeal?**\\ A: 1) Students must write (in written) to the Dept. Chairman grade appeal. The letter should hand in to the General Office within the time frame set by RES. 2) Justifications for grade appeal must be given. Disappointment about the grade obtained is not a justification.  Students have to provide their arguments over their expected grades based on scores they obtained from their work (eg. assignment, quiz, mid-term/final, etc.). 3) Office staff will then pass on the letter to the course teacher for review. It is the course teachers' discretion on whether they would like to go over the exam answer script with the student together. 4) Teachers inform the office staff whether grade amendment is needed. 5) Office staff prepares a formal reply to the students, and writes to the RES for grade amendment if necessary.
  - **Q: What is departmental guideline for plagiarism?**\\ A: If a student is found plagiarizing, his/her case will be reported to the Department Discipline Committee. If the case is proven after deliberation, the student will automatically fail the course in which he/she committed plagiarism. The definition of plagiarism includes copying of the whole or parts of written assignments, programming exercises, reports, quiz papers, mid-term examinations. The penalty will apply to both the one who copies the work and the one whose work is being copied, unless the latter can prove his/her work has been copied unwittingly. Furthermore, the inclusion of others' works or results without citation in assignments and reports is also regarded as plagiarism with a similar penalty to the offender. A student caught plagiarizing during tests or examinations will be reported to the Faculty Office and appropriate disciplinary authorities for further action, in addition to failing the course.   - **Q: What is departmental guideline for plagiarism?**\\ A: If a student is found plagiarizing, his/her case will be reported to the Department Discipline Committee. If the case is proven after deliberation, the student will automatically fail the course in which he/she committed plagiarism. The definition of plagiarism includes copying of the whole or parts of written assignments, programming exercises, reports, quiz papers, mid-term examinations. The penalty will apply to both the one who copies the work and the one whose work is being copied, unless the latter can prove his/her work has been copied unwittingly. Furthermore, the inclusion of others' works or results without citation in assignments and reports is also regarded as plagiarism with a similar penalty to the offender. A student caught plagiarizing during tests or examinations will be reported to the Faculty Office and appropriate disciplinary authorities for further action, in addition to failing the course.
  - **Q: What is ACM ICPC?** \\ A: Association of Computer Machinery International Collegiate Programming Contest. Teams from CUHK have done quite well in the previous years. More information on the CSE's programming team can be found at http://www.cse.cuhk.edu.hk/~acmprog.   - **Q: What is ACM ICPC?** \\ A: Association of Computer Machinery International Collegiate Programming Contest. Teams from CUHK have done quite well in the previous years. More information on the CSE's programming team can be found at http://www.cse.cuhk.edu.hk/~acmprog.
 
teaching/csci2100/2016.1493790316.txt.gz · Last modified: 2017/05/03 13:45 by syhu     Back to top