- Teacher: Mohammed ALAQAD
- Teacher: Meltem İMAMOĞLU
- Teacher: Gökhan ÖZÇETİN
- Teacher: Emre YILMAZ
- Teacher: Mohammed ALAQAD
- Teacher: Meltem İMAMOĞLU
- Teacher: Gökhan ÖZÇETİN
- Teacher: Emre YILMAZ
- Teacher: Mohammed ALAQAD
- Teacher: Meltem İMAMOĞLU
- Teacher: Gökhan ÖZÇETİN
- Teacher: Şadi Şehab
- Teacher: Mohammed ALAQAD
- Teacher: Meltem İMAMOĞLU
- Teacher: Gökhan ÖZÇETİN
- Teacher: Şadi Şehab
Students learn to implement and analyze elementary data structures and the basic complexity classes of algorithms that use strategies such as greedy algorithms, divide-and- conquer algorithms, and backtracking algorithms. This analysis is especially applied to problems in searching, sorting, and parsing.
- Teacher: Engin DEMIR
Students learn to implement and analyze elementary data structures and the basic complexity classes of algorithms that use strategies such as greedy algorithms, divide-and- conquer algorithms, and backtracking algorithms. This analysis is especially applied to problems in searching, sorting, and parsing.
- Teacher: Engin DEMIR
- Teacher: Mohammed ALAQAD
- Teacher: Deniz ÇETİNKAYA
- Teacher: Meltem İMAMOĞLU
- Teacher: Gökhan ÖZÇETİN
- Teacher: Mohammed ALAQAD
- Teacher: Deniz ÇETİNKAYA
- Teacher: Meltem İMAMOĞLU
- Teacher: Gökhan ÖZÇETİN