Akademik Dersler - İçerik

Analyzes simple algorithms.
Defines the meaning of iterative and recursive algorithms.
Calculates the running time of iterative algorithms.
Uses Big 'O' notation to express algorithmic running time.
Describes and analyzes elementary sorting algorithms such as Selection sort, Bubble sort, Insertion sort, and Shell sort.
Restates the fundamentals of basic data structures.
Understands and explains the concept of Abstract Data Types (ADT) – separation of definitions of data types from implementations.
Discusses basic ADTs such as stacks, queues, and trees
Discusses recursion and tree traversal algorithms.
Decribes search trees such as binary search trees and splay trees.
Discusses simple hashing schemes for searching.
Compares various hashing schemes and states the advantages and disadvantages of them.
Develops skills in implementations and applications of simple data structures.
Implements basic algorithms for sorting and searching.
Implements basic data structures such as stacks, queues and trees.
Applies algorithms and data structures in various real-life software problems.