Welcome, Guest . Login . Türkçe
Where Am I: Ninova / Courses / Faculty of Computer and Informatics / BLG 336E / Course Informations
 

Course Information

Course Name
Turkish Algoritma Analizi II
English Analysis of Algorithms II
Course Code
BLG 336E Credit Lecture
(hour/week)
Recitation
(hour/week)
Laboratory
(hour/week)
Semester 6
3 3 - -
Course Language English
Course Coordinator Zehra Çataltepe
Sema Fatma Oktuğ
Sanem Sarıel Uzer
Course Objectives 1. Practice mathematical thinking in the domain of algorithms.
2. Understand the importance of complexity in algorithmic level.
3. Be familiar with different classes of algorithms.
4. Be familiar with various problems and their algorithmic solutions.
5. Be familiar with the common properties of the different classes of algorithms.
Course Description This course aims to study the methods for designing efficient algorithms and to evaluate their performance (mainly in terms of time).
Course Outcomes 1. Ability to formulate the complexity of a given algorithm (problem) .
2. Ability to analyze the complexity of a given algorithm in terms of time .
3. Ability to compare the complexities of some algorithms used for the same purpose under various conditions .
4. Ability to develop a program to solve a specific problem considering some performance criteria .
Pre-requisite(s) Analysis of Algorithms I (BLG335E) or Advanced Data Structures (BLG381E)
Required Facilities
Other
Textbook J. Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, 2006.
Other References Introduction to Algorithms, Cormen, Leiserson and Rivest, The MIT Pres/McGraw-Hill.
Fundamentals of Algorithmics,Brassards and Bratley, Prentice Hall (Available at the Central Library, QA9.58.B73 1996). ?- Algorithms and Complexity, Wilf.
 
 
Courses . Help . About
Ninova is an ITU Office of Information Technologies Product. © 2021