CmpE 250 Data Structures and Algorithms
Fall Semester 2005

Catalog Data
CmpE 250 Data Structures and Algorithms (3+0+2) 4
Complexity Hashing Heap Structures Advanced Sorting. Search Structures. Graphs Parallel Algorithms File organization.
Prerequisite:
CmpE 160

Textbook:
M. A. Weiss, Data Structures and Algorithm Analysis in Java, Addison Wesley, 1999.

Reference Books:
Drozdek Adam, Data Structures and Algorithms in Java, Brooks Cole, 2001.
Michael T. Goodrich and Roberto Tamassia, Data Structures and Algorithms in Java(3/e), Wiley and Sons, 2004.

Coordinator
Fatih Alagoz, alagoz at boun.edu.tr
ETA 304, Ext.6652

Goals
This course is designed to teach specification, usage and implementation and analysis of advanced data structures and algorithms

Assistant:
Berk Gökberk
gokberk at boun.edu.tr
ETA 203

Prerequisites by topic
1. Programming in C, C++
2. Fluency with the implementation of basic data structures
3. Some background in discrete math

Topics
1. Introduction
2. Algorithm Analysis
3. Hashing
4. Heap Structures
5. Advanced Sorting
6. Search Structures
7. Graphs
8. File organization.
9. Parallel Algorithms
10. Tests

Computer usage
1. Computer homeworks and projects are assigned covering topics above.

ABET category content as estimated by faculty member who prepared this course description
Engineering science: 1.5 credits or 37.5 %
Engineering design : 2.5 credits or 63.5 %

Grading Policy (Tentative):
Midterm exam 1 20%
Midterm exam 2 20%
Projects + Pop Quizzes + HWs 30%
Final exam 30%

Note: Midterm exam date will be announced a week prior to the exam!

Prepared by Fatih Alagoz