CSC3270 Advanced Programming Lab

Fall 2006

Lecture I
Time 7:00 pm - 10:00 pm
Venue SHB 904

The Golden Rule of CSC3270: No member of the CSC3270 community shall take unfair advantage of any other member of the CSC3270 community.

Course Description

The course will mainly focus on programming exercises for advanced data structures and algorithms. Topics include dynamic programming, computational geometry, number theory, simulation, combinatorial problems, optimization techniques, graph theory, etc. Prerequisites: CSC1140 and 2100. Corequisite: CSC3160.


Lecturer Lecturer Tutor Tutor
Name Irwin King Justin Yip Jackie Zhu Peng Xiang
Email king AT TBD jkzhu AT xpeng AT
Office Rm 908 TBD Rm101 Rm1013
Telephone 2609 8398 TBD 3163 4257 2609 8431
Office Hour(s) TBD TBD TBD TBD

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 Homework & Events
Score Board
1 11/9 Searching: BFS&DFS
2. Breadth-First Search (BFS)
3. Depth-first search (DFS)
4.Topological sort, etc.
TBD Breadth-First Search (BFS)
Depth-first search (DFS)
Topological sort
2 18/9 TBD TBD
3 25/9 TBD IEPROG2006-C.txt
4 2/10 Public Holiday TBD
5 9/10 TBD TBD
6 16/10 TBD TBD
7 23/10 TBD 1790 - The Geodesic Set Problem
1792 - Gap Punishment Alignment Problem
00005 - Cashiers
719 - Glass Beads
2221 - Taxi Cab Scheme
3013 - Overlaying Maps
607 - Scheduling Lectures
Due: 23:59, Dec 31, 2006, firmly.
The deadline for assg1 is also extended to this time.
8 30/10 Public Holiday TBD
9 6/11 TBD TBD
10 13/11 TBD TBD
11 27/11 TBD TBD
12 4/12 TBD TBD


  1. Please submit your homework assignment following the Guidelines.

Examination Schedule

Time Venue Notes
Midterm Examination TBD TBD TBD
Final Examination TBD TBD TBD

Grade Assessment Scheme

  1. Attendance, 25%
  2. Homework Assignments and Quizzes, 50%
  3. Mini-contests, 25%

Note: The minimum passing grade is to achieve at least 40 out of 100 in the final examination.

Programming Requirement

Familiarity with the following topics is highly recommended:

  1. Data Structure: data types and structures, lists, queues, stacks, trees, sets, etc.
  2. Algorithm: analysis, design, sorting methods, numerical methods, algorithms on graphs, etc.
  3. Operating System & Programming Environment: Unix systems, C, SQL, and Matlab.

Reference Books

  1. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Cliff Stein, MIT Press.
  2. The Art of Computer Programming, Donald E. Knuth, Addison-Wesley, 1997.
  3. Introduction to Graph Theory, Douglas B. West,Prentice Hall, 2001.
  4. Combinatorial Optimization: Networks and Matroids, Eugene Lawler, Dover Publications, 2001.
  5. Computational Geometry in C, Joseph O'Rourke, Cambridge University Press, 1994.

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 happens if a person is caught plagiarizing someone else's work?

A: The CSE department has a very strict guideline on this issue. The guideline is as follows:

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.



teaching/csc3270/2006.txt · Last modified: 2006/10/25 08:47 (external edit)     Back to top