1. COMPE 226 Data Structures 2015 Fall Murat KARAKAYA Department of Computer Engineering

2. COMPE 226 Instructor : K. Murat KARAKAYA Email : kmkarakaya@atilim.edu.tr Office : Z-14 Lecture : Thursday 09:30-11:30 @ 1009 Friday 11:30- 12:30 @ 1009 OfficeHour : Thursday 11:30-12:00 @ Z-14 TA: TBD Email: TBD Office: TBD Course Web page is on Moodle. Check your registration!

3. Objectives & Content Objectives: introduce abstract concepts in problem solving implement concepts in C++ choose a suitable data structure for a specific problem create more complex data structures implement and analyze data structures algorithms Content: Stacks Recursion Queues Creation and destruction of dynamic variables Linked lists Sorting and searching algorithms Binary trees Hashing

4. Text Books and References Course Book: Data Structures Using C++, D.S. Malik, Thomson Course Technology, 2nd Edition. Other Sources : 1.Data Structures Using C and C++, Y.Langsam, Prentice-Hall International Inc., 2nd Edition. 2.Data Structures and Algorithm Analysis in C++, M. Weiss, Addison Wesley, 3rd Edition 3.Practical Data Structures in C++, B. Flamig, John Wiley & Sons, Pap/Dis Edition. 4.Fundamentals of Data Structures in C++, E. Horowitz, S. Sahni, D. Mehta, Silicon Press, 2nd Edition. 5.Data Structures and Algorithms in C++, M.T. Goodrich, R.Tamassia, D. M. Mount, Wiley, 2nd Edition.

5. Grading (Tentative) 2 Midterms 55% Homework Assignments10% Final Exam 35% –Passing grade >= 50..... not 49!

6. Grading Policies Missed exams: o no make-up exam for midterms without approved excuse! o you will get zero for each missed pop quiz! o no make-up exam for final for any excuse! Lateness: o Late assignments are penalized up to 20% per day o Maximum 3 days! Ethics: o All assignments/projects are to be your own work. Participation: o You are supposed to be active in the class by involving and participating disscusions via asking questions, proposing solutions, explaning your ideas, etc.

7. WEEKLY SCHEDULE AND PRE-STUDY PAGES Week Lecture Topics Pre-study Pages 1 18/09 Introduction, Standard Template Library (STL) Chapter 2, 4 2 25/09 Linked Lists (Linked List ADT, Unordered Linlked List) Chapters 5 3 02/10 Linked Lists (Ordered Linlked List) Chapter 5 4 09/10 Linked Lists (Doubly Linked List, STL Sequence Container:list,) (Compensation Lecture will be provided) Out of Campus Chapter 5 5 16 /10 Recursion Chapter 6 6 23/10 Stack Chapter 7 7 30/10 Stack MIDTERM 1 30 /10 /2014 (11:30-12:30) Chapter 7 8 06/11 Out of Campus 9 13/11 Queues Chapter 8 10 20/11 Queues Chapter 8 11 27/11 Searching, Sorting Chapter 9, 10 12 04/12 Hashing MIDTERM 2 04/12/2014 (11:30-12:30) Chapter 5 13 11/12 Binary Trees Chapter 11 14 18/12 Binary Trees Chapter 11 15 25/12 Heap Sort Chapter 11

8. EXPECTED SKILLS Very Good Knowledge and Pratice at: C++, Object Oriented programming concepts Prerequiste: COMPE 225 EXPECTED WORK LOAD –You have to review C++ and Object Oriented programming concepts –You have to implement example codes by yourself –You have to do assignments by yourself

9. Recent Success Ratios 2015 Fall ? % 2015 Spring 75% 2014 Fall 28% 2014 Summer 75% 2014 Spring 45% 2013 Fall 65% 2013 Summer 5% 2013 Spring 35%

10. Any Questions?