CSE 122: Intermediate Programming Schedule Title Instructor Home Phone Office Phone Office Address Office Hours E-mail Meeting Days Assistant Professor Max Fomitchev 235-9785 111J IST Building TR 11:00am-1:00 pm fomitchev@comcast.net TR 8:00am – 9:15pm 112 Bouke (Section 1) TR 9:45am – 11:00am 134 Cedar (Section 2) Textbooks Data Structures: Objects, Abstraction and Design Using C++ Eliott Koffman, Paul Wolfgang ISBN 0471467553 Optional Enterprise Application Development with Visual C++ 2005 Max Fomitchev ISBN 1584503920 Prerequisites CSE 103 or CMPSC 201; MATH 140; C++ Covered Topics Visual Studio 2005 Introduction: editing, formatting, creating projects, project settings, file location (January 9th) C++ preprocessing and compilation process, preprocessor definitions (#define, #ifdef, #pragma once), debugging and stepping through the code (January 11th) Pointers, array, references, and character strings, (January 16th) Problem analysis and solution synthesis – an email checker problem, HW1 (January 18th) const references, const pointers, passing parameters by reference (January 23rd) Classes and objects, grouping data with operations, member visibility (January 25th) Polymorphism: virtual methods, abstract classes, inheritance (January 30th) Polymorphism: Shapes example (February 1st), HW1 due Static methods and static data members, static and instance data (February 6th) Templates, Complex Template, +, -, =, +=, *, + T assignment (February 13th) Pre-test review (February 15th) Test 1 (February 20th) Vector Template: Constructors, Destructor, InsertAt, [] (February 22th) Vector Template: Copy-Constructor, Deep copy, =; String Class assignment (February 27th), HW3 Linked List (March 1st), HW2 due Stack, Flow Chart (March 6th) Queues and Deques (March 8th) Recursion (March 20th) Trees: 101, Traversals (March 23th-27th) Trees: Binary Search Trees: Heaps and Priority Queues Trees: Huffman Trees: Maps and Hash tables Sorting: Selection, Bubble, Insertion, Quick Sorting: Merge, Heap, Pessimal O(N) Self-Balancing Trees: AVL Self-Balancing Trees: Red-Black Self-Balancing Trees: 2-3, 3-4 Graphs: 101, Traversal Graphs: Weighted Graphs Grading Policy Class Attendance 3 Homework 3 Tests Final Exam / Project Extra Points Letter Grades A AB+ B BC+ C D F 95-100% 90-94% 87-89% 83-86% 80-82% 76-79% 70-75% 60-69% 0-59% 30% (each class worth 1%) 10% (each) 7% (each) 19% +1% / -1%