schedule

Major Topics Covered in the course:

__

DATE

TOPICS

Assignments/ Exams

Jan. 12, 14 (Ch.1.1-1.5)

Course administration & overview Abstract data type (ADT), encapsulation and information hiding, classes and inheritance

A1 – Jan 14

Jan. 19, 21

(Ch.1.6-1.7, 2.1-2.5)

Object-oriented program design, polymorphism and dynamic binding, basic data types, number systems, internal data representation, enumerated data types; pointer ADT. C++: enumeration type, pointers & dynamic storage.

A1 due Jan 21

Q1, A2 – Jan. 21

Jan. 26, 28

(Ch.2.6-2.9)

C++: arrays, strings, struct.

A2 due Jan. 28 A3, Q2 – Jan. 28

Feb. 2, 4

(Ch.2.10)

ADT’s and basic data types; internal data representation. Searching and sorting with arrays and records,

A3 due Feb. 4

A3a, Q3 – Feb. 4

Feb. 9, 11

(Ch.2.10,3) (handout)

ADT’s and files; OO software development methodology Introduction to searching and sorting.. C++: files, class composition.

A3a due Feb. 11

A4, Q4 – Feb. 11

Feb. 16 (Ch.3)

Feb. 18

ADT, OOD and classes, constructors.

Exam 1

A4 due Feb. 25

Feb. 23

Feb. 25 (Ch.4)

Exam 1 solutions & discussion algorithms, sequential & binary search.

A5

Mar. 2, 4 (Ch.5)

Stack & queues Simulation Examples.

Q5 – Mar. 4

Mar. 9, 11 (Ch.6)

Abstract operators, C++ operator overloading, friend functions.

A5 due Mar. 11

A6 ,Q6 – Mar. 11

Mar. 16 (Ch.8.1-8.5)

 

Mar. 18

Classes & dynamic memory; Assignment and initialization safe arrays, and string class

Exam 2

 

Mar. 30

April 1 (Ch.9)

Exam 2 solutions & discussion Linked lists.

A6 due – April 1

A7 – Mar. 30

April 6, 8 (Ch.10)

Recursion.

Q7, A7 due April 8

April 13, 15 (Ch.11.1-11.3)

Introduction to trees.

A7 due April 13

A8 – April 13

April 20 (Ch.11.4-11.6)

More on trees.

Q8 – April 15

April 22

Review for final

 

May 7

Final Exam 8:00 AM – 10:00 AM

 

 

 

 

Main | Assignments | Student Info | Study Guides | Syllabus

Comments/Questions? Send Mail to: [email protected]