1. COMP2012 Object-Oriented Programming and Data Structures Fall 2015

2. Slide 2 Lectures * Instructor: Long QUAN * Lectures: n Tuesday & Thursday 3h-4h20 pm, G010 * Web site: n (https://course.cse.ust.hk/comp2012)https://course.cse.ust.hk/comp2012 n http://www.cse.ust.hk/~quan/comp2012/index.html http://www.cse.ust.hk/~quan/comp2012/index.html n Lecture notes n Assignments, test cases and solutions n Download course material before class * Labs

3. Slide 3 Textbook * Main book: n ADTs, Data Structures, and Problem Solving with C++, Prentice Hall, Larry Nyhoff * My reference book: n The C++ Porgramming language, Addison Wesley, Stroustrup --- creator of C++

4. Slide 4 Grading Scheme * Grading is based on n 3 Programming Assignments (10+10+10%=30%) n 11 Lab exercises (10%), 1% each, and the best 10 n Midterm Examination (25%) n Final Examination (35%)  The final has to be consistent with the overall score  If you perform well in the final, you may not fail the course  If you perform poorly in the final, you may not get an A

5. Slide 5 Plagiarism Policy * 1 st Time: both get 0 * 2 nd Time: both get 0 + one full downgrade * 3 rd Time: FAIL * Midterm or Final: an automatic FAIL You are encouraged to collaborate in study groups. But, you cannot copy or slightly change other students’ solutions or codes. The detection of plagiarism is computerized!

6. Slide 6 Course Overview * A fundamental computer science course - Essential for programming - Essential for advanced courses, e.g. 271 * A challenging course, which needs - Mathematical and logic thinking - Programming * 104,151,171 have been revamped to become (the new) 152!

7. Slide 7 Course Prerequisite * COMP104 n Need to know C and C++ n PC programming environment n Good programming skills n Translate pseudo-codes into codes n Speedy review in the 1 st week * Basic mathematical skills n Solving recursive equations, manipulation of symbols, etc. * Computer architecture n Pointers, storage, memory access, etc.

8. Slide 8 8 Course Outline * C++ review (1 week) * Recursions and algo analysis (1 week) * Sorting (1 week) * Lists (1 week) * OOP1: concept and classes (2 weeks) * Data structures: stacks, and queues (1 weeks) Midterm * Generic programming and STL (1 weeks) * OOP2: inheritance, polymorphism and virtual functions (2 weeks) * Data structure 2: binary trees (2 weeks) * Hashing (1 week)

9. Slide 9 Overall Goal of the Course * From programmer to architect * Learn to solve problems * Algorithms and Programming go hand in hand * Learn to analyze your solutions

10. Slide 10 Lecture Format * Lectures: n Slides are available before class  Print in ‘graylevel’ as ‘handouts’!!!  Constantly updated, only minorly!!! n It is important to attend the lectures (because not all material and concepts are covered in slides) n If you miss any lectures, learn from your friends * Labs n Compulsary! n Weekly programming practice * Programming assignments n More rigorous problems to consolidate your knowledge n Manipulation of polynomials  Linked list data structure  Class-based implementation  STL and advanced functions  Bonus? Anything beyond the three assignments

11. Slide 11 Assignments * Programming assignments n Due by time specified n Run on PC n Submit it using CASS n Re-grade policy will be announced * Late policy : allows only one day late for at most one assignment, 2 days late is not accepted

12. Slide 12 Midterm and Final Examinations * (Check the schedule with all students!) * Midterm: 20th Oct in class! * Final: TBA * Closed-book, closed-notes * No make-ups will be given n Unless under very unusual circumstances, with letters of proof n Instructor informed beforehand