1. CMPT 238 Data Structures Instructor: Tina Tian

2. General Information Email: tina.tian@manhattan.edu Office: RLC 203A Office Hour: Tue and Fri 12:30 - 2:00PM or by appointment Website: home.manhattan.edu/~tina.tian

3. About the Course Tue, Fri 2:00 - 3:15PM Textbooks: ▫Starting out with C++, From Control Structures through Objects, 8 th Edition by Tony Gaddis ▫Data Structures and Other Objects Using C++, 4 th Edition by Michael Main and Walter Savitch

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

5. Attendance policy Attendance is required. Students are expected to attend all classes and will be held responsible for all material covered during each class.

6. Electronic Devices Please do not check e-mail or visit websites that are not relevant to the course during class. It is a distraction, both for you and (more importantly) for your fellow classmates. Please keep your phones silent during class.

7. About the Homework Only hard copy is accepted. ▫Source code ▫Screen shots of output Make a cover page (name, homework number) ▫Comment Due in a week after being announced Late work will not be accepted

8. Homework Policy You may discuss the homework with other students. However, you must acknowledge the people you worked with. And you must independently write up your own solutions. Any written sources used (apart from the text) must also be acknowledged.

9. Advises Take notes Start homework early

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

11. 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)

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

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

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

15. Homework Review your old 102 assignments Practice C++