This discipline acquaints students with base conceptions of data structures and algorithms. The themes of course include a recursion, philosophy of object-oriented programming,
base data structures (including stacks, queues, linked lists, hash- tables, trees and graphs), basis of analysis of algorithms and strategy of constructing algorithms.

Course plan:
audience studies - 108 hrs.
individual work - 72 hrs.
total - 180 hrs.
semester - 3rd
form of control - exam.