CSC2100B Data Structures

Breaking News

  1. 1 January 2009. Happy New Year! Welcome to CSC2100B Data Structures. This is an important fundamental course not only for Computer Scientists but for all engineering students. The knowledge learned here can be applied in any programming environment to help you write better programs and applications. Let's have fun in this course!
  2. 5 January 2009. No tutorial this week as the TAs are busy setting up the on-line judge system.
  3. 12 January 2009. The tutorials will begin this week.
  4. 27 February 2009. Due to DNS problems, the deadline for programming assignment of HW#2 is now set to 11:59 pm, Sunday, March 1, 2009.
  5. 27 February 2009. Due to a special circumstance, the written midterm will be held on Monday, 16 March 2009. The programming midterm may be held on either Saturday, 21 or 28 March 2009.

  6. CSC2100B Written Midterm At-A-Glance

    • Date: Monday, March 16, 2009
    • Time: 2:30 pm to 4:15 pm
    • Venue:
      • Science Centre LT1: Family name from AH SEN, DAVID HOCK KAM to LAM, JOY YAN
      • TCW LT7: Family name from LAM, KAI HUNG to ZHANG, XIAO
    • Scope: Materials discussed in class up to homework assignment #2 (up to trees)
    • What To Bring: pencil, eraser, and your ID. No need to have calculators. Answer script and addition papers will be provided.

  7. CSC2100B Programming Midterm At-A-Glance

    • Date: Saturday, March 28, 2009
    • Time: 9:30 am to 1:30 pm
    • Venue: Room 924, PC Lab, HSH Engineering Building
    • Scope: Materials discussed in class up to programming homework assignment #3
    • What To Bring: You can bring anything that you can carried with you that does not run on batteries or give you any advantage over your classmates.

    CSC2100B Optional Programming Midterm Problems

    If you did not solve any problems in the CSC2100B Programming Midterm on Saturday, March 28, 2009, you now have another chance to demonstrate what you have learned in the class.

    1. We will put midterm problems #1, #2, and #3 on the on-line judge server for you to solve during the week of March 30-April 3.
    2. This is only for those who did not solve any problems in the midterm; however, if you would like to try to solve them, you are welcome to do so, but no extra points will be added so your ranking will remain unchanged.
    3. For those who did not solve any problem in the regular programming midterm, even if you solved all three problems in the optional programming midterm, your ranking will not be higher than those who solved at least one problem during the regular programming midterm.
    4. The ranking for the optional programming midterm will be the same as the regular programming midterm, i.e., your ranking will be higher if you solve more problems with fewer penalties.
    5. We will use MOSS to check for plagiarism against all submissions. Hence, do your own work.

    We are doing this to obtain a ranking of all students. Please do your best to obtain a good anking. Good luck!

    • Date: Monday, March 30 to Friday, April 3, 2009
    • Time: 12:01 am, Monday, March 30 to 11:59 pm, Friday, April 3, 2009
  9. 7 April 2009. The deadline for written homework assignment #4 will be extended until 6:00 pm, Thursday, April 9, 2009 since some parts of the assignment have not been covered adequately in class. The students are advised to review the class note and finish their homework assignment. Moreover, for the maximum flow problem, you need not generate the table. Using graphs to answer the question is fine. If you have used both graphs and table to answer the question, please alert the TA and some extra credit will be given.

Extra Credit Assignments

  1. Give an appropriate data structure for the Chinese Checker board. You should define the data structure, the origin, how the moves are generated, how to detect boundaries, and how to detect valid moves.
  2. Give another good illustrations on data structure.

Spring 2009

Lecture I Lecture II Tutorial I Tutorial II
Time M7-8, 2:30 pm - 4:15 pm T2, 9:30 am - 10:15 am T9, 4:30 pm - 5:15 pm H9, 4:30 pm - 5:15 pm
Venue SC L1 ERB LT ERB 404 ERB 404

The Golden Rule of CSC2100B: No member of the CSC2100B community shall take unfair advantage of any other member of the CSC2100B 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.


Learning Objectives

  1. To understand the concepts and operations of various data structures and their applications
  2. To understand the concept of abstract data types
  3. To have basic knowledge of algorithms and complexity of algorithms

Learning Outcomes

  1. 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).
  2. To be able to use appropriate data structures in different applications.
  3. To be able to implement abstract data types.
  4. To be able to analyse the complexity of simple algorithms (such as searching and sorting).

Learning Activities

  1. Lectures
  2. Tutorials
  3. Web resources
  4. Videos
  5. Quizzes
  6. Examinations


Lecturer Tutor Tutor Tutor Tutor
Name Irwin King Roy Kai Chi Chan Wai Shing Fung Hao Ma Qiao Zhao
Email king AT kcchan AT wsfung AT hma AT qzhao AT
Office Rm 908 SHB 1013 SHB 115 SHB 101 SHB 120
Telephone 2609 8398 2609 8430 3163 4257 3163 4253
Office Hour(s) * M10, Monday 4:30 to 5:30

* T3, Tuesday 10:30 to 11:30
T8, H8 H10, H11 T7, T8 T5, T6

Note: This class will be taught in English. Homework assignments and examinations will be conducted in English.


The pdf files are created in Acrobat 6.0. Please obtain the correct version of the Acrobat Reader from Adobe.

Week Date Topics Tutorials Homework & Events Resources
1 5/1, 6/1 Introduction

1. 01_Intro.pdf
No Tutorial TBD CSC2100B-090105-1
2 12/1, 13/1 1. Algorithm Analysis
2. Recurrence

1. 02_Analysis.pdf
2. 02.1_Recurrence.pdf
Online Judge Guide and Introduction to C Read Chapter 1 and 2 CSC2100B-090112-1
3 19/1, 20/1 List, Stacks, and Queues

1. 03_LSQ.pdf
List and Stacks * Read Chapter 3

* HW #1 (version 1.05)
* Written Assignment (Due on or before 6:00 pm, Thursday, February 5, 2009)
* 1.1 (2), (4), and (5); 1.2 (1) and (2); 1.3 (3) and (4); 1.4; 1.5 (3) and (4); 1.8

* Programming Assignment (Due on or before 11:59 pm, Friday, February 6, 2009)
* 1.13 and 1.14
Please check the announcement in tutorial page
5 2/2, 3/2 List, Stacks, and Queues

Tree Data Structures and Algorithms

1. 04_Tree.pdf
TBD TBD CSC2100B-090202-1
6 9/2, 10/2 Tree Data Structures and Algorithms TBD * Read Chapter 4

* HW #2 (version 1.07) NEW!
* Written Assignment (Due on or before 6:00 pm, Wednesday, February 25, 2009)
* 3.1 (3); 3.2 (3); 3.3 (3); 3.4; 3.6 (3); 3.7; 3.10; 3.11

* Programming Assignment (Due on or before 11:59 pm, Friday, February 27 Sunday, March 1, 2009) NEW!
* 2.12 and 3.33.
Please check the announcement in tutorial page
7 16/2, 17/2 Hash Functions

1. 05_Hash.pdf
TBD TBD CSC2100B-090216-1
8 23/2, 24/2 1. Hash Functions
2. Heaps
TBD * Read Chapter 5

* HW #3 (version 1.07)
* Written Assignment (Due on or before 6:00 pm, Friday, March 13, 2009)
* 3.12 (3), 3.13 (3), 3.14 (3), 3.16, 3.17, 4.1 using inputs {1234, 3456, 5678, 7890, 5432, 8765, 6543, 9876}, 4.3, 5.1, 5.2, 5.7.

* Programming Assignment (Due on or before 11:59 pm, Friday, March 13, 2009)
* 2.7 and 3.32.
Please check the announcement in tutorial page
9 2/3, 3/3 Sorting Algorithms

1. 06_Heaps.pdf
2. 07_Sort.pdf
TBD TBD CSC2100B-090302-1
10 9/3, 10/3 Sorting Algorithms TBD TBD CSC2100B-090309-1
Sorting Algorithms
Graph Data Structures and Algorithms

1. 09_Graphs.pdf
TBD * HW #4 (version 1.07)
* Written Assignment (Due on or before 6:00 pm, Tuesday, April 7 Thursday, April 9, 2009)
* 6.1, 6.2.3, 6.4.2, 6.5, 6.6.1, 7.1, 7.3, 7.4, 7.5, 7.7
Please check the announcement in tutorial page
13 30/3, 31/3 NO CLASS TBD TBD TBD
14 6/4, 7/4 Graph Data Structures and Algorithms TBD TBD CSC2100B-090406-1
15 13/4, 14/4 EASTER HOLIDAY
Course summary and final examination pointers
TBD TBD CSC2100B-090414-1

Tutorial Page

Examination Matters

Examination Schedule

Time Venue Notes
Midterm Examination
Midterm Examination
Final Examination TBD TBD The final examination covers all materials presented in the class but emphasizes more on the materials after the midterm.

Programming Midterm Matters

  1. 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.
  2. The computer configuration will have these basic editors:
    1. VI
    2. Visual Studio
    3. Notepad++
  3. 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.
  4. You should arrive to the venue before 9:30 am on the day of the examination to receive your information and check the system.
  5. 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.
  6. You should work on Problem #1 first and then others afterwards. They are in increasing difficulties as judged by the instructor.
  7. You MUST complete one problem in order not to fail the course.
  8. Anyone who attempts to spam the server either through excessive submissions, allocating large amount of unnecessary memory, etc. will be penalized severely.
  9. If you leave early from the examination, you will not be able to come back to the examination.

Written Midterm Matters

  1. The midterm will test your knowledge of the materials upto Assignment #3, that will be to include Trees.
  2. You will be assigned the venue according to your last name.
  3. Answer all questions using the answer booklet. There will be more available at the venue if needed.
  4. Write legibly. Anything we cannot decipher will be considered incorrect.

Grade Assessment Scheme

Final Examination
Midterm Examination
(Written Part)
Midterm Examination
(Programming Part)
Essays Presentation Lab reports Assignments
50% 10% 20% % % % 20%
  1. Assignments (20%)
    1. Written assignment
    2. Programming assignment
    3. Optional quizs
  2. Midterms (30%)
    1. Written (10%)
    2. Programming (20%)
  3. Final Examination (50%)
  4. 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

  1. Pre-requisites
    1. - CSC 1110 or 1130 or its equivalent. (Not for students who have taken CSC 2520).

Reference Books

  1. failed to fetch data: Could not connect to Connection timed out (110)

    [1997, book | www]
    Mark Weiss, Data Structures and Algorithm Analysis in C, Addison Wesley, 1997.

  2. failed to fetch data: Could not connect to Connection timed out (110)

    [1999, book | www]
    Mark Weiss, Data Structures and Algorithm Analysis in C++, Addison Wesley, 1999.

Other Books

  1. Data Structures and Algorithms, Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman, Addison Wesley, 1983.
  2. Introduction to Algorithms, Thoas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, MIT Press, 1990.
  3. Data Structures and Their Algorithms, Harry R. Lewis and Larry Denenberg, HarperCollins Publisher, 1991.
  4. Data Structures Using C and C++, Aaron M. Tenenbaum, Yedidyah Langsam, and Moshe J. Augenstein, Prentice Hall, 1995.

Book Sources

  1. Academic & Professional Book Centre, 1H Cheong Ming Bldg., 80-86 Argyle St., Kowloon, 2398-2191, 2391-7430 (fax)
  2. Caves Books (H. K.), 4B Ferry St., G/F., Yaumatei, Kowloon, 2780-0987, 2771-2298
  3. 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.
  4. 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.
  5. Hongkong Book Centre, 522-7064. A branch of the Swindon book shop.


  1. 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.
  2. 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
  3. 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 this site for more information.


teaching/csc2100b/2009.txt · Last modified: 2010/01/11 11:37 by admin     Back to top