Welcome,
Guest
.
Login
.
Türkçe
NİNOVA
COURSES
HELP
ABOUT
Where Am I:
Ninova
/
Courses
/
Institute of Informatics
/
BBL 611E
/
Course Informations
Return to Faculty
Home Page
Course Information
Course Weekly Lecture Plan
Course Evaluation Criteria
Course Information
Course Name
Turkish
Algoritmalar Üzerinde İleri Konular
English
Advanced Topics in Algorithms
Course Code
BBL 611E
Credit
Lecture
(hour/week)
Recitation
(hour/week)
Laboratory
(hour/week)
Semester
-
3
3
-
-
Course Language
English
Course Coordinator
Muhammed Oğuzhan Külekci
Course Objectives
1) Understanding the fundamentals in algorithm design and analysis
2) Learning NP-complete concept and ways to approximate solutions
3) Using randomness in algorithm design
4) Learning methods to deal with the streaming data
5) Learning to deal with large data sets on external memory
Course Description
The course begins with the review of the time/space complexity analysis of algorithms and basic algorithm design approaches, which is to be followed by the NP-completeness concept. The basics in approximation algorithms, randomization, streaming algorithms, and external-memory algorithms will be explored. The data structures particularly serving for those algorithmic foundations will also be covered.
Course Outcomes
Pre-requisite(s)
Required Facilities
Other
Textbook
Other References
Courses
.
Help
.
About
Ninova is an ITU Office of Information Technologies Product. © 2025