Assistant: Coşkun Gündüz  email 

phone: (212) 311 54 52   room: D 127

This course covers the basic science behind the use of computers to provide effective and efficient methods for carrying out tasks. Tasks looked at include data storage and retrieval, sorting and searching, semi-numerical tasks such as encryption, planning and optimisation tasks, problems space searches and games playing. To carry out these tasks, both algorithms and structures for the storage of data need to be specified. mathematical tools have to be developed that enable us to measure the fundamental effectiveness of algorithms, and in particular the way these algorithms scale as the size of the task being performed increases. This course introduces the basic sorting and searching methods and dynamic data structures such as linked lists and trees.:
Prerequisite: . MATH 131, COMP 111 or COMP 151.

Course evaluation will be as follows:

b1 * B * (M + F + sum_1²⁰ P)
where b1 is the 'small' binary exams, B is the real thing, M and F are midterm (max 40 raw points) and final (max 60 raw points) respectively. And P is 1 point per correct, working, tested, and not copied (MOSS) project submission from the yet undefined list. Max point you can get  for P is  20.

Important dates:
8th week: 15th Nov midterm
9th week 19-23 Nov. small binary exam
last week of the term (To Be Announced)  binary exam.

Course Book: Introduction to Algorithms, Cormen T., Leiserson C., MIT Press, ISBN: 0-262-03293-7

Recommended Books:
1- The art of computer programming / Donald E. Knuth. Addison-Wesley
2- Algorithms in Java / Sedgewick R., Addison Wesley
3- Data Structures and Algorithm Analysis in Java / Weiss M.A., Addison Wesley
4- An Introduction to Design and Analysis of Algorithms / Levitin A.V., Addison Wesley  ISBN:0201743957