CENG 383 - Algorithms

Instructor(s):

Yrd. Doç. Dr. Nurdan SARAN

E-mail:buz@cankaya.edu.tr

Yrd. Doç. Dr. Murat YILMAZ
E-mail:myilmaz@cankaya.edu.tr                                                               
                                                                                               
Description: Asymptotic notation. Divide and conquer approach. Solving recurrences: substitution method, master method. Bounding summations. Analysis of randomized quicksort. Heaps: heapsort, priority queues. Sorting in linear time. Greedy algorithms. Elementary graph algorithms: breadth-/depth-first search, topological sort, strongly connected components.

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.

The textbook Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne surveys the most important algorithms and data structures in use today.

References:

Michael T. Goodrich, Roberto Tamassia, Algorithm Design and Applications,  ISBN : 978-1-119-02861-1, December 2014.

Jeffrey J. McConnell. " Analysis of Algorithms: An Active Learning Approach"

E. Horowitz and S. Sahni," Fundamentals of Computer Algorithms", Computer Science Press 1978.

Jon Kleinberg, Eva Tardos. "Algorithm Design", Addison Wesley, Pearson Education, 2006.

Grading:
Homeworks (%20)  
Quiz (%30)
Midterm (%20)  
Final (%30)

 

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