In this course students are learning various data structure which can be implemented in computer program. The material includes: Abstract Data Type (ADT), Logic List Representation in regard of Linier and its primitives, Physical List Representative in regards of its pointer, Ligic List Representative in regards of continum and its primitives, variety of List Linked Form (Double-Linked List, Circular List) ), multi-linked list, Case study of linked List, Stack, Queue, Recursive Function / Procedure, Tree: definition, data sturcture, function / procedure, preorder inorder postorder tracking, Graf: definition, data sturcture, algorithm : BFS, DFS, Topological Sort.