CSE2(0/2)25 Data Structures

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)

4. Trees and Special Trees (BST, AVL, Splay, B and Red-Black trees)

5. Graphs & Graph Algorithms

6. Hashing

7. Heaps – Priority Queues

8. Sorting Techniques

Reference Books: Among many reference books, I will mostly use the two below:

1- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Livest and Clifford Stein, Introduction to Algorithms, 3^rd edition, MIT Press, 2009

2- Mark Allen Weiss, Data Structures & Algorithms Analysis in C 2^nd edition, Addison-Wesley Publishing Company, 1999

Coordinator: M.Borahan Tümer, Ph.D.,

Professor of the Computer Engineering Department

Rm # M2-209; mbt.hwks@gmail.com;

borahan.tumer@marmara.edu.tr (only for issues not related

to class’ technical content)

T. Assistant: Mehmet Kaya

Rm # M2-201; Email: kymhmt88@gmail.com

Prerequisite Courses: CSE142/1142/

Grading: (tentative)

1 Midterm 20%

1 Final 40% (covers all)

Homeworks+Quizes 10%

2 Projects*: 30%

*Submission of all projects is mandatory to pass the class.

Individual effort is required in your projects. Your source code will be thoroughly checked both automatically by a cross check software tool and by your TA. Any attempt of any type of plagiarism will result in ALL involved students DIRECTLY FAILING the class, their names will appear in the department’s black list and necessary disciplinary action will be taken.

Note that you are strongly encouraged to attend the classes.

Good Luck! ☺