CMPT 238 Data Structures Instructor: Tina Tian

General Information Email: tina.tian@manhattan.edu Office: RLC 203A Office Hour: Wednesday 11:00 - 1:00 Friday 1:45 - 2:45 or by appointment Website: turing.manhattan.edu/~tina.tian

About the Course Tue, Fri 12:30 – 1:45 PM Textbooks: Starting out with C++, From Control Structures through Objects, 9th Edition by Tony Gaddis Data Structures and Other Objects Using C++, 4th Edition by Michael Main and Walter Savitch

Grading 1st Midterm Exam (in class, 5th week) 15% 2nd Midterm Exam (in class, 10th week) 15% Final Exam 30% Homework 40%

About the Homework Only hard copy is accepted. Source code Screen shots of output

About the Homework Due in a week after being announced Collected before class begins (before 12:30) Late work will not be accepted Strict deadline! No homework is accepted after the class begins What if I couldn’t attend the class? What if I was late? Email me your homework (before 12:30) to show the timestamp Hand in a printed copy later

Homework Policy You may discuss the homework with other students. However, you must independently write up your own solutions.

Advises Take notes Start homework early

Software Windows: MS Visual Studio Mac: Xcode Visual Studio Community (Free to download onto personal computers) Mac: Xcode https://developer.apple.com/xcode/ Free Compiler

What will be covered This course will introduce fundamental algorithms and data structures of computer science Searching and sorting arrays (Gaddis Chap 8) Binary search Bubble sort Selection sort Insertion sort (M&S Chap 13)

What will be covered (cont.) Basic data structures Linked lists (Gaddis Chap 17) Stacks (Gaddis Chap 18) Queues (Gaddis Chap 18)

What will be covered (cont.) Recursion (Gaddis Chap 19) More sorting algorithms (Main & Savitch Chap 13) Mergesort Quicksort

What will be covered (cont.) Binary trees (Gaddis Chap 20)

Homework Review your old 102 assignments Practice C++