COMP2012Object-Oriented Programming and

Data Structures

Fall 2015

Slide 2

Lectures

Instructor: Long QUAN Lectures:

Tuesday & Thursday 3h-4h20 pm, G010 Web site:

(https://course.cse.ust.hk/comp2012) http://www.cse.ust.hk/~quan/comp2012/index.html Lecture notes Assignments, test cases and solutions Download course material before class

Labs

Slide 3

Textbook

Main book: ADTs, Data Structures, and Problem Solving with

C++, Prentice Hall, Larry Nyhoff

My reference book: The C++ Porgramming language, Addison Wesley,

Stroustrup --- creator of C++

Slide 4

Grading Scheme

Grading is based on 3 Programming Assignments (10+10+10%=30%) 11 Lab exercises (10%), 1% each, and the best 10 Midterm Examination (25%) 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

Slide 5

Plagiarism Policy

1st Time: both get 0 2nd Time: both get 0 + one full downgrade 3rd 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!

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!

Slide 7

Course Prerequisite

COMP104 Need to know C and C++ PC programming environment Good programming skills Translate pseudo-codes into codes Speedy review in the 1st week

Basic mathematical skills Solving recursive equations, manipulation of symbols, etc.

Computer architecture Pointers, storage, memory access, etc.

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)

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

Slide 10

Lecture Format Lectures:

Slides are available before class Print in ‘graylevel’ as ‘handouts’!!! Constantly updated, only minorly!!!

It is important to attend the lectures (because not all material and concepts are covered in slides)

If you miss any lectures, learn from your friends Labs

Compulsary! Weekly programming practice

Programming assignments More rigorous problems to consolidate your knowledge Manipulation of polynomials

Linked list data structure Class-based implementation STL and advanced functions Bonus? Anything beyond the three assignments

Slide 11

Assignments Programming assignments

Due by time specified Run on PC Submit it using CASS Re-grade policy will be announced

Late policy : allows only one day late for at most one assignment, 2 days late is not accepted

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

Unless under very unusual circumstances, with letters of proof

Instructor informed beforehand