Navigation

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
====== CSCI2100B Data Structures ======

==== Breaking News ====
  - <hi yellow>**12 November 2013**</hi>.  Summary for HW#2. For the written part, 102 of 105 students submitted their papers. We do not receive assignments from 1155032519, 1155030854, 1155034836, 1155046456, 1155033804, 1155023707, 1155033600, 1155033552, and 1155034567. If you do submit the homework, please contact TA as soon as possible. The average score is around 81. For the programming part, please check {{:teaching:csci2100b:homework_2.pdf|this file}} for your final score.
  - <hi yellow>**8 November 2013**</hi>.  The solution for programming assignment #2 has been released. Good luck for your programming midterm!
  - <hi yellow>**6 November 2013**</hi>.  Since the solution for 3.18 is not right, we have updated the solution document for HW#2. Please take a look at it to make sure that you understand B-tree.
  - <hi yellow>**4 November 2013**</hi>.  Reminder: For tomorrow's written midterm, you can bring one cheat sheet (A4, both sides). Calculator is not allowed. Please get prepared. Good luck!
  - <hi yellow>**1 November 2013**</hi>.  The date and venue for the final exam have been confirmed. Please find the detailed information in the examination section.
  - <hi yellow>**30 October 2013**</hi>.  Manual page has been set up yesterday. By now, only information about the operating system and editors is provided in this page. We will appreciate it if you can give us any suggestion to improve this page. Please send your suggestion to the lecturer or tutors by email.
  - <hi yellow>**20 October 2013**</hi>.  Programming assignment #2 is ready for you to submit from tomorrow (Oct 21, 2013, Monday). You can click [[http://www.cse.cuhk.edu.hk/csci2100b/hw2-result.html|here]] to see the ranking page. The award vectors for the 3 problems will be (0,5,4,3,2,1,0,0), (0,5,5,4,3,2,1,0) and (0,6,6,5,4,3,2,1). Remember that the 0th entry has no use. Problem #0 is kept for you to test the environment, no scores will be counted for this problem. 
  - <hi yellow>**18 October 2013**</hi>.  Summary for HW#1. For the written part, 102 of 105 students submitted their papers. We do not receive assignments from 1155033552, 1155034567, and 1155046456. The average score is around 85. Please collect your papers in the next lecture. For the programming part, please check {{:teaching:csci2100b:pa1_result.pdf|this file}} for your final score. For both parts, if you have any questions, please contact TAs asap.
  - <hi yellow>**16 October 2013**</hi>.  HW#2 has been announced in the course website, please download the newest version. Solutions for HW#1 has been released as well.
  - <hi yellow>**4 October 2013**</hi>.  The homework has been updated with all the source information added. Please download the newest version. Sorry for the misunderstanding and inconvenience.
  - <hi yellow>**22 September 2013**</hi>.  For those who still have not received CSE account, please send your programs to TA (hyzhang@cse.cuhk.edu.hk). TA will submit for you and forward the respond to you. This is only for assignment #1 since you will receive the account by next time. Please contact TA if you have any questions.
  - <hi yellow>**22 September 2013**</hi>.  Programming assignment #1 is ready for you to submit from tomorrow (Sep 23, 2013, Monday). You can click [[http://www.cse.cuhk.edu.hk/csci2100b/hw1-result.html|here]] to see the ranking page. The award vectors for both problems will be (0,3,2,1,0,0,0,0) and (0,4,3,2,1,0,0,0). Remember that the 0th entry has no use. Problem #0 is kept for you to test the environment, no scores will be counted for this problem. 
  - <hi yellow>**10 September 2013**</hi>.  Lab session material has been uploaded to the tutorial page. 
  - <hi yellow>**5 September 2013**</hi>.  For all students in this class, please swap to the new tutorial session in CUSIS during the e-add/drop next week and the TBA session would be removed later. Tutorials will start from next week.
  - <hi yellow>**3 September 2013**</hi>.  Since many of you are not familiar with C programming language, we prepare a 6-week-long lab session together with other 2 data structure classes. This session will begin from next week. You can freely choose one of the 4 time slots to attend in each week. We will provide tutorials and handouts. There are no assignments for this session.
  - <hi yellow>**2 September 2013**</hi>.  The website is now ready!

===== Fall 2013 =====


|  ^  Lecture I  ^  Tutorial I  ^  Tutorial II  ^  Tutorial III  ^  Lab session  ^
^ Time    |  T2-4, 9:30 am - 12:15 pm  |  W6, 1:30 pm - 2:15 pm  |  W7, 2:30pm - 3:15 pm  |  H6, 1:30pm - 2:15 pm  |  Mon to Thu, 5:30 pm - 7:30 pm  |
^ Venue    |  LSB LT1  |  BMS LT  |  BMS LT  |  LSB C1  |  SHB924  |

<html><font color="red"> <b>The Golden Rule of CSCI2100B: </b></font></html> No member of the CSCI2100B community shall take unfair advantage of any other member of the CSCI2100B community.

====== Course Description ======

The concept of abstract data types and the advantages of data abstraction are introduced. Various commonly used abstract data types including vector, list, stack, queue, tree, and set and their implementations using different data structures (array, pointer based structures, linked list, 2-3 tree, B-tree, etc.) will be discussed. Sample applications such as searching, sorting, etc. will also be used to illustrate the use of data abstraction in computer programming. Analysis of the performance of searching and sorting algorithms. Application of data structure principles.

本科介紹抽象數據類型之概念及數據抽象化的優點。並討論多種常用的抽象數據類型，包括向量、表格、堆棧、隊列、樹形；集(合)和利用不同的數據結構(例如：陣列、指示字為基的結構、連接表、2-3樹形、B樹形等)作出的實踐。更以實例(例如：檢索、排序等)來說明數據抽象化在計算機程序設計上的應用。並討論檢索與排序算法及數據結構之應用。

===== Learning Objectives =====
  - To understand the concepts and operations of various data structures and their applications
  - To understand the concept of abstract data types
  - To have basic knowledge of algorithms and complexity of algorithms

===== Learning Outcomes =====
   - To be able to implement the following data structures as abstract data types in a high level programming lanauge: stack, queue, hash table, list, binary search tree (including AVL tree, red black tree and splay tree), B-tree, trie, disjoint set, graph (including minimum spanning tree and shortest path).
  - To be able to use appropriate data structures in different applications.
  - To be able to implement abstract data types.
  - To be able to analyse the complexity of simple algorithms (such as searching and sorting).


===== Learning Activities =====
  - Lectures
  - Tutorials
  - Web resources
  - Assignments
  - Examinations

====== Personnel ======

| ^  Lecturer  ^  Tutor  ^  Tutor  ^  Tutor  ^  Tutor  ^
^ Name |  [[:home|Irwin King]]  |  Yuanming Yu  |  Hongyi Zhang  |  Shenglin Zhao  |  Fei Chen  |
^ Email |  king AT cse.cuhk.edu.hk  |  ymyu AT cse.cuhk.edu.hk   |  hyzhang AT cse.cuhk.edu.hk  |  slzhao AT cse.cuhk.edu.hk  |  fchen AT cse.cuhk.edu.hk  |
^ Office   |  SHB 908  |  SHB 805   |  SHB 1024  |  SHB 1024  |  SHB 913  |
^ Telephone   |   3943 8398   |  NA  |  5984 1406 \\ (inquiry for homework)  |  5983 2723 \\ (inquiry for lab session)  |  NA  |
^ Office Hour(s)   |  * M8, Monday 3:30 to 4:30\\ * T8, Tuesday 3:30 to 4:30\\  * By appointment  |  NA  |  * H7, Thursday 14:30 to 15:30  |  * H8, Thursday 15:30 to 16:30  |  NA  |
Note: This class will be taught in<html> <font color="red">English</font></html>. Homework assignments and examinations will be conducted in English.

====== Syllabus ======
The pdf files are created in Acrobat XI. Please obtain the correct version of the [[http://www.adobe.com/prodindex/acrobat/readstep.html#reader | Acrobat Reader]] from Adobe.

^ Week   ^    Date     ^  Topics  ^  Tutorials  ^  Homework & Events  ^  Resources  ^   
|  1     |  3/9    |  **Introduction**\\ \\ {{:teaching:csci2100b:csci2100b-2013-01-introduction.pdf|Introduction.pdf}}  |   **No Tutorials**  |   TBA   |  TBA  | 
|  2     |  10/9  |  **Algorithm Analysis**\\ \\ {{:teaching:csci2100b:csci2100b-2013-02-analysis.pdf|Analysis.pdf}}   |   Introduction on C    |   TBA     |  TBA  |
|  3     |  17/9  |  1.**Recurrence Relations**\\ 2. **List, Stacks, and Queues**\\ \\  {{:teaching:csci2100b:csci2100b-2013-02.1-recurrence.pdf|Recurrence.pdf}} \\ {{:teaching:csci2100b:csci2100b-2013-03-lsq.pdf|LSQ.pdf}}     |    Online Judge System    |   * HW #1 ({{:teaching:csci2100b:hw116_new.pdf|Version 1.16}})\\ * Written Assignment (Due on or before 5:00 pm, Friday, Sep 27, 2013)\\ * 1.1 (6), (8), (12) and (13); 1.2 (3); 1.3 (1) and (5); 1.4 (5) and (6); 1.6 (1), (3), and (5); 1.8 (3); 1.9 (2) and (4)\\ \\ * Programming Assignment (From 12:00 am, Monday, Sep 23, 2013 to 11:59 pm, Sunday, Sep 29, 2013)\\ * 1.17 (Problem 1) and 1.20 (Problem 2)   |  TBA  |
|  4     |  24/9  |  **Tree Data Structures and Algorithms** \\   \\  {{:teaching:csci2100b:csci2100b-2013-04-tree.pdf|Tree.pdf}}    |  I/O Issues in C  |   TBA   |   TBA   |
|  5     |  1/10  |  Public Holiday   |  List, Stacks, and Queues in C  |   TBA   |  TBA   |
|  6     |  8/10  |  **Tree Data Structures and Algorithms**   |  Trees in C  |   TBA   |  TBA   |
|  7     |  15/10  |   **Hash Functions**\\  \\ {{:teaching:csci2100b:csci2100b-2013-05-hash.pdf|Hash.pdf}}    |  Hash in C  |  *HW #2 ({{:teaching:csci2100b:hw117_update.pdf|Version 1.17}}) \\   * Written Assignment (Due on or before 5:00 pm, Monday, Oct 28, 2013)\\      * 3.2 (2); 3.3 (2); 3.5; 3.9 (please zoom in); 3.10; 3.11; 3.12 (2); 3.18; 4.1 (1) and (2); 4.4; 4.15; 5.1; 5.2 \\  \\  * Programming Assignment (From 12:00 am, Monday, Oct 21, 2013 to 11:59 pm, Sunday, Oct 27, 2013)\\  * 2.17 (Problem 1), 3.35 (Problem 2), and 4.17 (Problem 3) \\    |  TBA  |
|  8     |  22/10  |  1. **Heaps**\\  2. **Sorting Algorithms**  \\ \\  {{:teaching:csci2100b:csci2100b-2013-06-heaps.pdf|Heaps.pdf}} \\   {{:teaching:csci2100b:csci2100b-2013-07-sort.pdf|Sort.pdf}}     |  Heaps in C  |  {{:teaching:csci2100b:solutions_1.pdf|Solutions for HW#1}}   |  TBA  |
|  9     |  29/10  |  **Sorting Algorithms**  |  HW #2 Solution  |  {{:teaching:csci2100b:homework_2_solution_updated.pdf|Solutions for HW#2 (Written part)}}   |  {{:teaching:csci2100b:midterm_programming_12-13t2.pdf|Programming Midterm Paper 12-13 Term 2}}  |
|  10     |  5/11  |  **Midterm Written Exam** \\ \\ **Midterm Programming Exam**   |   PC2 Tutorial for Midterm   |  {{:teaching:csci2100b:solutions_pa_2.pdf|Solution for HW#2 (Programming part)}}  |  TBA  |
|  11     |  12/11  |  **Sorting Algorithms**  |  Written Midterm Solution  |  TBA  |  TBA  |
|  12     |  19/11  |   **Graph Data Structures and Algorithms**   \\ \\  {{:teaching:csci2100b:csci2100b-2013-08-graphs.pdf|Graphs.pdf}}  |  Quicksort and Mergesort in C  |  * HW #3  |  TBA   |
|  13     |  26/11  |   1. **Graph Data Structures and Algorithms**   \\ \\ 2. **Course Summary**  |  Graph Revisited  |   TBA  |  TBA   |

<box 90% round red | **Tutorial Page**>
  * For detailed tutorial and lab session information, please go to [[:teaching:csci2100B:2013:tutorial|Tutorial Page]].
</box>

<box 90% round blue | **Manual Page**>
  * For supplementary material on various topics related with this course, please go to [[:teaching:csci2100B:2013:manual|Manual Page]]. Enjoy your Exploration.
</box>

====== Examination Matters ======
===== Examination Schedule =====
|              ^        Time           ^        Venue          ^    Notes    ^
^    Midterm Examination\\ Written    |   9:30 am - 11:30 am, Nov 5, 2013  |  LSB LT1  |  The scope is all materials up to heaps (including heaps). \\ You can bring one cheat sheet (A4, both sides) of notes. Calculator is not required.  |
^    Midterm Examination\\ Programming    |    6:00 pm - 9:30 pm, Nov 8, 2013  |  SHB 924  |  The scope is all materials up to heaps (including heaps).\\ You can bring print outs of previous programming homework assignments.  |
^    Final Examination    |  3:30 pm - 5:30 pm, Dec 9, 2013  |  Multi-purpose Hall, Pommerenke Student Centre  |  The final examination covers all materials presented in the class, but emphasizes more on the materials after the midterm. This is a closed book examination.   |

  * [[http://rgsntl.rgs.cuhk.edu.hk/rws_prd_life/main1.asp|CUHK Registration and Examination]]

===== Programming Midterm Matters =====
  - The programming midterm is an open-book and open-notes examination.  You may bring what you can carry on printed (hard copy) materials to room 924.  You MUST not take anything that can record program code electronically to the examination venue.  You will not need a calculator for any calculation.
  - The operation system will be Ubuntu. And the computer configuration will have these basic editors:
    - vi/vim
    - emacs
    - gedit
    - nano
  - If you would like to have other editors, you MUST send an email to the instructor and TAs no later than 7 days before the examination date and it will be subject to approval to be included on the computer system.
  - You should arrive to the venue before 5:30 pm on the day of the examination to receive your information and check the system.
  - The examination will begin when the Chief TA starts the clock and will end when the Chief TA stops the clock, which is usually three hours after the starting time including any missing time due to technical and other difficulties.
  - You should work on Problem #1 first and then others afterwards.  They are in increasing difficulties as judged by the instructor.
  - You MUST complete one problem in order not to fail the course.
  - Anyone who attempts to spam the server either through excessive submissions, allocating large amount of unnecessary memory, etc. will be penalized severely.
  - If you leave early from the examination, you will not be able to come back to the examination.

===== Written Midterm Matters =====
  - The midterm will test your knowledge of the materials up to Homework #2, that will be to include Heaps.
  - Answer all questions using the answer booklet. There will be more available at the venue if needed.
  - You can bring one sheet (A4, both sides) of notes. Calculator is not required. No electronics are allowed.
  - Write legibly. Anything we cannot decipher will be considered incorrect.

====== Grade Assessment Scheme ======
^  Final Examination\\ (Written)  ^  Midterm Examination\\ (Written Part)  ^  Midterm Examination\\ (Programming Part)  ^  Assignments  ^
|  50%  |  10%  |  20%  |  20%  |

  -Assignments (20%) 
    -Written assignment 
    -Programming assignment 
    -Optional quizs 
    -Late penalty: 10% for each day (no late than 4 days, only applicable for written assignment)
  -Midterms (30%)
    - Written (10%)
    - Programming (20%)
  -Final Examination (50%) 
  -Extra Credit (There is no penalty for not doing the extra credit problems. Extra credit will only help you in borderline cases.) 

Note: One must solve at least one problem in the programming examination to pass the examination. 


====== Required Background ======
  - Pre-requisites
    -- CSCI 1110 or 1130 or its equivalent. (Not for students who have taken CSCI 2520). 

====== Reference Books ======
/*
  - [[http://www.amazon.com/exec/obidos/ASIN/0201498405/qid%3D949475985/sr%3D1-6/002-0319810-4772266|Data Structures and Algorithm Analysis in C]], **Mark Allen Weiss, Addison Wesley, second edition, 1997.**
  - [[http://www.amazon.com/exec/obidos/ASIN/0805316663/ref=sim_books/002-0319810-4772266|Data Structures and Algorithm Analysis in C++]], **Mark Allen Weiss, Addison Wesley, second edition, 1999.**
*/
  - {{amazon>0201498405}} <bibtex>@Book{weissc,
  AUTHOR     = {Weiss, Mark},
  YEAR       = {1997},
  TITLE      = {Data Structures and Algorithm Analysis in C},
  PUBLISHER  = {Addison Wesley},
  address    = {},
  series     = {},
  volume     = {},
  pages      = {},
  month      = {},
  edition    = {},
  keywords   = {},
  summary    = {},
  supersedes = {D-<oldumber>},
  SEMNO      = {D-<newnumber>},
  PUF        = {Bog},
  ID         = {Bog},
  URL      = {http://www.amazon.com/exec/obidos/ASIN/0201498405/qid%3D949475985/sr%3D1-6/002-0319810-4772266}}
</bibtex>
  - {{amazon>0201498405}} <bibtex>@Book{weissc++,
  AUTHOR     = {Weiss, Mark},
  YEAR       = {1999},
  TITLE      = {Data Structures and Algorithm Analysis in C++},
  PUBLISHER  = {Addison Wesley},
  address    = {},
  series     = {},
  volume     = {},
  pages      = {},
  month      = {},
  edition    = {},
  keywords   = {},
  summary    = {},
  supersedes = {D-<oldumber>},
  SEMNO      = {D-<newnumber>},
  PUF        = {Bog},
  ID         = {Bog},
  URL      = {http://www.amazon.com/exec/obidos/ASIN/0805316663/ref=sim_books/002-0319810-4772266}}
</bibtex>
  - {{amazon>0262031418}} <bibtex>@Book{cormen,
  AUTHOR     = {Cormen, Thomas H. and Leiserson, Charles E. and Rivest, Ronald L.},
  YEAR       = {1990},
  TITLE      = {Introduction to Algorithms},
  PUBLISHER  = {The MIT Press},
  address    = {},
  series     = {},
  volume     = {},
  pages      = {},
  month      = {},
  edition    = {},
  keywords   = {},
  summary    = {},
  URL      = {http://www.amazon.com/Introduction-Algorithms-Electrical-Engineering-Computer/dp/0262031418}}
</bibtex>


====== Other Books ======
  - [[http://www.amazon.com/exec/obidos/ASIN/0201000237/qid%3D949476152/sr%3D1-1/002-0319810-4772266|Data Structures and Algorithms]], **Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman, Addison Wesley, 1983.**
  - [[http://www.amazon.com/exec/obidos/ASIN/0262530910/qid%3D949476326/sr%3D1-3/002-0319810-4772266|Introduction to Algorithms]], **Thoas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, MIT Press, 1990.**
  - [[http://www.amazon.com/exec/obidos/ASIN/067339736X/qid%3D949476404/sr%3D1-1/002-0319810-4772266|Data Structures and Their Algorithms]], **Harry R. Lewis and Larry Denenberg, HarperCollins Publisher, 1991.**
  - [[http://www.amazon.com/exec/obidos/ASIN/0130369977/qid%3D949476491/sr%3D1-2/002-0319810-4772266|Data Structures Using C and C++]], **Aaron M. Tenenbaum, Yedidyah Langsam, and Moshe J. Augenstein, Prentice Hall, 1995. **

====== Book Sources ======
  - **Academic & Professional Book Centre**, 1H Cheong Ming Bldg., 80-86 Argyle St., Kowloon, 2398-2191, 2391-7430 (fax) 
  - **Caves Books (H. K.)**, 4B Ferry St., G/F., Yaumatei, Kowloon, 2780-0987, 2771-2298 
  - **Man Yuen Book Company**, 45 Parkes street, Jordan Road, Kowloon, Hong Kong, 2366-0594. Not very large, Asian edition books, fair price, wide range, some 10% discount.
  - **Swindon Book Co. Ltd**, 13-15 Lock Road, Tsim Sha Tsiu, Kowloon, 2366-8001.  One of the largest book stores in Hong Kong, exchange rate is not favorable.
  - **Hongkong Book Centre**, 522-7064.  A branch of the Swindon book shop.

====== FAQ ======
  - **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, inclusion of others' works or results without citation in assignments and reports is also regarded as plagiarism with 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 are some of the common mistakes made in online and real-time contest?**\\ A: There are a few common mistakes. Please check out [[http://www.acm.org/crossroads/xrds7-5/contests.html|this site]] for more information.
  - **Q: What does error message 'Restricted Function' mean in online judge?**\\ A: There is no standard definition of "Restricted Function". One general accepted guideline is that any code which may threat the system should not be executed. More specifically, any functions which are not need when solving the problem should not be called. There are several possible reasons: 1. Using file-operating functions which are not allowed; 2. Mis-usage of pointers or malloc(); 3. Using system('pause').

====== Resources ======

  -[[http://www.cyberdiem.com/vin/learn.html|Learn C/C++ Today]]
  -[[http://www.awl.com/cseng|Addison Wesley's Computer and Engineering Book Catalog and Programming Codes ]]
  -[[http://www.mathworks.com/|Matlab Homepage]]
    This site is the creator of Matlab. You will be able to obtain much Matlab-related information. 
  -[[http://www.cse.cuhk.edu.hk/~acmprog|CSE's ACM Programming Contest Homepage]]
  -C Programming 
    -http://www.strath.ac.uk/CC/Courses/OldCcourse/CCourse.html 
    -http://www.cm.cf.ac.uk/Dave/C/CE.html 
    -http://devlib.virtualave.net/dir/files/cguide_3.zip 
  -[[http://pweb.netcom.com/~tjensen/ptr/pointers.htm |Arrays and Pointers]]
  -[[http://gcc.gnu.org/onlinedocs/gcc/|The 'gcc' compiler]] 
  -[[http://sourceware.org/gdb/current/onlinedocs/gdb_toc.html|The 'gdb' debugger]] 
  -[[http://www.gnu.org/software/make/manual/make.html|The 'make' utility]]  
  -[[http://www.redhat.com/developer/whitepapers/intro_dev/|Programming C under Linux, provided by RedHat]]
  -[[http://cg.scs.carleton.ca/~morin/misc/sortalg/|Sorting Algorithm Animation Demo]]  
  -[[http://pauillac.inria.fr/algo/AofA/|Analysis of Algorithms Home Page]]  
  -[[http://glossary.computing.society.informs.org/ |Mathematical Programming Glossary]]
  -[[http://www.cs.oswego.edu/~birgit/html/diplom/links.html |Algorithm Animation Links]] 
  -[[http://www.alistapart.com/articles/pickle/|The Pickle Story]]
Navigation

About Us

Publications

Professional Activities

Lab and Projects

Affiliated Labs

Organizations

Current Activities

See Irwin King In

Book Titles

MISC
