CmpE 250 Data Structures and Algorithms
Summer 2004
|
Catalog Data |
CmpE 250 Data Structures and Algorithms (3+0+2) 4 Complexity Hashing Heap Structures Advanced Sorting Search Structures Graphs. Prerequisite: CmpE 160 |
|
Textbook: |
M. A. Weiss, Data Structures and Algorithm Analysis in Java, Addison Wesley, 1999. |
|
Reference |
Drozdek Adam, Data Structures and Algorithms in Java, Brooks Cole, 2001. Additional notes: Java and Object-Oriented Programming, Bruno R. Preiss, John Wliley, 1999. |
|
Coordinator |
Fikret Gürgen, Prof. of Computer Engineering |
|
Goals |
This course is designed to teach specification, usage and implementation and analysis of advanced data structures and algorithms using Java programming language. |
Assistants: Cem Keskin
ETA 201
Prerequisites by
topic
1. Programming in C, C++ 2. Fluency with the implementation of basic data structures
Topics
1. Introduction to Java Programming
(Background: Java review, some
examples of programming and exercises)
2. Algorithm Analysis ( … classes)
3. Hashing ( … classes)
4. Heap Structures (… classes)
5. Advanced Sorting (… classes)
6. Search Structures ( … classes)
7. Graphs (… classes)
8. Tests ( 3-4 classes)
Computer usage
1. 3-4 Computer homeworks and projects are assigned covering topics above.
This course includes components mainly two parts in its description: Engineering science: 1.5 credits or 37.5 %
Engineering design: 2.5 credits or 63.5 %
|
Prepared by Fikret Gürgen |
Date |
Basic for evaluation:
2 Midterm exams 45% (22.5% each)
Projects + quizzes +hmw 20%
Final exam 35%
Total 100%
A change of +- 5% may occur in the basis of evaluation!
Exam dates: (will be announced two weeks ago!)
Midterm
Midterm 2 July 2004
İmportant:
Projects and homeworks assigned in this course are essential for
passing the course. If you fail to submit on time, you will also fail the
course!