CSE2225/CSE 225 Data Structures (FALL 2021)
Catalog Data: The goal of this class is to provide sophomores of the computer engineering department with the knowledge of complex data types and elementary data structures, and to get them to apply the data structures in various algorithms. Moreover, students are taught popular sort and search algorithms in this course. The outline of this course is as in the following
1- Introduction and a review (Objectives, Math Review and static vs dynamic D/S)
2- Basic Algorithm Analysis + Recurrences
3- Elementary data structures (LLs, Stacks, Queues, etc)
5- Trees
6- Special Trees
7- Graphs & Graph Algorithms
8- Hashing
9- Heaps - Priority Queues
10- Sorting Techniques
Reference Books: Among many reference books, We will mostly use the two below:
1-(Textbook) Thomas H. Cormen, Charles E. Leiserson, Ronald L. Livest and Clifford Stein, Introduction to Algorithms, 2nd edition, MIT Press, 2009
2- Mark Allen Weiss, Data Structures & Algorithms Analysis in C 2nd edition, Addison-Wesley Publishing Company, 1999
Lecturer: Borahan Tumer, Ph.D.,
Associate Professor of the Computer Engineering Department
Rm M2-209; x3541; borahan.tumer@marmara.edu.tr
Office Hours: Tuesdays 15:30-16:30 and Wednesdays 12.30-13.30
Teaching Assistant: Berna Altinel, Ph.D.,Rm M2-; x3544; birol@marmara.edu.tr
Office Hours: Thursdays 14:30-16:30
Project submission e-mail address: cse2225marmara@gmail.comPrerequisite Courses: CSE142
Grading: (tentative)
1 Final 40% (covers all)
Quizes 5%
Projects: 40%
VERY IMPORTANT NOTE:
Individual effort is required and strictly expected in your projects. Your source code will be thoroughly checked both automatically by a cross check software tool and by your TA. Any attempt to any type of plagiarism will result in ALL involved students directly failing the class, their names appear in the black list of department and necessary disciplinary action taken by the instructor.
*Note that you are strongly encouraged to attend ALL the classes
Good Luck!