Data Structure and Fundamentals of Algorithms

The contents of the Data Structure and Algorithmics course include data structures and abstract data types, algorithmic properties and classification, algorithmic efficiency and metrics, linear structures, sequence lists, linked lists, stacks and queues, stacks and recursion, recursion to non-recursion, storage structures for strings, algorithmic implementations of string arithmetic, fast pattern matching for strings, abstract data types for binary trees, searching of binary trees, storage structures of binary trees, equivalent conversions between trees and binary trees, abstract data types of trees and tree traversal, linked storage structure of trees, father pointer representation of trees, sequential storage of trees and K-fork trees, concepts and abstract data types of graphs, storage structure of graphs, graph traversal, internal sort, retrieval, and so on.