Akademik Dersler - İçerik

Can explain the concept of algorithm and reveal its features.
Can list different methods used in algorithm representation.
Can recognize and summarize algorithm classes and design techniques.
Can explain the role of the algorithm in calculation and list the general stages of problem solving with the algorithm.
Can explain the importance of algorithm analysis and analyze a simple algorithm.
Can define the concepts of search algorithm and sorting algorithm and apply basic algorithms.
Can explain data structures and reveal their properties.
It can define array, linked list data structure, perform operations and perform operations on the elements of the array.
Can explain the logic of queue and stack structures and create queue and stack data structures with arrays and linked lists.
Can define the tree data structure, binary tree, binary search tree and AVL tree, list the methods of navigating the tree, and explain the operations that can be performed on the tree.
Can summarize the basic properties of heap trees and addition and removal operations in this data structure.
Can define a hash table data structure and hash functions, and list methods for resolving conflicts that occur in hash functions.
Can define the concept of graph, use graph search algorithm and shortest path finding algorithms.
Can adapt data structures and algorithms to real-life problems.
Can decide on a sorting algorithm suitable for a real-life problem and implement it.
Can decide on a search algorithm suitable for a real-life problem and implement it.
Can decide on a data structure suitable for a real-life problem and implement it.