L01_ho1 - Spring 2010 COMP152: Object-Oriented Programming...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
COMP152: Object-Oriented Programming and Data Structures Dit-Yan Yeung Professor Department of Computer Science and Engineering Spring 2010
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
COMP152 Course Introduction 2 Lecture Wed & Fri, 15:00-16:20, Rm 2407 (Lifts 17-18) Tutorial 2A: Wed, 09:30-10:20, Rm 5583 (Lifts 29-30) 2B: Thu, 11:00-11:50, Rm 1511 (Lifts 27-28) 2C: Thu, 09:30-10:20, Rm 1511 (Lifts 27-28) Lab 2A: Thu, 11:30-13:20, Rm 4214 (Lift 19) 2B: Thu, 09:00-10:50, Rm 4214 (Lift 19) 2C: Mon, 13:00-14:50, Rm 4214 (Lift 19) Linux lab: both Eclipse and command-line environments are available Web site: http://course.cse.ust.hk/comp152/csd_only/dyyeung/ Lecture, tutorial and lab materials Assignments, exams, grades, etc. Do not print any material marked as “draft only”
Background image of page 2
Course Instructor Course Introduction 3 Dit-Yan Yeung Email: dyyeung@cse.ust.hk WWW: http://www.cse.ust.hk/~dyyeung/ Office: Rm 3541 (Lifts 25-26) Phone: 2358-6977 Office hours: Wed & Fri, 16:30-17:30 Or by appointment
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Course Description in Academic Calendar To learn the fundamental concepts and techniques behind object-oriented programming. They include: abstract data types; creation, initialization, and destruction of objects; class hierarchies; polymorphism, inheritance and dynamic binding; generic programming using templates. To learn the object- oriented view of data structures: linked lists, queues, stacks, trees, and algorithms such as searching, sorting, and hashing algorithms. [4 course credits] Course introduction 4
Background image of page 4
Intended Learning Outcomes By the end of this course, students are expected to know how to: write object-oriented programs in C++ with object construction and destruction, member variables and functions, inheritance, polymorphism, and templates; develop large programs using separate compilation, good object- oriented design, and code reuse; write basic algorithms associated with data structures such as lists, stacks, queues, trees, and hashes; use binary trees and search trees to solve problems; analyze problems and provide solutions using object-oriented programming and data structures. Course introduction 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
COMP152: A Very Challenging Course Course Introduction 6 Covering object-oriented programming (OOP) in C++ and how to use it to implement some important data structures These data structures make algorithms easy to implement and particularly efficient (COMP271) Lists, stacks, queues, (binary) trees, hashes, etc. Fast-paced
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 08/25/2010 for the course COMP COMP152 taught by Professor D.y.yeung during the Spring '10 term at HKUST.

Page1 / 20

L01_ho1 - Spring 2010 COMP152: Object-Oriented Programming...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online