CENG 383 - Algorithms

Instructor:

Prof. Dr. Hasan Oğul

E-mail: hasan.ogul@cankaya.edu.tr

Hours: Section 1: Monday 14.20-17.10, 

            Section 2: Tuesday 9.20-12.10                                            
                                                                                               
Description: Algorithm complexity. Asymptotic notation. Search and Sort algorithms. Divide and conquer approach. Sorting in linear time. Greedy algorithms. Dynamic Programming. Elementary graph algorithms. Minimum spanning tree. Shortest path.

Text Book:

T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein." Introduction to Algorithms", MIT Press and McGraw-Hill, 3. Edition, 2009.

Grading:


Online Submissions: 50%

Final Exam: 50 %
 

Links:

Sorting Algorithms:

http://www.sorting-algorithms.com/

Animations for Graph Search Algorithms:

http://www.cs.arizona.edu/classes/cs445/spring06/webresources.html

http://courses.cs.vt.edu/~csonline/Algorithms/Lessons/index.html