1 / 10

COMPE 226 Data Structures 201 5 Fall Murat KARAKAYA Department of Computer Engineering

This course aims to introduce abstract concepts in problem solving and implement them in C++. Students will learn to choose suitable data structures, create complex ones, and analyze algorithms. Topics covered include stacks, recursion, queues, linked lists, sorting and searching algorithms, binary trees, and hashing.

jonathanrudd
Télécharger la présentation

COMPE 226 Data Structures 201 5 Fall Murat KARAKAYA Department of Computer Engineering

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. COMPE 226 Data Structures 2015Fall 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 Office Hour :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 implementconcepts in C++ choose asuitable 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: Data Structures Using C and C++, Y.Langsam,Prentice-Hall International Inc., 2nd Edition. Data Structures and Algorithm Analysis in C++, M. Weiss,Addison Wesley, 3rd Edition Practical Data Structures in C++, B. Flamig, John Wiley &Sons, Pap/Dis Edition. Fundamentals of Data Structures in C++, E. Horowitz, S.Sahni, D. Mehta, Silicon Press, 2nd Edition. Data Structures and Algorithms in C++, M.T. Goodrich,R.Tamassia, D. M. Mount, Wiley, 2nd Edition.

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

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

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

  8. 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%

  9. Any Questions?

More Related