Announcements
Final grades are available. You can see your papers on 8/8/2008 Friday between 13:00-16:00.
Midterm 2 grades are available. You can see your papers on 6/8/2008 Wednesday between 09:00-11:30.
Midterm 1 grades are available. You can see your papers on 25/8/2008 Friday between 09:00-12:00.
Project #3 is announced. It is due August 3rd 23:59.
Project #2 is announced. It is due July 21st 23:59.
Midterm 1 will be held on 16th July at lecture time and in lecture place.
Project #1 is announced. It is due July 13th 23:59.
P.S. hours will be at 14:00-16:00 in ETA A3 every Monday during the summer term. The first P.S. is to be held on 30/06/2008.
Here is the guide to do and submit your projects.
The format for the documents you will submit for each project is here, but feel free to follow your way if you find it more explanatory. Report writing and your style is very important for your future career, both academic and business.
You can download JDK 6.0 and documentation from here.
The course-related announcements will appear in this section. Check frequently!
Grades
Syllabus
CmpE 250 Data Structures and Algorithms
Summer Semester 2008
|
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, 2007. |
|
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. |
Assistant:
Umut Konur
konur@boun.edu.tr
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 (Chapter 2) ( … classes)
3. Hashing (Chapter 5) ( … classes)
4. Heap Structures (Chapter 6) (… classes)
5. Sorting (Chapter 7) (… classes)
6. Graphs (Chapter 9) (… classes)
7. Tests ( 3-4 classes)
Computer usage
1. 3 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 17/06/2008 |
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)
Midterm 1 week of 14-16 July 2008
Midterm 2 week of 4-6 August 2008
Final will be annouced
İmportant:
Projects assigned in this course are essential for passing the course. If you fail to submit on time, you will also fail the course!